./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b2a57ed806019e2a314732595f6a56c6ec2b2df5289c00e3d1fce673fb6d9182 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:33:58,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:33:58,073 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:33:58,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:33:58,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:33:58,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:33:58,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:33:58,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:33:58,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:33:58,096 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:33:58,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:33:58,096 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:33:58,096 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:33:58,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:33:58,097 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:33:58,097 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:33:58,097 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:33:58,097 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:33:58,097 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:33:58,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:33:58,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:33:58,097 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:33:58,097 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:33:58,097 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:33:58,097 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:33:58,097 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:33:58,097 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:33:58,097 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:33:58,097 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:33:58,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:33:58,098 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:33:58,098 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:33:58,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:33:58,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:33:58,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:33:58,098 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:33:58,098 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:33:58,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:33:58,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:33:58,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:33:58,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:33:58,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:33:58,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:33:58,099 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b2a57ed806019e2a314732595f6a56c6ec2b2df5289c00e3d1fce673fb6d9182 [2025-03-03 19:33:58,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:33:58,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:33:58,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:33:58,365 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:33:58,365 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:33:58,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i [2025-03-03 19:33:59,540 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af6e87dc1/e1c862d925e64fa98085bc0cdd96e848/FLAG996a49090 [2025-03-03 19:33:59,789 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:33:59,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i [2025-03-03 19:33:59,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af6e87dc1/e1c862d925e64fa98085bc0cdd96e848/FLAG996a49090 [2025-03-03 19:33:59,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af6e87dc1/e1c862d925e64fa98085bc0cdd96e848 [2025-03-03 19:33:59,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:33:59,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:33:59,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:33:59,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:33:59,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:33:59,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:33:59" (1/1) ... [2025-03-03 19:33:59,830 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e42eceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:59, skipping insertion in model container [2025-03-03 19:33:59,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:33:59" (1/1) ... [2025-03-03 19:33:59,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:33:59,951 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i[915,928] [2025-03-03 19:34:00,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:34:00,017 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:34:00,025 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i[915,928] [2025-03-03 19:34:00,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:34:00,077 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:34:00,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:00 WrapperNode [2025-03-03 19:34:00,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:34:00,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:34:00,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:34:00,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:34:00,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:00" (1/1) ... [2025-03-03 19:34:00,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:00" (1/1) ... [2025-03-03 19:34:00,114 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2025-03-03 19:34:00,114 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:34:00,115 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:34:00,115 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:34:00,115 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:34:00,121 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:00" (1/1) ... [2025-03-03 19:34:00,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:00" (1/1) ... [2025-03-03 19:34:00,124 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:00" (1/1) ... [2025-03-03 19:34:00,139 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 19:34:00,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:00" (1/1) ... [2025-03-03 19:34:00,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:00" (1/1) ... [2025-03-03 19:34:00,144 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:00" (1/1) ... [2025-03-03 19:34:00,145 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:00" (1/1) ... [2025-03-03 19:34:00,146 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:00" (1/1) ... [2025-03-03 19:34:00,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:00" (1/1) ... [2025-03-03 19:34:00,149 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:34:00,150 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:34:00,150 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:34:00,150 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:34:00,151 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:00" (1/1) ... [2025-03-03 19:34:00,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:34:00,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:34:00,184 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:34:00,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:34:00,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:34:00,208 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:34:00,208 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:34:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:34:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:34:00,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:34:00,281 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:34:00,283 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:34:00,527 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L158: havoc property_#t~bitwise22#1;havoc property_#t~short23#1; [2025-03-03 19:34:00,560 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 19:34:00,561 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:34:00,571 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:34:00,571 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-03 19:34:00,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:34:00 BoogieIcfgContainer [2025-03-03 19:34:00,572 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:34:00,574 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:34:00,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:34:00,577 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:34:00,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:33:59" (1/3) ... [2025-03-03 19:34:00,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de60b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:34:00, skipping insertion in model container [2025-03-03 19:34:00,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:00" (2/3) ... [2025-03-03 19:34:00,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de60b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:34:00, skipping insertion in model container [2025-03-03 19:34:00,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:34:00" (3/3) ... [2025-03-03 19:34:00,579 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-27.i [2025-03-03 19:34:00,590 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:34:00,591 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-27.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:34:00,631 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:34:00,639 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6e1f54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:34:00,640 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:34:00,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 53 states have internal predecessors, (69), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 19:34:00,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-03 19:34:00,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:00,653 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:34:00,654 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:00,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:00,658 INFO L85 PathProgramCache]: Analyzing trace with hash 606929389, now seen corresponding path program 1 times [2025-03-03 19:34:00,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:34:00,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553460687] [2025-03-03 19:34:00,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:00,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:34:00,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 19:34:00,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 19:34:00,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:00,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-03 19:34:00,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:34:00,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553460687] [2025-03-03 19:34:00,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553460687] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:34:00,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649447236] [2025-03-03 19:34:00,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:00,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:34:00,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:34:00,956 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:34:00,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 19:34:01,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 19:34:01,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 19:34:01,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:01,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:01,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:34:01,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:34:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-03 19:34:01,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:34:01,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649447236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:34:01,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:34:01,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:34:01,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525214937] [2025-03-03 19:34:01,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:34:01,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:34:01,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:34:01,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:34:01,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:34:01,191 INFO L87 Difference]: Start difference. First operand has 84 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 53 states have internal predecessors, (69), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 19:34:01,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:01,211 INFO L93 Difference]: Finished difference Result 162 states and 278 transitions. [2025-03-03 19:34:01,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:34:01,213 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 182 [2025-03-03 19:34:01,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:01,219 INFO L225 Difference]: With dead ends: 162 [2025-03-03 19:34:01,219 INFO L226 Difference]: Without dead ends: 81 [2025-03-03 19:34:01,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:34:01,227 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:34:01,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:34:01,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-03 19:34:01,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-03 19:34:01,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 19:34:01,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 122 transitions. [2025-03-03 19:34:01,269 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 122 transitions. Word has length 182 [2025-03-03 19:34:01,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:01,269 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 122 transitions. [2025-03-03 19:34:01,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 19:34:01,270 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 122 transitions. [2025-03-03 19:34:01,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-03 19:34:01,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:01,273 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:34:01,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 19:34:01,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 19:34:01,474 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:01,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:01,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1009583474, now seen corresponding path program 1 times [2025-03-03 19:34:01,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:34:01,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862842470] [2025-03-03 19:34:01,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:01,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:34:01,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 19:34:01,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 19:34:01,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:01,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:01,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 19:34:01,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:34:01,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862842470] [2025-03-03 19:34:01,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862842470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:34:01,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:34:01,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:34:01,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137216524] [2025-03-03 19:34:01,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:34:01,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:34:01,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:34:01,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:34:01,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:34:01,927 INFO L87 Difference]: Start difference. First operand 81 states and 122 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 19:34:02,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:02,010 INFO L93 Difference]: Finished difference Result 237 states and 360 transitions. [2025-03-03 19:34:02,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:34:02,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 182 [2025-03-03 19:34:02,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:02,013 INFO L225 Difference]: With dead ends: 237 [2025-03-03 19:34:02,013 INFO L226 Difference]: Without dead ends: 159 [2025-03-03 19:34:02,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:34:02,014 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 61 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:34:02,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 368 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:34:02,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-03 19:34:02,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2025-03-03 19:34:02,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 94 states have internal predecessors, (118), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 19:34:02,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 234 transitions. [2025-03-03 19:34:02,052 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 234 transitions. Word has length 182 [2025-03-03 19:34:02,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:02,054 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 234 transitions. [2025-03-03 19:34:02,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 19:34:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 234 transitions. [2025-03-03 19:34:02,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-03 19:34:02,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:02,058 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:34:02,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:34:02,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:02,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:02,058 INFO L85 PathProgramCache]: Analyzing trace with hash 2129524794, now seen corresponding path program 1 times [2025-03-03 19:34:02,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:34:02,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041694815] [2025-03-03 19:34:02,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:02,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:34:02,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 19:34:02,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 19:34:02,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:02,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:02,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 19:34:02,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:34:02,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041694815] [2025-03-03 19:34:02,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041694815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:34:02,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:34:02,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:34:02,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995064668] [2025-03-03 19:34:02,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:34:02,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:34:02,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:34:02,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:34:02,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:34:02,455 INFO L87 Difference]: Start difference. First operand 155 states and 234 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 19:34:02,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:02,639 INFO L93 Difference]: Finished difference Result 309 states and 469 transitions. [2025-03-03 19:34:02,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:34:02,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 183 [2025-03-03 19:34:02,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:02,641 INFO L225 Difference]: With dead ends: 309 [2025-03-03 19:34:02,643 INFO L226 Difference]: Without dead ends: 157 [2025-03-03 19:34:02,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:34:02,647 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 120 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:34:02,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 161 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:34:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-03 19:34:02,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-03-03 19:34:02,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 96 states have (on average 1.25) internal successors, (120), 96 states have internal predecessors, (120), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 19:34:02,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 236 transitions. [2025-03-03 19:34:02,681 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 236 transitions. Word has length 183 [2025-03-03 19:34:02,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:02,682 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 236 transitions. [2025-03-03 19:34:02,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 19:34:02,682 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 236 transitions. [2025-03-03 19:34:02,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-03 19:34:02,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:02,684 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:34:02,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:34:02,684 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:02,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:02,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1242833744, now seen corresponding path program 1 times [2025-03-03 19:34:02,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:34:02,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797580289] [2025-03-03 19:34:02,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:02,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:34:02,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-03 19:34:02,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-03 19:34:02,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:02,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:03,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 117 proven. 117 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2025-03-03 19:34:03,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:34:03,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797580289] [2025-03-03 19:34:03,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797580289] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:34:03,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104589538] [2025-03-03 19:34:03,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:03,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:34:03,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:34:03,499 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:34:03,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 19:34:03,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-03 19:34:03,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-03 19:34:03,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:03,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:03,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 19:34:03,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:34:04,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 965 proven. 117 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2025-03-03 19:34:04,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:34:04,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 117 proven. 126 refuted. 0 times theorem prover too weak. 1381 trivial. 0 not checked. [2025-03-03 19:34:04,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104589538] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:34:04,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:34:04,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 23 [2025-03-03 19:34:04,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121215548] [2025-03-03 19:34:04,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:34:04,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 19:34:04,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:34:04,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 19:34:04,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2025-03-03 19:34:04,936 INFO L87 Difference]: Start difference. First operand 157 states and 236 transitions. Second operand has 23 states, 23 states have (on average 3.260869565217391) internal successors, (75), 23 states have internal predecessors, (75), 4 states have call successors, (45), 4 states have call predecessors, (45), 10 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2025-03-03 19:34:06,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:06,134 INFO L93 Difference]: Finished difference Result 395 states and 563 transitions. [2025-03-03 19:34:06,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-03 19:34:06,135 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.260869565217391) internal successors, (75), 23 states have internal predecessors, (75), 4 states have call successors, (45), 4 states have call predecessors, (45), 10 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) Word has length 184 [2025-03-03 19:34:06,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:06,137 INFO L225 Difference]: With dead ends: 395 [2025-03-03 19:34:06,138 INFO L226 Difference]: Without dead ends: 316 [2025-03-03 19:34:06,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 360 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=638, Invalid=1912, Unknown=0, NotChecked=0, Total=2550 [2025-03-03 19:34:06,139 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 390 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 19:34:06,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 691 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 19:34:06,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-03 19:34:06,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 289. [2025-03-03 19:34:06,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 177 states have (on average 1.192090395480226) internal successors, (211), 178 states have internal predecessors, (211), 99 states have call successors, (99), 12 states have call predecessors, (99), 12 states have return successors, (99), 98 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-03 19:34:06,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 409 transitions. [2025-03-03 19:34:06,193 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 409 transitions. Word has length 184 [2025-03-03 19:34:06,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:06,194 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 409 transitions. [2025-03-03 19:34:06,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.260869565217391) internal successors, (75), 23 states have internal predecessors, (75), 4 states have call successors, (45), 4 states have call predecessors, (45), 10 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2025-03-03 19:34:06,194 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 409 transitions. [2025-03-03 19:34:06,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-03 19:34:06,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:06,196 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:34:06,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 19:34:06,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 19:34:06,398 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:06,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:06,399 INFO L85 PathProgramCache]: Analyzing trace with hash 199655469, now seen corresponding path program 1 times [2025-03-03 19:34:06,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:34:06,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555605962] [2025-03-03 19:34:06,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:06,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:34:06,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-03 19:34:06,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-03 19:34:06,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:06,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:34:06,490 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:34:06,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-03 19:34:06,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-03 19:34:06,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:06,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:34:06,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:34:06,609 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:34:06,610 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:34:06,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:34:06,613 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-03 19:34:06,742 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:34:06,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:34:06 BoogieIcfgContainer [2025-03-03 19:34:06,746 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:34:06,747 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:34:06,747 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:34:06,748 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:34:06,748 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:34:00" (3/4) ... [2025-03-03 19:34:06,750 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:34:06,751 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:34:06,754 INFO L158 Benchmark]: Toolchain (without parser) took 6931.95ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 122.8MB in the beginning and 195.3MB in the end (delta: -72.4MB). Peak memory consumption was 146.7MB. Max. memory is 16.1GB. [2025-03-03 19:34:06,754 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:34:06,754 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.04ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 107.9MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:34:06,754 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.33ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 105.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:34:06,755 INFO L158 Benchmark]: Boogie Preprocessor took 34.24ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 102.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:34:06,755 INFO L158 Benchmark]: IcfgBuilder took 422.04ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 79.6MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 19:34:06,755 INFO L158 Benchmark]: TraceAbstraction took 6172.50ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 79.6MB in the beginning and 195.4MB in the end (delta: -115.8MB). Peak memory consumption was 104.7MB. Max. memory is 16.1GB. [2025-03-03 19:34:06,755 INFO L158 Benchmark]: Witness Printer took 6.55ms. Allocated memory is still 385.9MB. Free memory was 195.4MB in the beginning and 195.3MB in the end (delta: 120.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:34:06,756 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.04ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 107.9MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.33ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 105.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.24ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 102.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 422.04ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 79.6MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6172.50ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 79.6MB in the beginning and 195.4MB in the end (delta: -115.8MB). Peak memory consumption was 104.7MB. Max. memory is 16.1GB. * Witness Printer took 6.55ms. Allocated memory is still 385.9MB. Free memory was 195.4MB in the beginning and 195.3MB in the end (delta: 120.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someBinaryFLOATComparisonOperation at line 127, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 158, overapproximation of someBinaryFLOATComparisonOperation at line 158, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 147, overapproximation of someBinaryArithmeticFLOAToperation at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.9; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 31.5; [L26] float var_1_5 = 25.4; [L27] float var_1_6 = 9.5; [L28] float var_1_7 = 63.2; [L29] unsigned long int var_1_8 = 1; [L30] signed short int var_1_10 = -50; [L31] unsigned long int var_1_11 = 8; [L32] unsigned char var_1_12 = 32; [L33] float var_1_13 = 15.625; [L34] unsigned char var_1_14 = 1; [L35] unsigned char var_1_15 = 0; [L36] unsigned char var_1_16 = 1; [L37] unsigned char var_1_17 = 1; [L38] unsigned char var_1_19 = 0; [L39] unsigned char var_1_20 = 8; [L40] unsigned short int var_1_21 = 16; [L41] unsigned short int var_1_22 = 128; [L42] signed short int var_1_23 = 128; [L43] signed short int var_1_24 = -256; [L44] unsigned short int var_1_25 = 32; [L45] unsigned short int var_1_26 = 128; [L46] double var_1_27 = 25.5; [L47] double var_1_28 = 200.9; [L48] signed char var_1_29 = -10; [L49] signed char var_1_30 = -32; [L50] signed char var_1_31 = -5; [L51] unsigned char var_1_32 = 1; [L52] double var_1_33 = 199.5; [L53] unsigned long int var_1_34 = 4; VAL [isInitial=0, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=0, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L162] isInitial = 1 [L163] FCALL initially() [L164] COND TRUE 1 [L165] FCALL updateLastVariables() [L166] CALL updateVariables() [L108] var_1_2 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L109] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L110] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L110] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L111] var_1_3 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L112] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L113] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L113] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L114] var_1_4 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L115] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L116] var_1_5 = __VERIFIER_nondet_float() [L117] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L117] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L118] var_1_6 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_7=316/5, var_1_8=1] [L119] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_7=316/5, var_1_8=1] [L120] var_1_7 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L121] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L122] var_1_11 = __VERIFIER_nondet_ulong() [L123] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L123] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L124] CALL assume_abort_if_not(var_1_11 <= 33) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L124] RET assume_abort_if_not(var_1_11 <= 33) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L125] var_1_13 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L126] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L127] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L127] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L128] var_1_15 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L129] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L130] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L130] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L131] var_1_16 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L132] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L133] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L133] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L134] var_1_17 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L135] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L136] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L136] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L137] var_1_19 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L138] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L139] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L139] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=-256, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L140] var_1_24 = __VERIFIER_nondet_short() [L141] CALL assume_abort_if_not(var_1_24 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L141] RET assume_abort_if_not(var_1_24 >= -32767) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L142] CALL assume_abort_if_not(var_1_24 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L142] RET assume_abort_if_not(var_1_24 <= 32766) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_26=128, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L143] var_1_26 = __VERIFIER_nondet_ushort() [L144] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L144] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L145] CALL assume_abort_if_not(var_1_26 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L145] RET assume_abort_if_not(var_1_26 <= 65534) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_28=2009/10, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L146] var_1_28 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_28 >= -922337.2036854765600e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L147] RET assume_abort_if_not((var_1_28 >= -922337.2036854765600e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=-32, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L148] var_1_30 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_30 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=126, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=126, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L149] RET assume_abort_if_not(var_1_30 >= -127) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=126, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L150] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=126, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=126, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L150] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=126, var_1_31=-5, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L151] var_1_31 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_31 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=126, var_1_31=-1, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=126, var_1_31=-1, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L152] RET assume_abort_if_not(var_1_31 >= -127) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=126, var_1_31=-1, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L153] CALL assume_abort_if_not(var_1_31 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=126, var_1_31=-1, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=126, var_1_31=-1, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L153] RET assume_abort_if_not(var_1_31 <= 126) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_24=32766, var_1_25=32, var_1_26=0, var_1_27=51/2, var_1_29=-10, var_1_2=1, var_1_30=126, var_1_31=-1, var_1_32=1, var_1_33=399/2, var_1_34=4, var_1_3=0, var_1_8=1] [L166] RET updateVariables() [L167] CALL step() [L57] var_1_23 = var_1_24 [L58] var_1_25 = var_1_26 [L59] var_1_27 = var_1_28 [L60] var_1_29 = ((((((((10) > (var_1_30)) ? (10) : (var_1_30)))) < (((((var_1_31) > (-8)) ? (var_1_31) : (-8))))) ? (((((10) > (var_1_30)) ? (10) : (var_1_30)))) : (((((var_1_31) > (-8)) ? (var_1_31) : (-8)))))) [L61] var_1_32 = 1 [L62] var_1_33 = var_1_28 [L63] var_1_34 = var_1_26 VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=32766, var_1_24=32766, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=-1, var_1_2=1, var_1_30=126, var_1_31=-1, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=0, var_1_8=1] [L64] COND TRUE var_1_6 == (var_1_4 / var_1_13) [L65] var_1_12 = var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=32766, var_1_24=32766, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=-1, var_1_2=1, var_1_30=126, var_1_31=-1, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=0, var_1_8=1] [L67] var_1_20 = var_1_11 [L68] var_1_21 = 8 VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=4294967296, var_1_21=8, var_1_22=128, var_1_23=32766, var_1_24=32766, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=-1, var_1_2=1, var_1_30=126, var_1_31=-1, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=0, var_1_8=1] [L69] EXPR 2u >> var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=4294967296, var_1_21=8, var_1_22=128, var_1_23=32766, var_1_24=32766, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=-1, var_1_2=1, var_1_30=126, var_1_31=-1, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=0, var_1_8=1] [L69] COND TRUE (var_1_21 + var_1_12) > (2u >> var_1_11) [L70] COND TRUE var_1_12 != var_1_21 [L71] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=0, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=4294967296, var_1_21=8, var_1_22=128, var_1_23=32766, var_1_24=32766, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=-1, var_1_2=1, var_1_30=126, var_1_31=-1, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=0, var_1_8=1] [L76] COND FALSE !(! var_1_2) VAL [isInitial=1, var_1_10=0, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=4294967296, var_1_21=8, var_1_22=128, var_1_23=32766, var_1_24=32766, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=-1, var_1_2=1, var_1_30=126, var_1_31=-1, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=0, var_1_8=1] [L87] unsigned char stepLocal_1 = var_1_14; [L88] unsigned char stepLocal_0 = var_1_14; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_10=0, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=4294967296, var_1_21=8, var_1_22=128, var_1_23=32766, var_1_24=32766, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=-1, var_1_2=1, var_1_30=126, var_1_31=-1, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=0, var_1_8=1] [L89] COND TRUE var_1_14 || stepLocal_0 VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=4294967296, var_1_21=8, var_1_22=128, var_1_23=32766, var_1_24=32766, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=-1, var_1_2=1, var_1_30=126, var_1_31=-1, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=0, var_1_8=1] [L90] COND TRUE stepLocal_1 || var_1_14 [L91] var_1_1 = (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7) VAL [isInitial=1, var_1_10=0, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=4294967296, var_1_21=8, var_1_22=128, var_1_23=32766, var_1_24=32766, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=-1, var_1_2=1, var_1_30=126, var_1_31=-1, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=0, var_1_8=1] [L98] COND FALSE !(var_1_6 > (- var_1_7)) [L103] var_1_8 = var_1_20 VAL [isInitial=1, var_1_10=0, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=4294967296, var_1_21=8, var_1_22=128, var_1_23=32766, var_1_24=32766, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=-1, var_1_2=1, var_1_30=126, var_1_31=-1, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=0, var_1_8=0] [L105] var_1_22 = var_1_8 VAL [isInitial=1, var_1_10=0, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=4294967296, var_1_21=8, var_1_22=0, var_1_23=32766, var_1_24=32766, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=-1, var_1_2=1, var_1_30=126, var_1_31=-1, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=0, var_1_8=0] [L167] RET step() [L168] CALL, EXPR property() [L158] EXPR (((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=4294967296, var_1_21=8, var_1_22=0, var_1_23=32766, var_1_24=32766, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=-1, var_1_2=1, var_1_30=126, var_1_31=-1, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=0, var_1_8=0] [L158-L159] return ((((((((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1)) && ((var_1_6 == (var_1_4 / var_1_13)) ? (var_1_12 == ((unsigned char) var_1_11)) : 1)) && ((! var_1_2) ? ((var_1_2 || var_1_3) ? (var_1_14 == ((unsigned char) ((! (! var_1_15)) && (var_1_16 && var_1_17)))) : ((((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))) >= var_1_21) ? (var_1_14 == ((unsigned char) (var_1_2 || var_1_16))) : (var_1_14 == ((unsigned char) (! var_1_19))))) : 1)) && (var_1_20 == ((unsigned char) var_1_11))) && (var_1_21 == ((unsigned short int) 8))) && (var_1_22 == ((unsigned short int) var_1_8)) ; [L168] RET, EXPR property() [L168] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=4294967296, var_1_21=8, var_1_22=0, var_1_23=32766, var_1_24=32766, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=-1, var_1_2=1, var_1_30=126, var_1_31=-1, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=4294967296, var_1_21=8, var_1_22=0, var_1_23=32766, var_1_24=32766, var_1_25=0, var_1_26=0, var_1_27=4294967301, var_1_28=4294967301, var_1_29=-1, var_1_2=1, var_1_30=126, var_1_31=-1, var_1_32=1, var_1_33=4294967301, var_1_34=0, var_1_3=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 5, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 608 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 571 mSDsluCounter, 1340 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 835 mSDsCounter, 285 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1096 IncrementalHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 285 mSolverCounterUnsat, 505 mSDtfsCounter, 1096 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 604 GetRequests, 548 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=289occurred in iteration=4, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 31 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1281 NumberOfCodeBlocks, 1281 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1274 ConstructedInterpolants, 0 QuantifiedInterpolants, 3781 SizeOfPredicates, 6 NumberOfNonLiveVariables, 865 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 10952/11368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 19:34:06,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b2a57ed806019e2a314732595f6a56c6ec2b2df5289c00e3d1fce673fb6d9182 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:34:08,740 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:34:08,818 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:34:08,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:34:08,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:34:08,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:34:08,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:34:08,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:34:08,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:34:08,856 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:34:08,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:34:08,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:34:08,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:34:08,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:34:08,858 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:34:08,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:34:08,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:34:08,858 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:34:08,858 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:34:08,858 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:34:08,858 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:34:08,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:34:08,858 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:34:08,859 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:34:08,859 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:34:08,859 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:34:08,859 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:34:08,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:34:08,859 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:34:08,859 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:34:08,860 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:34:08,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:34:08,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:34:08,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:34:08,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:34:08,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:34:08,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:34:08,860 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:34:08,860 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:34:08,860 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:34:08,860 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:34:08,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:34:08,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:34:08,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:34:08,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:34:08,860 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b2a57ed806019e2a314732595f6a56c6ec2b2df5289c00e3d1fce673fb6d9182 [2025-03-03 19:34:09,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:34:09,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:34:09,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:34:09,112 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:34:09,113 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:34:09,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i [2025-03-03 19:34:10,320 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae5c44f84/b19d35b5a09444959fc2fef2be7faf48/FLAG043aadb5e [2025-03-03 19:34:10,545 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:34:10,546 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i [2025-03-03 19:34:10,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae5c44f84/b19d35b5a09444959fc2fef2be7faf48/FLAG043aadb5e [2025-03-03 19:34:10,911 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae5c44f84/b19d35b5a09444959fc2fef2be7faf48 [2025-03-03 19:34:10,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:34:10,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:34:10,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:34:10,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:34:10,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:34:10,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:34:10" (1/1) ... [2025-03-03 19:34:10,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43120689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:10, skipping insertion in model container [2025-03-03 19:34:10,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:34:10" (1/1) ... [2025-03-03 19:34:10,941 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:34:11,048 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i[915,928] [2025-03-03 19:34:11,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:34:11,109 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:34:11,116 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-27.i[915,928] [2025-03-03 19:34:11,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:34:11,151 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:34:11,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:11 WrapperNode [2025-03-03 19:34:11,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:34:11,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:34:11,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:34:11,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:34:11,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:11" (1/1) ... [2025-03-03 19:34:11,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:11" (1/1) ... [2025-03-03 19:34:11,185 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2025-03-03 19:34:11,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:34:11,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:34:11,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:34:11,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:34:11,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:11" (1/1) ... [2025-03-03 19:34:11,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:11" (1/1) ... [2025-03-03 19:34:11,197 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:11" (1/1) ... [2025-03-03 19:34:11,214 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 19:34:11,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:11" (1/1) ... [2025-03-03 19:34:11,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:11" (1/1) ... [2025-03-03 19:34:11,228 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:11" (1/1) ... [2025-03-03 19:34:11,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:11" (1/1) ... [2025-03-03 19:34:11,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:11" (1/1) ... [2025-03-03 19:34:11,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:11" (1/1) ... [2025-03-03 19:34:11,234 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:34:11,235 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:34:11,235 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:34:11,235 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:34:11,236 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:11" (1/1) ... [2025-03-03 19:34:11,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:34:11,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:34:11,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:34:11,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:34:11,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:34:11,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:34:11,302 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:34:11,302 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:34:11,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:34:11,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:34:11,376 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:34:11,378 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:34:16,906 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 19:34:16,906 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:34:16,918 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:34:16,918 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:34:16,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:34:16 BoogieIcfgContainer [2025-03-03 19:34:16,918 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:34:16,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:34:16,920 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:34:16,923 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:34:16,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:34:10" (1/3) ... [2025-03-03 19:34:16,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb8c4e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:34:16, skipping insertion in model container [2025-03-03 19:34:16,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:11" (2/3) ... [2025-03-03 19:34:16,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb8c4e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:34:16, skipping insertion in model container [2025-03-03 19:34:16,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:34:16" (3/3) ... [2025-03-03 19:34:16,925 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-27.i [2025-03-03 19:34:16,935 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:34:16,936 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-27.i that has 2 procedures, 77 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:34:16,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:34:16,981 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2271f55e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:34:16,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:34:16,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 46 states have internal predecessors, (59), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 19:34:16,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 19:34:16,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:16,993 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:34:16,993 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:16,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:16,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1156089899, now seen corresponding path program 1 times [2025-03-03 19:34:17,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:34:17,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190860098] [2025-03-03 19:34:17,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:17,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:34:17,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:34:17,008 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:34:17,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 19:34:17,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 19:34:17,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 19:34:17,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:17,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:17,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:34:17,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:34:17,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2025-03-03 19:34:17,472 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:34:17,474 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:34:17,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190860098] [2025-03-03 19:34:17,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190860098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:34:17,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:34:17,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:34:17,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820712978] [2025-03-03 19:34:17,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:34:17,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:34:17,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:34:17,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:34:17,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:34:17,493 INFO L87 Difference]: Start difference. First operand has 77 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 46 states have internal predecessors, (59), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 19:34:17,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:17,517 INFO L93 Difference]: Finished difference Result 148 states and 258 transitions. [2025-03-03 19:34:17,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:34:17,519 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 179 [2025-03-03 19:34:17,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:17,524 INFO L225 Difference]: With dead ends: 148 [2025-03-03 19:34:17,524 INFO L226 Difference]: Without dead ends: 74 [2025-03-03 19:34:17,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:34:17,531 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:34:17,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:34:17,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-03 19:34:17,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-03 19:34:17,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 19:34:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 112 transitions. [2025-03-03 19:34:17,565 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 112 transitions. Word has length 179 [2025-03-03 19:34:17,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:17,565 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 112 transitions. [2025-03-03 19:34:17,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 19:34:17,566 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 112 transitions. [2025-03-03 19:34:17,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 19:34:17,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:17,568 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:34:17,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:34:17,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:34:17,769 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:17,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:17,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1920510576, now seen corresponding path program 1 times [2025-03-03 19:34:17,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:34:17,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991793239] [2025-03-03 19:34:17,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:17,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:34:17,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:34:17,773 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:34:17,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 19:34:17,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 19:34:18,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 19:34:18,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:18,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:18,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 19:34:18,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:34:18,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 730 proven. 57 refuted. 0 times theorem prover too weak. 837 trivial. 0 not checked. [2025-03-03 19:34:18,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:34:19,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 19:34:19,340 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:34:19,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991793239] [2025-03-03 19:34:19,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991793239] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 19:34:19,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:34:19,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-03 19:34:19,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452036163] [2025-03-03 19:34:19,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:34:19,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:34:19,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:34:19,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:34:19,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:34:19,343 INFO L87 Difference]: Start difference. First operand 74 states and 112 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 19:34:20,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:34:23,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:34:23,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:23,996 INFO L93 Difference]: Finished difference Result 149 states and 224 transitions. [2025-03-03 19:34:24,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:34:24,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 179 [2025-03-03 19:34:24,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:24,027 INFO L225 Difference]: With dead ends: 149 [2025-03-03 19:34:24,027 INFO L226 Difference]: Without dead ends: 78 [2025-03-03 19:34:24,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:34:24,028 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 53 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:34:24,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 160 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-03 19:34:24,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-03 19:34:24,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-03 19:34:24,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 19:34:24,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 114 transitions. [2025-03-03 19:34:24,036 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 114 transitions. Word has length 179 [2025-03-03 19:34:24,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:24,037 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 114 transitions. [2025-03-03 19:34:24,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 19:34:24,037 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 114 transitions. [2025-03-03 19:34:24,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-03 19:34:24,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:24,042 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:34:24,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 19:34:24,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:34:24,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:24,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:24,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1579471993, now seen corresponding path program 1 times [2025-03-03 19:34:24,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:34:24,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851587166] [2025-03-03 19:34:24,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:24,244 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:34:24,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:34:24,247 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:34:24,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 19:34:24,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 19:34:24,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 19:34:24,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:24,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:24,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 19:34:24,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:34:25,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 19:34:25,436 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:34:25,436 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:34:25,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851587166] [2025-03-03 19:34:25,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1851587166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:34:25,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:34:25,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:34:25,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369010995] [2025-03-03 19:34:25,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:34:25,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:34:25,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:34:25,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:34:25,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:34:25,437 INFO L87 Difference]: Start difference. First operand 78 states and 114 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 19:34:28,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:34:28,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:28,600 INFO L93 Difference]: Finished difference Result 228 states and 336 transitions. [2025-03-03 19:34:28,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:34:28,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 180 [2025-03-03 19:34:28,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:28,631 INFO L225 Difference]: With dead ends: 228 [2025-03-03 19:34:28,631 INFO L226 Difference]: Without dead ends: 153 [2025-03-03 19:34:28,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:34:28,632 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 17 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:34:28,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 217 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-03 19:34:28,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-03 19:34:28,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2025-03-03 19:34:28,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 86 states have (on average 1.186046511627907) internal successors, (102), 86 states have internal predecessors, (102), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 19:34:28,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 218 transitions. [2025-03-03 19:34:28,655 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 218 transitions. Word has length 180 [2025-03-03 19:34:28,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:28,655 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 218 transitions. [2025-03-03 19:34:28,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 19:34:28,655 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 218 transitions. [2025-03-03 19:34:28,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 19:34:28,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:28,657 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:34:28,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-03 19:34:28,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:34:28,858 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:28,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:28,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1359376114, now seen corresponding path program 1 times [2025-03-03 19:34:28,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:34:28,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1173270889] [2025-03-03 19:34:28,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:28,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:34:28,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:34:28,860 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:34:28,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 19:34:28,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 19:34:29,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 19:34:29,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:29,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:29,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 19:34:29,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:34:30,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 965 proven. 117 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2025-03-03 19:34:30,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:34:32,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 117 proven. 126 refuted. 0 times theorem prover too weak. 1381 trivial. 0 not checked. [2025-03-03 19:34:32,057 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:34:32,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1173270889] [2025-03-03 19:34:32,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1173270889] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:34:32,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 19:34:32,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2025-03-03 19:34:32,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078339274] [2025-03-03 19:34:32,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 19:34:32,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 19:34:32,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:34:32,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 19:34:32,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2025-03-03 19:34:32,059 INFO L87 Difference]: Start difference. First operand 149 states and 218 transitions. Second operand has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 4 states have call successors, (45), 4 states have call predecessors, (45), 10 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2025-03-03 19:34:36,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:34:38,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:38,135 INFO L93 Difference]: Finished difference Result 391 states and 538 transitions. [2025-03-03 19:34:38,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-03 19:34:38,136 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 4 states have call successors, (45), 4 states have call predecessors, (45), 10 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) Word has length 181 [2025-03-03 19:34:38,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:38,138 INFO L225 Difference]: With dead ends: 391 [2025-03-03 19:34:38,139 INFO L226 Difference]: Without dead ends: 316 [2025-03-03 19:34:38,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 347 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=589, Invalid=1573, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 19:34:38,140 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 334 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:34:38,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 429 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-03-03 19:34:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-03 19:34:38,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 281. [2025-03-03 19:34:38,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 165 states have (on average 1.1333333333333333) internal successors, (187), 166 states have internal predecessors, (187), 99 states have call successors, (99), 16 states have call predecessors, (99), 16 states have return successors, (99), 98 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-03 19:34:38,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 385 transitions. [2025-03-03 19:34:38,185 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 385 transitions. Word has length 181 [2025-03-03 19:34:38,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:38,185 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 385 transitions. [2025-03-03 19:34:38,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 4 states have call successors, (45), 4 states have call predecessors, (45), 10 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2025-03-03 19:34:38,186 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 385 transitions. [2025-03-03 19:34:38,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 19:34:38,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:38,187 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:34:38,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-03-03 19:34:38,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:34:38,388 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:38,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:38,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1028714443, now seen corresponding path program 1 times [2025-03-03 19:34:38,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:34:38,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419928100] [2025-03-03 19:34:38,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:38,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:34:38,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:34:38,391 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:34:38,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-03 19:34:38,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 19:34:38,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 19:34:38,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:38,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:38,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 19:34:38,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:34:42,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 46 proven. 672 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2025-03-03 19:34:42,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:34:42,669 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:34:42,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419928100] [2025-03-03 19:34:42,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419928100] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:34:42,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2042475997] [2025-03-03 19:34:42,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:42,670 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 19:34:42,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 19:34:42,672 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 19:34:42,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-03 19:34:42,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 19:34:43,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 19:34:43,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:43,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:43,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-03 19:34:43,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:35:27,150 WARN L286 SmtUtils]: Spent 7.36s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)