./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-41.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 ef5e205a173479c136fa5de4149ed66a4c00470b1df38c35f7f75fc2309cd4c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:56:59,438 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:56:59,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:56:59,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:56:59,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:56:59,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:56:59,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:56:59,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:56:59,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:56:59,525 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:56:59,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:56:59,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:56:59,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:56:59,526 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:56:59,526 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:56:59,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:56:59,527 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:56:59,527 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:56:59,527 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:56:59,527 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:56:59,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:56:59,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:56:59,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:56:59,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:56:59,527 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:56:59,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:56:59,528 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:56:59,528 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:56:59,528 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:56:59,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:56:59,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:56:59,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:56:59,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:56:59,529 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:56:59,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:56:59,529 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:56:59,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:56:59,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:56:59,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:56:59,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:56:59,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:56:59,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:56:59,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:56:59,529 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 -> ef5e205a173479c136fa5de4149ed66a4c00470b1df38c35f7f75fc2309cd4c7 [2025-03-17 01:56:59,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:56:59,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:56:59,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:56:59,783 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:56:59,783 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:56:59,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-41.i [2025-03-17 01:57:01,032 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f3387d11/dccde12d53f04faaa511f18d4c62bf9b/FLAGcabf9ff1b [2025-03-17 01:57:01,307 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:57:01,307 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-41.i [2025-03-17 01:57:01,318 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f3387d11/dccde12d53f04faaa511f18d4c62bf9b/FLAGcabf9ff1b [2025-03-17 01:57:01,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f3387d11/dccde12d53f04faaa511f18d4c62bf9b [2025-03-17 01:57:01,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:57:01,343 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:57:01,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:57:01,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:57:01,349 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:57:01,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:57:01" (1/1) ... [2025-03-17 01:57:01,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@267b32e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:01, skipping insertion in model container [2025-03-17 01:57:01,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:57:01" (1/1) ... [2025-03-17 01:57:01,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:57:01,487 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-41.i[919,932] [2025-03-17 01:57:01,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:57:01,552 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:57:01,559 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-41.i[919,932] [2025-03-17 01:57:01,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:57:01,607 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:57:01,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:01 WrapperNode [2025-03-17 01:57:01,608 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:57:01,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:57:01,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:57:01,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:57:01,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:01" (1/1) ... [2025-03-17 01:57:01,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:01" (1/1) ... [2025-03-17 01:57:01,669 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2025-03-17 01:57:01,670 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:57:01,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:57:01,671 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:57:01,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:57:01,678 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:01" (1/1) ... [2025-03-17 01:57:01,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:01" (1/1) ... [2025-03-17 01:57:01,685 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:01" (1/1) ... [2025-03-17 01:57:01,707 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-17 01:57:01,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:01" (1/1) ... [2025-03-17 01:57:01,709 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:01" (1/1) ... [2025-03-17 01:57:01,716 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:01" (1/1) ... [2025-03-17 01:57:01,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:01" (1/1) ... [2025-03-17 01:57:01,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:01" (1/1) ... [2025-03-17 01:57:01,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:01" (1/1) ... [2025-03-17 01:57:01,727 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:57:01,728 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:57:01,728 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:57:01,728 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:57:01,729 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:01" (1/1) ... [2025-03-17 01:57:01,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:57:01,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:57:01,756 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-17 01:57:01,758 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-17 01:57:01,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:57:01,779 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:57:01,779 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:57:01,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:57:01,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:57:01,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:57:01,848 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:57:01,850 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:57:02,197 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 01:57:02,198 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:57:02,211 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:57:02,211 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:57:02,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:57:02 BoogieIcfgContainer [2025-03-17 01:57:02,211 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:57:02,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:57:02,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:57:02,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:57:02,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:57:01" (1/3) ... [2025-03-17 01:57:02,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f22601f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:57:02, skipping insertion in model container [2025-03-17 01:57:02,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:01" (2/3) ... [2025-03-17 01:57:02,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f22601f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:57:02, skipping insertion in model container [2025-03-17 01:57:02,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:57:02" (3/3) ... [2025-03-17 01:57:02,222 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-41.i [2025-03-17 01:57:02,232 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:57:02,235 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-41.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:57:02,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:57:02,303 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;@1caea131, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:57:02,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:57:02,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 01:57:02,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 01:57:02,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:57:02,318 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:57:02,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:57:02,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:57:02,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1173615542, now seen corresponding path program 1 times [2025-03-17 01:57:02,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:57:02,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674365636] [2025-03-17 01:57:02,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:57:02,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:57:02,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 01:57:02,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 01:57:02,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:57:02,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:57:02,667 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 01:57:02,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:57:02,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674365636] [2025-03-17 01:57:02,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674365636] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:57:02,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796035483] [2025-03-17 01:57:02,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:57:02,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:57:02,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:57:02,672 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-17 01:57:02,674 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-17 01:57:02,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 01:57:02,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 01:57:02,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:57:02,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:57:02,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:57:02,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:57:02,835 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 01:57:02,835 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:57:02,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796035483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:57:02,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:57:02,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:57:02,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448951942] [2025-03-17 01:57:02,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:57:02,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:57:02,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:57:02,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:57:02,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:57:02,862 INFO L87 Difference]: Start difference. First operand has 73 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 01:57:02,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:57:02,889 INFO L93 Difference]: Finished difference Result 143 states and 247 transitions. [2025-03-17 01:57:02,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:57:02,892 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 131 [2025-03-17 01:57:02,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:57:02,896 INFO L225 Difference]: With dead ends: 143 [2025-03-17 01:57:02,897 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 01:57:02,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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-17 01:57:02,905 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:57:02,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:57:02,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 01:57:02,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-17 01:57:02,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 01:57:02,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 110 transitions. [2025-03-17 01:57:02,940 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 110 transitions. Word has length 131 [2025-03-17 01:57:02,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:57:02,941 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 110 transitions. [2025-03-17 01:57:02,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 01:57:02,941 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 110 transitions. [2025-03-17 01:57:02,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 01:57:02,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:57:02,943 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:57:02,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 01:57:03,144 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-17 01:57:03,144 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:57:03,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:57:03,145 INFO L85 PathProgramCache]: Analyzing trace with hash 871514321, now seen corresponding path program 1 times [2025-03-17 01:57:03,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:57:03,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747622923] [2025-03-17 01:57:03,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:57:03,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:57:03,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 01:57:03,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 01:57:03,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:57:03,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:57:03,360 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 01:57:03,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:57:03,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747622923] [2025-03-17 01:57:03,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747622923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:57:03,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:57:03,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:57:03,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877808605] [2025-03-17 01:57:03,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:57:03,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:57:03,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:57:03,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:57:03,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:57:03,365 INFO L87 Difference]: Start difference. First operand 71 states and 110 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:57:03,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:57:03,425 INFO L93 Difference]: Finished difference Result 170 states and 260 transitions. [2025-03-17 01:57:03,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:57:03,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 131 [2025-03-17 01:57:03,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:57:03,428 INFO L225 Difference]: With dead ends: 170 [2025-03-17 01:57:03,428 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 01:57:03,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:57:03,429 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 37 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:57:03,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 196 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:57:03,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 01:57:03,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2025-03-17 01:57:03,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 74 states have internal predecessors, (105), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 01:57:03,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 147 transitions. [2025-03-17 01:57:03,440 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 147 transitions. Word has length 131 [2025-03-17 01:57:03,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:57:03,440 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 147 transitions. [2025-03-17 01:57:03,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:57:03,441 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 147 transitions. [2025-03-17 01:57:03,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 01:57:03,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:57:03,445 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:57:03,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:57:03,446 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:57:03,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:57:03,446 INFO L85 PathProgramCache]: Analyzing trace with hash -636037488, now seen corresponding path program 1 times [2025-03-17 01:57:03,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:57:03,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162746777] [2025-03-17 01:57:03,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:57:03,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:57:03,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 01:57:03,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 01:57:03,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:57:03,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 01:57:03,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2126683432] [2025-03-17 01:57:03,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:57:03,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:57:03,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:57:03,702 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:57:03,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 01:57:03,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 01:57:03,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 01:57:03,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:57:03,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:57:03,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 01:57:03,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:57:04,436 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 368 proven. 42 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-03-17 01:57:04,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:57:04,942 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 01:57:04,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:57:04,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162746777] [2025-03-17 01:57:04,944 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 01:57:04,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126683432] [2025-03-17 01:57:04,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126683432] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:57:04,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:57:04,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2025-03-17 01:57:04,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754301507] [2025-03-17 01:57:04,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 01:57:04,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 01:57:04,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:57:04,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 01:57:04,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:57:04,946 INFO L87 Difference]: Start difference. First operand 97 states and 147 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 4 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-17 01:57:05,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:57:05,605 INFO L93 Difference]: Finished difference Result 286 states and 422 transitions. [2025-03-17 01:57:05,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 01:57:05,605 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 4 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 131 [2025-03-17 01:57:05,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:57:05,611 INFO L225 Difference]: With dead ends: 286 [2025-03-17 01:57:05,611 INFO L226 Difference]: Without dead ends: 190 [2025-03-17 01:57:05,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2025-03-17 01:57:05,615 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 250 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 01:57:05,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 416 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 01:57:05,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-17 01:57:05,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2025-03-17 01:57:05,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 137 states have (on average 1.416058394160584) internal successors, (194), 140 states have internal predecessors, (194), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 01:57:05,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 258 transitions. [2025-03-17 01:57:05,633 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 258 transitions. Word has length 131 [2025-03-17 01:57:05,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:57:05,633 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 258 transitions. [2025-03-17 01:57:05,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 4 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-17 01:57:05,634 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 258 transitions. [2025-03-17 01:57:05,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 01:57:05,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:57:05,640 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:57:05,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 01:57:05,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-17 01:57:05,841 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:57:05,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:57:05,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1760536244, now seen corresponding path program 1 times [2025-03-17 01:57:05,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:57:05,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013417554] [2025-03-17 01:57:05,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:57:05,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:57:05,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 01:57:05,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 01:57:05,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:57:05,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 01:57:05,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [514152666] [2025-03-17 01:57:05,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:57:05,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:57:05,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:57:05,965 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:57:05,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 01:57:06,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 01:57:06,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 01:57:06,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:57:06,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 01:57:06,281 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 01:57:06,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 01:57:06,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 01:57:06,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:57:06,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 01:57:06,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 01:57:06,398 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 01:57:06,399 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 01:57:06,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 01:57:06,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:57:06,607 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 01:57:06,690 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 01:57:06,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 01:57:06 BoogieIcfgContainer [2025-03-17 01:57:06,693 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 01:57:06,694 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 01:57:06,694 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 01:57:06,694 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 01:57:06,695 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:57:02" (3/4) ... [2025-03-17 01:57:06,697 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 01:57:06,697 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 01:57:06,699 INFO L158 Benchmark]: Toolchain (without parser) took 5355.36ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 113.5MB in the beginning and 154.8MB in the end (delta: -41.3MB). Peak memory consumption was 224.7MB. Max. memory is 16.1GB. [2025-03-17 01:57:06,699 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:57:06,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.56ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 98.1MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 01:57:06,700 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.18ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 94.1MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:57:06,701 INFO L158 Benchmark]: Boogie Preprocessor took 57.05ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 88.3MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 01:57:06,701 INFO L158 Benchmark]: IcfgBuilder took 483.26ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 62.2MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 01:57:06,701 INFO L158 Benchmark]: TraceAbstraction took 4478.03ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 61.3MB in the beginning and 154.8MB in the end (delta: -93.5MB). Peak memory consumption was 174.3MB. Max. memory is 16.1GB. [2025-03-17 01:57:06,701 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 411.0MB. Free memory was 154.8MB in the beginning and 154.8MB in the end (delta: 21.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:57:06,703 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.31ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.56ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 98.1MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.18ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 94.1MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.05ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 88.3MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 483.26ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 62.2MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4478.03ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 61.3MB in the beginning and 154.8MB in the end (delta: -93.5MB). Peak memory consumption was 174.3MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 411.0MB. Free memory was 154.8MB in the beginning and 154.8MB in the end (delta: 21.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 172, overapproximation of someBinaryFLOATComparisonOperation at line 148, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 59, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 158, overapproximation of someBinaryFLOATComparisonOperation at line 160, overapproximation of someBinaryFLOATComparisonOperation at line 166, overapproximation of someBinaryFLOATComparisonOperation at line 164, overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 162, overapproximation of someBinaryFLOATComparisonOperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 172, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryArithmeticFLOAToperation at line 88. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 1; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 0; [L26] signed char var_1_8 = 64; [L27] signed char var_1_11 = -10; [L28] signed char var_1_12 = 64; [L29] float var_1_13 = 1.6; [L30] float var_1_14 = 3.5; [L31] unsigned char var_1_15 = 8; [L32] unsigned char var_1_16 = 4; [L33] unsigned short int var_1_17 = 2; [L34] unsigned short int var_1_18 = 10000; [L35] signed short int var_1_20 = 4; [L36] signed char var_1_22 = -32; [L37] unsigned long int var_1_23 = 0; [L38] signed short int var_1_24 = 25; [L39] unsigned char var_1_27 = 50; [L40] signed short int var_1_29 = 10; [L41] double var_1_33 = 7.125; [L42] float var_1_34 = 0.75; [L43] float var_1_35 = 25.5; [L44] float var_1_36 = 9.038; [L45] float var_1_39 = 128.5; [L46] float var_1_41 = 15.25; [L47] float var_1_42 = 64.5; [L48] float var_1_43 = 256.3; [L49] unsigned long int var_1_44 = 32; [L50] double var_1_45 = 63.25; [L51] unsigned char last_1_var_1_15 = 8; [L176] isInitial = 1 [L177] FCALL initially() [L178] COND TRUE 1 [L179] CALL updateLastVariables() [L169] last_1_var_1_15 = var_1_15 [L179] RET updateLastVariables() [L180] CALL updateVariables() [L135] var_1_4 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L136] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L137] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L137] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L138] var_1_5 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L139] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L140] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L140] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L141] var_1_11 = __VERIFIER_nondet_char() [L142] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L142] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L143] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L143] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L144] var_1_12 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L145] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L146] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L146] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L147] var_1_14 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L148] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L149] var_1_16 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L150] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L151] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L151] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L152] var_1_18 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_18 >= 8192) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L153] RET assume_abort_if_not(var_1_18 >= 8192) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L154] CALL assume_abort_if_not(var_1_18 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L154] RET assume_abort_if_not(var_1_18 <= 16384) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L155] var_1_34 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_34 >= 0.0F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854776000e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L156] RET assume_abort_if_not((var_1_34 >= 0.0F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854776000e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L157] var_1_35 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L158] RET assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L159] var_1_36 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L160] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L161] var_1_41 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 4611686.018427382800e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L162] RET assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 4611686.018427382800e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L163] var_1_42 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_42 >= 0.0F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 4611686.018427382800e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L164] RET assume_abort_if_not((var_1_42 >= 0.0F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 4611686.018427382800e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L165] var_1_43 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L166] RET assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L180] RET updateVariables() [L181] CALL step() [L55] COND TRUE 32.2f > (25.5f - ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) [L56] var_1_24 = ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=16384, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L58] var_1_27 = var_1_16 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=16384, var_1_27=-255, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L59] COND FALSE !(var_1_13 <= ((((var_1_13) < (var_1_13)) ? (var_1_13) : (var_1_13)))) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=16384, var_1_27=-255, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L66] COND FALSE !(var_1_13 > (((((var_1_34) < (var_1_35)) ? (var_1_34) : (var_1_35))) - var_1_36)) [L75] var_1_33 = 10000.5 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=16384, var_1_27=-255, var_1_29=10, var_1_33=20001/2, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L77] COND TRUE \read(var_1_5) [L78] var_1_39 = var_1_14 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=16384, var_1_27=-255, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L84] COND TRUE ((var_1_14 + var_1_13) * ((((var_1_42) < 0 ) ? -(var_1_42) : (var_1_42)))) >= var_1_35 [L85] var_1_44 = ((((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) > (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))))) ? (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) : (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))))) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=16384, var_1_27=-255, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=16384, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L87] COND TRUE \read(var_1_5) [L88] var_1_45 = (((((var_1_43) < 0 ) ? -(var_1_43) : (var_1_43))) + var_1_42) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=16384, var_1_27=-255, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=16384, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L90] unsigned char stepLocal_1 = ! var_1_5; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_1=0, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=16384, var_1_27=-255, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=16384, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L91] COND FALSE !(stepLocal_1 || (var_1_12 < last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=16384, var_1_27=-255, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=16384, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L98] COND FALSE !((127.35 + var_1_13) <= var_1_13) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=16384, var_1_27=-255, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=16384, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L103] COND TRUE (- var_1_13) > 31.9f [L104] var_1_1 = ((var_1_6 || var_1_4) && var_1_5) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=8, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=16384, var_1_27=-255, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=16384, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L108] COND TRUE \read(var_1_1) [L109] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=-255, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=16384, var_1_27=-255, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=16384, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L111] var_1_22 = 1 [L112] var_1_23 = var_1_22 [L113] unsigned long int stepLocal_0 = var_1_23; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_0=1, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=-255, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=16384, var_1_27=-255, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=16384, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L114] COND FALSE !(var_1_15 > stepLocal_0) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=-255, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=16384, var_1_27=-255, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=16384, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L117] unsigned char stepLocal_2 = var_1_23 < var_1_15; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_2=0, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=-255, var_1_16=-255, var_1_17=2, var_1_18=-442368, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=16384, var_1_27=-255, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=16384, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L118] COND TRUE var_1_1 || stepLocal_2 [L119] var_1_17 = (var_1_15 + ((var_1_18 - var_1_16) + var_1_15)) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=-255, var_1_16=-255, var_1_17=16385, var_1_18=-442368, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=16384, var_1_27=-255, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=16384, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L123] signed long int stepLocal_3 = -10; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_3=-10, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=-255, var_1_16=-255, var_1_17=16385, var_1_18=-442368, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=16384, var_1_27=-255, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=16384, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L124] COND FALSE !(((var_1_15 / var_1_18) * var_1_15) < stepLocal_3) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=-255, var_1_16=-255, var_1_17=16385, var_1_18=-442368, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=16384, var_1_27=-255, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=16384, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L127] COND FALSE !(! (var_1_17 <= var_1_17)) [L130] var_1_20 = var_1_12 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=-255, var_1_16=-255, var_1_17=16385, var_1_18=-442368, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=16384, var_1_27=-255, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=16384, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L181] RET step() [L182] CALL, EXPR property() [L172-L173] return ((((((((((- var_1_13) > 31.9f) ? (var_1_1 == ((unsigned char) ((var_1_6 || var_1_4) && var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) && (((127.35 + var_1_13) <= var_1_13) ? ((4.5 <= (var_1_13 * var_1_13)) ? (var_1_6 == ((unsigned char) var_1_5)) : 1) : 1)) && ((var_1_15 > var_1_23) ? (var_1_8 == ((signed char) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : 1)) && (((! var_1_5) || (var_1_12 < last_1_var_1_15)) ? ((! var_1_5) ? (var_1_13 == ((float) var_1_14)) : (var_1_13 == ((float) var_1_14))) : 1)) && (var_1_1 ? (var_1_15 == ((unsigned char) var_1_16)) : 1)) && ((var_1_1 || (var_1_23 < var_1_15)) ? (var_1_17 == ((unsigned short int) (var_1_15 + ((var_1_18 - var_1_16) + var_1_15)))) : (var_1_17 == ((unsigned short int) (var_1_16 + var_1_18))))) && ((((var_1_15 / var_1_18) * var_1_15) < -10) ? (var_1_20 == ((signed short int) ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))))) : ((! (var_1_17 <= var_1_17)) ? (var_1_20 == ((signed short int) var_1_11)) : (var_1_20 == ((signed short int) var_1_12))))) && (var_1_22 == ((signed char) 1))) && (var_1_23 == ((unsigned long int) var_1_22)) ; [L182] RET, EXPR property() [L182] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=-255, var_1_16=-255, var_1_17=16385, var_1_18=-442368, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=16384, var_1_27=-255, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=16384, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=-255, var_1_16=-255, var_1_17=16385, var_1_18=-442368, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=16384, var_1_27=-255, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=16384, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 134 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 4, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 298 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 287 mSDsluCounter, 721 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 413 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 381 IncrementalHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 308 mSDtfsCounter, 381 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 411 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=3, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 17 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 919 NumberOfCodeBlocks, 919 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 650 ConstructedInterpolants, 0 QuantifiedInterpolants, 1817 SizeOfPredicates, 4 NumberOfNonLiveVariables, 659 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 3321/3420 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-17 01:57:06,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-41.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 ef5e205a173479c136fa5de4149ed66a4c00470b1df38c35f7f75fc2309cd4c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:57:08,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:57:08,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 01:57:08,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:57:08,652 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:57:08,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:57:08,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:57:08,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:57:08,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:57:08,668 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:57:08,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:57:08,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:57:08,669 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:57:08,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:57:08,670 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:57:08,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:57:08,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:57:08,670 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:57:08,670 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:57:08,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:57:08,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:57:08,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:57:08,671 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:57:08,671 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 01:57:08,671 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 01:57:08,671 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 01:57:08,671 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:57:08,671 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:57:08,671 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:57:08,672 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:57:08,672 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:57:08,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:57:08,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:57:08,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:57:08,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:57:08,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:57:08,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:57:08,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:57:08,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:57:08,673 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 01:57:08,673 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 01:57:08,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:57:08,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:57:08,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:57:08,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:57:08,674 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 -> ef5e205a173479c136fa5de4149ed66a4c00470b1df38c35f7f75fc2309cd4c7 [2025-03-17 01:57:08,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:57:08,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:57:08,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:57:08,942 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:57:08,942 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:57:08,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-41.i [2025-03-17 01:57:10,060 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f981360a8/6824d4d06e724a72a4db60be64651102/FLAG1bd58dd9c [2025-03-17 01:57:10,264 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:57:10,265 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-41.i [2025-03-17 01:57:10,274 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f981360a8/6824d4d06e724a72a4db60be64651102/FLAG1bd58dd9c [2025-03-17 01:57:10,289 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f981360a8/6824d4d06e724a72a4db60be64651102 [2025-03-17 01:57:10,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:57:10,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:57:10,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:57:10,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:57:10,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:57:10,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:57:10" (1/1) ... [2025-03-17 01:57:10,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@144580fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:10, skipping insertion in model container [2025-03-17 01:57:10,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:57:10" (1/1) ... [2025-03-17 01:57:10,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:57:10,417 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-41.i[919,932] [2025-03-17 01:57:10,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:57:10,473 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:57:10,482 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-41.i[919,932] [2025-03-17 01:57:10,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:57:10,525 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:57:10,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:10 WrapperNode [2025-03-17 01:57:10,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:57:10,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:57:10,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:57:10,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:57:10,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:10" (1/1) ... [2025-03-17 01:57:10,543 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:10" (1/1) ... [2025-03-17 01:57:10,572 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2025-03-17 01:57:10,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:57:10,576 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:57:10,576 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:57:10,576 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:57:10,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:10" (1/1) ... [2025-03-17 01:57:10,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:10" (1/1) ... [2025-03-17 01:57:10,589 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:10" (1/1) ... [2025-03-17 01:57:10,608 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-17 01:57:10,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:10" (1/1) ... [2025-03-17 01:57:10,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:10" (1/1) ... [2025-03-17 01:57:10,625 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:10" (1/1) ... [2025-03-17 01:57:10,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:10" (1/1) ... [2025-03-17 01:57:10,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:10" (1/1) ... [2025-03-17 01:57:10,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:10" (1/1) ... [2025-03-17 01:57:10,635 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:57:10,639 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:57:10,639 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:57:10,639 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:57:10,640 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:10" (1/1) ... [2025-03-17 01:57:10,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:57:10,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:57:10,667 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-17 01:57:10,670 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-17 01:57:10,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:57:10,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 01:57:10,690 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:57:10,691 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:57:10,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:57:10,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:57:10,754 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:57:10,755 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:57:15,677 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 01:57:15,677 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:57:15,688 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:57:15,688 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:57:15,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:57:15 BoogieIcfgContainer [2025-03-17 01:57:15,688 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:57:15,690 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:57:15,690 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:57:15,694 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:57:15,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:57:10" (1/3) ... [2025-03-17 01:57:15,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba8a2b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:57:15, skipping insertion in model container [2025-03-17 01:57:15,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:57:10" (2/3) ... [2025-03-17 01:57:15,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba8a2b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:57:15, skipping insertion in model container [2025-03-17 01:57:15,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:57:15" (3/3) ... [2025-03-17 01:57:15,695 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-41.i [2025-03-17 01:57:15,705 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:57:15,706 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-41.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:57:15,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:57:15,753 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;@4e681a75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:57:15,753 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:57:15,756 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 48 states have (on average 1.5) internal successors, (72), 49 states have internal predecessors, (72), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 01:57:15,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 01:57:15,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:57:15,764 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:57:15,764 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:57:15,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:57:15,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1175068426, now seen corresponding path program 1 times [2025-03-17 01:57:15,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:57:15,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018510344] [2025-03-17 01:57:15,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:57:15,776 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-17 01:57:15,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:57:15,778 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-17 01:57:15,779 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-17 01:57:15,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 01:57:16,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 01:57:16,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:57:16,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:57:16,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:57:16,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:57:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-17 01:57:16,254 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:57:16,254 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:57:16,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018510344] [2025-03-17 01:57:16,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018510344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:57:16,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:57:16,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 01:57:16,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555757623] [2025-03-17 01:57:16,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:57:16,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:57:16,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:57:16,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:57:16,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:57:16,277 INFO L87 Difference]: Start difference. First operand has 70 states, 48 states have (on average 1.5) internal successors, (72), 49 states have internal predecessors, (72), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 01:57:16,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:57:16,297 INFO L93 Difference]: Finished difference Result 137 states and 237 transitions. [2025-03-17 01:57:16,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:57:16,299 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 131 [2025-03-17 01:57:16,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:57:16,303 INFO L225 Difference]: With dead ends: 137 [2025-03-17 01:57:16,303 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 01:57:16,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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-17 01:57:16,307 INFO L435 NwaCegarLoop]: 105 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, 105 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-17 01:57:16,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:57:16,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 01:57:16,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-17 01:57:16,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.425531914893617) internal successors, (67), 47 states have internal predecessors, (67), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 01:57:16,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 105 transitions. [2025-03-17 01:57:16,340 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 105 transitions. Word has length 131 [2025-03-17 01:57:16,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:57:16,341 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 105 transitions. [2025-03-17 01:57:16,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 01:57:16,341 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 105 transitions. [2025-03-17 01:57:16,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 01:57:16,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:57:16,344 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:57:16,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-17 01:57:16,546 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-17 01:57:16,546 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:57:16,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:57:16,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1074769007, now seen corresponding path program 1 times [2025-03-17 01:57:16,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:57:16,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665003184] [2025-03-17 01:57:16,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:57:16,548 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-17 01:57:16,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:57:16,550 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-17 01:57:16,551 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-17 01:57:16,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 01:57:16,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 01:57:16,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:57:16,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:57:16,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 01:57:16,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:57:17,454 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 01:57:17,455 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:57:17,455 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:57:17,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665003184] [2025-03-17 01:57:17,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665003184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:57:17,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:57:17,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 01:57:17,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554872718] [2025-03-17 01:57:17,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:57:17,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:57:17,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:57:17,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:57:17,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:57:17,457 INFO L87 Difference]: Start difference. First operand 68 states and 105 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:57:22,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:57:24,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:57:25,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:57:26,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:57:26,463 INFO L93 Difference]: Finished difference Result 201 states and 311 transitions. [2025-03-17 01:57:26,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:57:26,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 131 [2025-03-17 01:57:26,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:57:26,477 INFO L225 Difference]: With dead ends: 201 [2025-03-17 01:57:26,477 INFO L226 Difference]: Without dead ends: 134 [2025-03-17 01:57:26,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:57:26,478 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 40 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:57:26,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 186 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2025-03-17 01:57:26,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-17 01:57:26,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2025-03-17 01:57:26,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 90 states have internal predecessors, (125), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 01:57:26,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 201 transitions. [2025-03-17 01:57:26,503 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 201 transitions. Word has length 131 [2025-03-17 01:57:26,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:57:26,503 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 201 transitions. [2025-03-17 01:57:26,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:57:26,504 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 201 transitions. [2025-03-17 01:57:26,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 01:57:26,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:57:26,507 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:57:26,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-17 01:57:26,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:57:26,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:57:26,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:57:26,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1844239148, now seen corresponding path program 1 times [2025-03-17 01:57:26,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:57:26,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823265759] [2025-03-17 01:57:26,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:57:26,709 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-17 01:57:26,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:57:26,713 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:57:26,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 01:57:26,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 01:57:27,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 01:57:27,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:57:27,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:57:27,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 01:57:27,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:57:27,653 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 150 proven. 48 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-03-17 01:57:27,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:57:28,198 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 01:57:28,198 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:57:28,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823265759] [2025-03-17 01:57:28,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823265759] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:57:28,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:57:28,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-17 01:57:28,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766374765] [2025-03-17 01:57:28,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 01:57:28,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 01:57:28,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:57:28,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 01:57:28,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:57:28,200 INFO L87 Difference]: Start difference. First operand 131 states and 201 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-17 01:57:30,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:57:31,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:57:31,033 INFO L93 Difference]: Finished difference Result 271 states and 407 transitions. [2025-03-17 01:57:31,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 01:57:31,055 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 132 [2025-03-17 01:57:31,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:57:31,057 INFO L225 Difference]: With dead ends: 271 [2025-03-17 01:57:31,057 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 01:57:31,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-17 01:57:31,058 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 41 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-17 01:57:31,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 176 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-17 01:57:31,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 01:57:31,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2025-03-17 01:57:31,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 94 states have (on average 1.297872340425532) internal successors, (122), 94 states have internal predecessors, (122), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 01:57:31,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 198 transitions. [2025-03-17 01:57:31,075 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 198 transitions. Word has length 132 [2025-03-17 01:57:31,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:57:31,075 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 198 transitions. [2025-03-17 01:57:31,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-17 01:57:31,076 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 198 transitions. [2025-03-17 01:57:31,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 01:57:31,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:57:31,077 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:57:31,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 01:57:31,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:57:31,278 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:57:31,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:57:31,279 INFO L85 PathProgramCache]: Analyzing trace with hash 943176339, now seen corresponding path program 1 times [2025-03-17 01:57:31,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:57:31,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234654757] [2025-03-17 01:57:31,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:57:31,279 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-17 01:57:31,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:57:31,282 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:57:31,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 01:57:31,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 01:57:31,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 01:57:31,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:57:31,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:57:31,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 01:57:31,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:57:32,076 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 01:57:32,076 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:57:32,076 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:57:32,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234654757] [2025-03-17 01:57:32,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234654757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:57:32,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:57:32,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:57:32,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388340337] [2025-03-17 01:57:32,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:57:32,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:57:32,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:57:32,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:57:32,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:57:32,077 INFO L87 Difference]: Start difference. First operand 137 states and 198 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:57:35,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:57:35,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:57:35,672 INFO L93 Difference]: Finished difference Result 501 states and 720 transitions. [2025-03-17 01:57:35,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 01:57:35,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 132 [2025-03-17 01:57:35,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:57:35,678 INFO L225 Difference]: With dead ends: 501 [2025-03-17 01:57:35,678 INFO L226 Difference]: Without dead ends: 365 [2025-03-17 01:57:35,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:57:35,679 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 106 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-17 01:57:35,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 335 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-17 01:57:35,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-17 01:57:35,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 359. [2025-03-17 01:57:35,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 252 states have (on average 1.2896825396825398) internal successors, (325), 254 states have internal predecessors, (325), 94 states have call successors, (94), 12 states have call predecessors, (94), 12 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-17 01:57:35,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 513 transitions. [2025-03-17 01:57:35,717 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 513 transitions. Word has length 132 [2025-03-17 01:57:35,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:57:35,717 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 513 transitions. [2025-03-17 01:57:35,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:57:35,718 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 513 transitions. [2025-03-17 01:57:35,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 01:57:35,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:57:35,719 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:57:35,736 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 (5)] Ended with exit code 0 [2025-03-17 01:57:35,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:57:35,920 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:57:35,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:57:35,920 INFO L85 PathProgramCache]: Analyzing trace with hash -799633996, now seen corresponding path program 1 times [2025-03-17 01:57:35,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:57:35,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144171819] [2025-03-17 01:57:35,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:57:35,921 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-17 01:57:35,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:57:35,923 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:57:35,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 01:57:35,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 01:57:36,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 01:57:36,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:57:36,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:57:36,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 01:57:36,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:57:40,136 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 168 proven. 90 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-03-17 01:57:40,136 INFO L312 TraceCheckSpWp]: Computing backward predicates...