./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_operatoramount_amount25_file-78.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 776cbeba8a72a8c366fa86377847687b216913b78347eee8ff5c4d62d35f12be --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:37:49,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:37:49,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:37:49,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:37:49,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:37:49,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:37:49,316 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:37:49,316 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:37:49,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:37:49,316 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:37:49,317 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:37:49,317 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:37:49,317 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:37:49,317 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:37:49,317 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:37:49,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:37:49,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:37:49,317 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:37:49,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:37:49,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:37:49,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:37:49,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:37:49,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:37:49,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:37:49,318 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:37:49,318 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:37:49,318 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:37:49,318 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:37:49,318 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:37:49,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:37:49,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:37:49,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:37:49,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:37:49,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:37:49,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:37:49,318 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:37:49,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:37:49,318 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:37:49,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:37:49,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:37:49,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:37:49,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:37:49,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:37:49,318 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 -> 776cbeba8a72a8c366fa86377847687b216913b78347eee8ff5c4d62d35f12be [2025-03-08 15:37:49,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:37:49,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:37:49,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:37:49,549 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:37:49,549 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:37:49,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-78.i [2025-03-08 15:37:50,702 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05fac08ba/6d60a7a9ec5f46408a798a454e227383/FLAGc778af239 [2025-03-08 15:37:50,937 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:37:50,938 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-78.i [2025-03-08 15:37:50,949 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05fac08ba/6d60a7a9ec5f46408a798a454e227383/FLAGc778af239 [2025-03-08 15:37:50,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05fac08ba/6d60a7a9ec5f46408a798a454e227383 [2025-03-08 15:37:50,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:37:50,998 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:37:50,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:37:50,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:37:51,002 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:37:51,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:37:50" (1/1) ... [2025-03-08 15:37:51,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d20245c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:51, skipping insertion in model container [2025-03-08 15:37:51,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:37:50" (1/1) ... [2025-03-08 15:37:51,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:37:51,125 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_operatoramount_amount25_file-78.i[915,928] [2025-03-08 15:37:51,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:37:51,175 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:37:51,184 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_operatoramount_amount25_file-78.i[915,928] [2025-03-08 15:37:51,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:37:51,214 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:37:51,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:51 WrapperNode [2025-03-08 15:37:51,215 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:37:51,216 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:37:51,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:37:51,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:37:51,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:51" (1/1) ... [2025-03-08 15:37:51,231 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:51" (1/1) ... [2025-03-08 15:37:51,250 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2025-03-08 15:37:51,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:37:51,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:37:51,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:37:51,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:37:51,258 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:51" (1/1) ... [2025-03-08 15:37:51,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:51" (1/1) ... [2025-03-08 15:37:51,260 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:51" (1/1) ... [2025-03-08 15:37:51,274 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-08 15:37:51,277 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:51" (1/1) ... [2025-03-08 15:37:51,277 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:51" (1/1) ... [2025-03-08 15:37:51,281 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:51" (1/1) ... [2025-03-08 15:37:51,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:51" (1/1) ... [2025-03-08 15:37:51,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:51" (1/1) ... [2025-03-08 15:37:51,286 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:51" (1/1) ... [2025-03-08 15:37:51,288 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:37:51,292 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:37:51,292 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:37:51,292 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:37:51,293 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:51" (1/1) ... [2025-03-08 15:37:51,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:37:51,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:37:51,323 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-08 15:37:51,327 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-08 15:37:51,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:37:51,343 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:37:51,343 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:37:51,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:37:51,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:37:51,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:37:51,394 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:37:51,396 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:37:51,559 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 15:37:51,560 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:37:51,570 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:37:51,570 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:37:51,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:37:51 BoogieIcfgContainer [2025-03-08 15:37:51,571 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:37:51,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:37:51,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:37:51,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:37:51,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:37:50" (1/3) ... [2025-03-08 15:37:51,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10986794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:37:51, skipping insertion in model container [2025-03-08 15:37:51,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:51" (2/3) ... [2025-03-08 15:37:51,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10986794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:37:51, skipping insertion in model container [2025-03-08 15:37:51,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:37:51" (3/3) ... [2025-03-08 15:37:51,577 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-78.i [2025-03-08 15:37:51,587 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:37:51,588 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-78.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:37:51,635 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:37:51,642 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;@2d06e849, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:37:51,644 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:37:51,647 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 15:37:51,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 15:37:51,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:37:51,654 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:37:51,654 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:37:51,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:37:51,658 INFO L85 PathProgramCache]: Analyzing trace with hash 988486127, now seen corresponding path program 1 times [2025-03-08 15:37:51,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:37:51,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231240645] [2025-03-08 15:37:51,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:37:51,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:37:51,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 15:37:51,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 15:37:51,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:37:51,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:37:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 15:37:51,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:37:51,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231240645] [2025-03-08 15:37:51,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231240645] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:37:51,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379017209] [2025-03-08 15:37:51,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:37:51,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:37:51,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:37:51,872 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-08 15:37:51,874 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-08 15:37:51,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 15:37:52,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 15:37:52,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:37:52,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:37:52,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:37:52,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:37:52,029 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 15:37:52,030 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:37:52,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379017209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:37:52,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:37:52,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:37:52,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144192799] [2025-03-08 15:37:52,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:37:52,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:37:52,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:37:52,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:37:52,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:37:52,055 INFO L87 Difference]: Start difference. First operand has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 15:37:52,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:37:52,074 INFO L93 Difference]: Finished difference Result 104 states and 177 transitions. [2025-03-08 15:37:52,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:37:52,076 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2025-03-08 15:37:52,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:37:52,081 INFO L225 Difference]: With dead ends: 104 [2025-03-08 15:37:52,081 INFO L226 Difference]: Without dead ends: 52 [2025-03-08 15:37:52,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 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-08 15:37:52,086 INFO L435 NwaCegarLoop]: 75 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, 75 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-08 15:37:52,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:37:52,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-08 15:37:52,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-08 15:37:52,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 15:37:52,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2025-03-08 15:37:52,116 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 125 [2025-03-08 15:37:52,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:37:52,116 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2025-03-08 15:37:52,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 15:37:52,116 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2025-03-08 15:37:52,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 15:37:52,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:37:52,118 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:37:52,124 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-08 15:37:52,318 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-08 15:37:52,319 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:37:52,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:37:52,320 INFO L85 PathProgramCache]: Analyzing trace with hash -272571536, now seen corresponding path program 1 times [2025-03-08 15:37:52,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:37:52,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81722423] [2025-03-08 15:37:52,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:37:52,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:37:52,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 15:37:52,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 15:37:52,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:37:52,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:37:52,469 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 15:37:52,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 15:37:52,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 15:37:52,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:37:52,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:37:52,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 15:37:52,579 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 15:37:52,580 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 15:37:52,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:37:52,584 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 15:37:52,639 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 15:37:52,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:37:52 BoogieIcfgContainer [2025-03-08 15:37:52,642 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 15:37:52,642 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 15:37:52,642 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 15:37:52,643 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 15:37:52,643 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:37:51" (3/4) ... [2025-03-08 15:37:52,644 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 15:37:52,645 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 15:37:52,646 INFO L158 Benchmark]: Toolchain (without parser) took 1648.16ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 72.3MB in the end (delta: 34.4MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2025-03-08 15:37:52,646 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:37:52,646 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.26ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 94.1MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:37:52,646 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.43ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:37:52,646 INFO L158 Benchmark]: Boogie Preprocessor took 39.60ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 90.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:37:52,646 INFO L158 Benchmark]: IcfgBuilder took 278.72ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 74.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 15:37:52,647 INFO L158 Benchmark]: TraceAbstraction took 1069.35ms. Allocated memory is still 142.6MB. Free memory was 74.5MB in the beginning and 72.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:37:52,647 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 142.6MB. Free memory was 72.3MB in the beginning and 72.3MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:37:52,648 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.16ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.26ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 94.1MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.43ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.60ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 90.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 278.72ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 74.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1069.35ms. Allocated memory is still 142.6MB. Free memory was 74.5MB in the beginning and 72.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 142.6MB. Free memory was 72.3MB in the beginning and 72.3MB in the end (delta: 27.1kB). 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 93, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryFLOATComparisonOperation at line 59, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someUnaryDOUBLEoperation at line 36. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -200; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 1; [L25] signed long int var_1_6 = 128; [L26] signed long int var_1_7 = 10; [L27] signed short int var_1_8 = 0; [L28] signed short int var_1_9 = 25; [L29] signed short int var_1_10 = 32; [L30] signed short int var_1_11 = 1000; [L31] signed short int var_1_12 = 25; [L32] signed short int var_1_13 = 128; [L33] unsigned long int var_1_14 = 5; [L34] float var_1_15 = 8.25; [L35] float var_1_16 = 63.5; [L36] float var_1_17 = -0.6; [L37] signed long int last_1_var_1_1 = -200; VAL [isInitial=0, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] CALL updateLastVariables() [L96] last_1_var_1_1 = var_1_1 VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L106] RET updateLastVariables() [L107] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L64] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L65] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L65] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L66] var_1_3 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L67] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L68] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L68] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L69] var_1_6 = __VERIFIER_nondet_long() [L70] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=10, var_1_8=0, var_1_9=25] [L70] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=10, var_1_8=0, var_1_9=25] [L71] CALL assume_abort_if_not(var_1_6 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=10, var_1_8=0, var_1_9=25] [L71] RET assume_abort_if_not(var_1_6 <= 2147483646) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=10, var_1_8=0, var_1_9=25] [L72] var_1_7 = __VERIFIER_nondet_long() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=25] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=25] [L74] CALL assume_abort_if_not(var_1_7 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=25] [L74] RET assume_abort_if_not(var_1_7 <= 2147483646) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=25] [L75] var_1_9 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L77] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L78] var_1_10 = __VERIFIER_nondet_short() [L79] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L79] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L80] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L81] var_1_11 = __VERIFIER_nondet_short() [L82] CALL assume_abort_if_not(var_1_11 >= -8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not(var_1_11 >= -8191) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_11 <= 8192) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L83] RET assume_abort_if_not(var_1_11 <= 8192) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L84] var_1_12 = __VERIFIER_nondet_short() [L85] CALL assume_abort_if_not(var_1_12 >= -8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L85] RET assume_abort_if_not(var_1_12 >= -8191) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L86] CALL assume_abort_if_not(var_1_12 <= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L86] RET assume_abort_if_not(var_1_12 <= 8191) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L87] var_1_13 = __VERIFIER_nondet_short() [L88] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L88] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L89] CALL assume_abort_if_not(var_1_13 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L89] RET assume_abort_if_not(var_1_13 <= 32766) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L90] var_1_16 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L91] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L92] var_1_17 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L107] RET updateVariables() [L108] CALL step() [L41] COND TRUE \read(var_1_3) [L42] var_1_14 = (2931747731u - var_1_10) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=2931731348, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L44] unsigned char stepLocal_1 = var_1_3; [L45] unsigned char stepLocal_0 = var_1_2; VAL [isInitial=1, last_1_var_1_1=-200, stepLocal_0=0, stepLocal_1=-255, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=2931731348, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L46] COND FALSE !(var_1_2 && stepLocal_1) VAL [isInitial=1, last_1_var_1_1=-200, stepLocal_0=0, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=2931731348, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L53] COND FALSE !(var_1_14 > var_1_14) [L56] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_13) VAL [isInitial=1, last_1_var_1_1=-200, stepLocal_0=0, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=2931731348, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=-32766, var_1_9=0] [L58] COND TRUE var_1_11 >= var_1_1 [L59] var_1_15 = ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))) VAL [isInitial=1, last_1_var_1_1=-200, stepLocal_0=0, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=2931731348, var_1_15=2931731353, var_1_16=2931731353, var_1_17=2931731353, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=-32766, var_1_9=0] [L108] RET step() [L109] CALL, EXPR property() [L99-L100] return ((((var_1_2 && var_1_3) ? ((var_1_2 && (var_1_14 > last_1_var_1_1)) ? (var_1_1 == ((signed long int) (var_1_6 - var_1_7))) : (var_1_1 == ((signed long int) var_1_6))) : 1) && ((var_1_14 > var_1_14) ? (var_1_8 == ((signed short int) ((var_1_9 - var_1_10) + ((((-4) < ((var_1_11 + var_1_12))) ? (-4) : ((var_1_11 + var_1_12))))))) : (var_1_8 == ((signed short int) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_13))))) && (var_1_3 ? (var_1_14 == ((unsigned long int) (2931747731u - var_1_10))) : 1)) && ((var_1_11 >= var_1_1) ? (var_1_15 == ((float) ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=2931731348, var_1_15=2931731353, var_1_16=2931731353, var_1_17=2931731353, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=-32766, var_1_9=0] [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=2931731348, var_1_15=2931731353, var_1_16=2931731353, var_1_17=2931731353, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=-32766, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=2931731348, var_1_15=2931731353, var_1_16=2931731353, var_1_17=2931731353, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=-32766, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 101 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 75 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 282 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1482/1520 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-08 15:37:52,666 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_operatoramount_amount25_file-78.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 776cbeba8a72a8c366fa86377847687b216913b78347eee8ff5c4d62d35f12be --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:37:54,490 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:37:54,570 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 15:37:54,575 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:37:54,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:37:54,603 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:37:54,604 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:37:54,604 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:37:54,605 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:37:54,605 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:37:54,605 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:37:54,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:37:54,606 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:37:54,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:37:54,606 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:37:54,606 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:37:54,606 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:37:54,606 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:37:54,606 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:37:54,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:37:54,606 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:37:54,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:37:54,606 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:37:54,606 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 15:37:54,606 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 15:37:54,606 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 15:37:54,606 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:37:54,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:37:54,607 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:37:54,607 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:37:54,607 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:37:54,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:37:54,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:37:54,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:37:54,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:37:54,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:37:54,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:37:54,607 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:37:54,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:37:54,607 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 15:37:54,607 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 15:37:54,607 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:37:54,607 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:37:54,607 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:37:54,607 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:37:54,607 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 -> 776cbeba8a72a8c366fa86377847687b216913b78347eee8ff5c4d62d35f12be [2025-03-08 15:37:54,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:37:54,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:37:54,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:37:54,873 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:37:54,874 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:37:54,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-78.i [2025-03-08 15:37:56,067 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e1dd5ef7/a57643beb8a449da93ad8989c6349262/FLAGd201b206f [2025-03-08 15:37:56,292 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:37:56,293 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-78.i [2025-03-08 15:37:56,299 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e1dd5ef7/a57643beb8a449da93ad8989c6349262/FLAGd201b206f [2025-03-08 15:37:56,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e1dd5ef7/a57643beb8a449da93ad8989c6349262 [2025-03-08 15:37:56,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:37:56,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:37:56,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:37:56,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:37:56,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:37:56,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:37:56" (1/1) ... [2025-03-08 15:37:56,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e03d0e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:56, skipping insertion in model container [2025-03-08 15:37:56,326 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:37:56" (1/1) ... [2025-03-08 15:37:56,340 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:37:56,451 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_operatoramount_amount25_file-78.i[915,928] [2025-03-08 15:37:56,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:37:56,516 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:37:56,525 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_operatoramount_amount25_file-78.i[915,928] [2025-03-08 15:37:56,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:37:56,565 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:37:56,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:56 WrapperNode [2025-03-08 15:37:56,567 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:37:56,568 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:37:56,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:37:56,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:37:56,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:56" (1/1) ... [2025-03-08 15:37:56,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:56" (1/1) ... [2025-03-08 15:37:56,602 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2025-03-08 15:37:56,603 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:37:56,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:37:56,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:37:56,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:37:56,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:56" (1/1) ... [2025-03-08 15:37:56,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:56" (1/1) ... [2025-03-08 15:37:56,612 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:56" (1/1) ... [2025-03-08 15:37:56,627 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-08 15:37:56,632 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:56" (1/1) ... [2025-03-08 15:37:56,632 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:56" (1/1) ... [2025-03-08 15:37:56,638 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:56" (1/1) ... [2025-03-08 15:37:56,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:56" (1/1) ... [2025-03-08 15:37:56,640 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:56" (1/1) ... [2025-03-08 15:37:56,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:56" (1/1) ... [2025-03-08 15:37:56,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:37:56,644 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:37:56,644 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:37:56,644 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:37:56,645 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:56" (1/1) ... [2025-03-08 15:37:56,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:37:56,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:37:56,673 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-08 15:37:56,676 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-08 15:37:56,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:37:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 15:37:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:37:56,698 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:37:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:37:56,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:37:56,767 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:37:56,768 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:37:57,017 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 15:37:57,017 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:37:57,027 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:37:57,028 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:37:57,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:37:57 BoogieIcfgContainer [2025-03-08 15:37:57,029 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:37:57,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:37:57,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:37:57,035 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:37:57,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:37:56" (1/3) ... [2025-03-08 15:37:57,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@757b56a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:37:57, skipping insertion in model container [2025-03-08 15:37:57,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:56" (2/3) ... [2025-03-08 15:37:57,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@757b56a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:37:57, skipping insertion in model container [2025-03-08 15:37:57,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:37:57" (3/3) ... [2025-03-08 15:37:57,039 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-78.i [2025-03-08 15:37:57,050 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:37:57,051 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-78.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:37:57,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:37:57,107 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;@1fe487b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:37:57,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:37:57,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 15:37:57,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 15:37:57,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:37:57,122 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:37:57,122 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:37:57,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:37:57,126 INFO L85 PathProgramCache]: Analyzing trace with hash 988486127, now seen corresponding path program 1 times [2025-03-08 15:37:57,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:37:57,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585307887] [2025-03-08 15:37:57,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:37:57,134 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-08 15:37:57,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:37:57,136 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-08 15:37:57,137 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-08 15:37:57,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 15:37:57,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 15:37:57,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:37:57,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:37:57,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:37:57,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:37:57,336 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-03-08 15:37:57,337 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:37:57,337 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:37:57,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585307887] [2025-03-08 15:37:57,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585307887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:37:57,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:37:57,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 15:37:57,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430998528] [2025-03-08 15:37:57,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:37:57,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:37:57,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:37:57,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:37:57,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:37:57,359 INFO L87 Difference]: Start difference. First operand has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 15:37:57,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:37:57,383 INFO L93 Difference]: Finished difference Result 104 states and 177 transitions. [2025-03-08 15:37:57,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:37:57,385 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2025-03-08 15:37:57,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:37:57,391 INFO L225 Difference]: With dead ends: 104 [2025-03-08 15:37:57,391 INFO L226 Difference]: Without dead ends: 52 [2025-03-08 15:37:57,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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-08 15:37:57,398 INFO L435 NwaCegarLoop]: 75 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, 75 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-08 15:37:57,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:37:57,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-08 15:37:57,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-08 15:37:57,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 15:37:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2025-03-08 15:37:57,435 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 125 [2025-03-08 15:37:57,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:37:57,435 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2025-03-08 15:37:57,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 15:37:57,435 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2025-03-08 15:37:57,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 15:37:57,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:37:57,440 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:37:57,450 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 (2)] Ended with exit code 0 [2025-03-08 15:37:57,641 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-08 15:37:57,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:37:57,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:37:57,642 INFO L85 PathProgramCache]: Analyzing trace with hash -272571536, now seen corresponding path program 1 times [2025-03-08 15:37:57,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:37:57,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445234426] [2025-03-08 15:37:57,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:37:57,643 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-08 15:37:57,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:37:57,645 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-08 15:37:57,646 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-08 15:37:57,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 15:37:57,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 15:37:57,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:37:57,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:37:57,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 15:37:57,794 INFO L279 TraceCheckSpWp]: Computing forward predicates...