./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-84.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 73fe678a1510361e3887d1b58245b9dd4e788878d5dd5b7b4f35abb16874b2b7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:00:38,919 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:00:38,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:00:38,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:00:38,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:00:39,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:00:39,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:00:39,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:00:39,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:00:39,026 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:00:39,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:00:39,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:00:39,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:00:39,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:00:39,027 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:00:39,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:00:39,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:00:39,027 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:00:39,027 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:00:39,027 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:00:39,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:00:39,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:00:39,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:00:39,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:00:39,027 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:00:39,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:00:39,027 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:00:39,027 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:00:39,027 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:00:39,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:00:39,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:00:39,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:00:39,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:00:39,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:00:39,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:00:39,028 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:00:39,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:00:39,028 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:00:39,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:00:39,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:00:39,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:00:39,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:00:39,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:00:39,028 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 -> 73fe678a1510361e3887d1b58245b9dd4e788878d5dd5b7b4f35abb16874b2b7 [2025-03-04 00:00:39,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:00:39,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:00:39,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:00:39,671 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:00:39,674 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:00:39,675 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-84.i [2025-03-04 00:00:41,550 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6594e584d/d1a83d8a895b4711a2e7879a8e3a429f/FLAG83a186d4c [2025-03-04 00:00:42,078 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:00:42,084 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-84.i [2025-03-04 00:00:42,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6594e584d/d1a83d8a895b4711a2e7879a8e3a429f/FLAG83a186d4c [2025-03-04 00:00:42,127 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6594e584d/d1a83d8a895b4711a2e7879a8e3a429f [2025-03-04 00:00:42,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:00:42,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:00:42,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:00:42,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:00:42,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:00:42,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:00:42" (1/1) ... [2025-03-04 00:00:42,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34511160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:42, skipping insertion in model container [2025-03-04 00:00:42,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:00:42" (1/1) ... [2025-03-04 00:00:42,193 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:00:42,430 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-84.i[916,929] [2025-03-04 00:00:42,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:00:42,605 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:00:42,620 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-84.i[916,929] [2025-03-04 00:00:42,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:00:42,706 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:00:42,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:42 WrapperNode [2025-03-04 00:00:42,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:00:42,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:00:42,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:00:42,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:00:42,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:42" (1/1) ... [2025-03-04 00:00:42,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:42" (1/1) ... [2025-03-04 00:00:42,806 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2025-03-04 00:00:42,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:00:42,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:00:42,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:00:42,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:00:42,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:42" (1/1) ... [2025-03-04 00:00:42,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:42" (1/1) ... [2025-03-04 00:00:42,825 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:42" (1/1) ... [2025-03-04 00:00:42,867 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-04 00:00:42,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:42" (1/1) ... [2025-03-04 00:00:42,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:42" (1/1) ... [2025-03-04 00:00:42,880 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:42" (1/1) ... [2025-03-04 00:00:42,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:42" (1/1) ... [2025-03-04 00:00:42,893 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:42" (1/1) ... [2025-03-04 00:00:42,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:42" (1/1) ... [2025-03-04 00:00:42,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:00:42,908 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:00:42,908 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:00:42,908 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:00:42,909 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:42" (1/1) ... [2025-03-04 00:00:42,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:00:42,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:00:42,940 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-04 00:00:42,945 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-04 00:00:42,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:00:42,964 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:00:42,965 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:00:42,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:00:42,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:00:42,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:00:43,050 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:00:43,057 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:00:43,561 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-04 00:00:43,565 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:00:43,593 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:00:43,597 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:00:43,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:00:43 BoogieIcfgContainer [2025-03-04 00:00:43,598 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:00:43,605 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:00:43,606 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:00:43,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:00:43,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:00:42" (1/3) ... [2025-03-04 00:00:43,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693c8dd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:00:43, skipping insertion in model container [2025-03-04 00:00:43,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:42" (2/3) ... [2025-03-04 00:00:43,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693c8dd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:00:43, skipping insertion in model container [2025-03-04 00:00:43,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:00:43" (3/3) ... [2025-03-04 00:00:43,621 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-84.i [2025-03-04 00:00:43,647 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:00:43,652 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-84.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:00:43,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:00:43,801 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;@4f8afdd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:00:43,804 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:00:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 54 states have internal predecessors, (75), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:00:43,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 00:00:43,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:00:43,837 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:00:43,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:00:43,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:00:43,851 INFO L85 PathProgramCache]: Analyzing trace with hash 2090448989, now seen corresponding path program 1 times [2025-03-04 00:00:43,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:00:43,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604538779] [2025-03-04 00:00:43,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:00:43,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:00:44,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 00:00:44,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 00:00:44,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:00:44,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:00:44,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-04 00:00:44,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:00:44,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604538779] [2025-03-04 00:00:44,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604538779] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:00:44,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539323283] [2025-03-04 00:00:44,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:00:44,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:00:44,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:00:44,485 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-04 00:00:44,500 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-04 00:00:44,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 00:00:44,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 00:00:44,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:00:44,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:00:44,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:00:44,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:00:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-04 00:00:44,814 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:00:44,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539323283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:00:44,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:00:44,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:00:44,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438381933] [2025-03-04 00:00:44,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:00:44,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:00:44,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:00:44,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:00:44,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:00:44,868 INFO L87 Difference]: Start difference. First operand has 79 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 54 states have internal predecessors, (75), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:00:44,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:00:44,910 INFO L93 Difference]: Finished difference Result 152 states and 260 transitions. [2025-03-04 00:00:44,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:00:44,913 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 154 [2025-03-04 00:00:44,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:00:44,920 INFO L225 Difference]: With dead ends: 152 [2025-03-04 00:00:44,921 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 00:00:44,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 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-04 00:00:44,927 INFO L435 NwaCegarLoop]: 115 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, 115 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-04 00:00:44,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:00:44,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 00:00:44,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-04 00:00:44,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:00:44,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 115 transitions. [2025-03-04 00:00:44,977 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 115 transitions. Word has length 154 [2025-03-04 00:00:44,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:00:44,977 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 115 transitions. [2025-03-04 00:00:44,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:00:44,978 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 115 transitions. [2025-03-04 00:00:44,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 00:00:44,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:00:44,989 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:00:45,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:00:45,189 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-04 00:00:45,190 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:00:45,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:00:45,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1617091232, now seen corresponding path program 1 times [2025-03-04 00:00:45,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:00:45,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369929312] [2025-03-04 00:00:45,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:00:45,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:00:45,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 00:00:45,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 00:00:45,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:00:45,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:00:45,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 00:00:45,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:00:45,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369929312] [2025-03-04 00:00:45,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369929312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:00:45,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:00:45,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:00:45,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389495044] [2025-03-04 00:00:45,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:00:45,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:00:45,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:00:45,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:00:45,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:00:45,547 INFO L87 Difference]: Start difference. First operand 76 states and 115 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:00:45,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:00:45,633 INFO L93 Difference]: Finished difference Result 186 states and 279 transitions. [2025-03-04 00:00:45,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:00:45,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 154 [2025-03-04 00:00:45,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:00:45,639 INFO L225 Difference]: With dead ends: 186 [2025-03-04 00:00:45,639 INFO L226 Difference]: Without dead ends: 113 [2025-03-04 00:00:45,640 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-04 00:00:45,640 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 46 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:00:45,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 244 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:00:45,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-04 00:00:45,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2025-03-04 00:00:45,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 77 states have internal predecessors, (102), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 00:00:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 164 transitions. [2025-03-04 00:00:45,679 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 164 transitions. Word has length 154 [2025-03-04 00:00:45,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:00:45,684 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 164 transitions. [2025-03-04 00:00:45,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:00:45,686 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 164 transitions. [2025-03-04 00:00:45,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 00:00:45,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:00:45,688 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:00:45,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:00:45,688 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:00:45,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:00:45,689 INFO L85 PathProgramCache]: Analyzing trace with hash -729587551, now seen corresponding path program 1 times [2025-03-04 00:00:45,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:00:45,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603026121] [2025-03-04 00:00:45,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:00:45,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:00:45,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 00:00:45,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 00:00:45,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:00:45,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:00:46,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 00:00:46,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:00:46,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603026121] [2025-03-04 00:00:46,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603026121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:00:46,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:00:46,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:00:46,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750654576] [2025-03-04 00:00:46,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:00:46,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:00:46,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:00:46,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:00:46,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:00:46,508 INFO L87 Difference]: Start difference. First operand 110 states and 164 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:00:46,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:00:46,605 INFO L93 Difference]: Finished difference Result 219 states and 326 transitions. [2025-03-04 00:00:46,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:00:46,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 154 [2025-03-04 00:00:46,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:00:46,607 INFO L225 Difference]: With dead ends: 219 [2025-03-04 00:00:46,607 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 00:00:46,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:00:46,608 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 46 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:00:46,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 382 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:00:46,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 00:00:46,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2025-03-04 00:00:46,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 76 states have internal predecessors, (100), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 00:00:46,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 162 transitions. [2025-03-04 00:00:46,656 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 162 transitions. Word has length 154 [2025-03-04 00:00:46,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:00:46,660 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 162 transitions. [2025-03-04 00:00:46,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:00:46,661 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 162 transitions. [2025-03-04 00:00:46,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 00:00:46,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:00:46,662 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:00:46,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:00:46,663 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:00:46,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:00:46,663 INFO L85 PathProgramCache]: Analyzing trace with hash -619233469, now seen corresponding path program 1 times [2025-03-04 00:00:46,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:00:46,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106579684] [2025-03-04 00:00:46,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:00:46,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:00:46,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 00:00:46,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 00:00:46,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:00:46,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:00:47,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 00:00:47,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:00:47,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106579684] [2025-03-04 00:00:47,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106579684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:00:47,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:00:47,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:00:47,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525610692] [2025-03-04 00:00:47,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:00:47,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:00:47,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:00:47,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:00:47,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:00:47,805 INFO L87 Difference]: Start difference. First operand 109 states and 162 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:00:48,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:00:48,666 INFO L93 Difference]: Finished difference Result 493 states and 732 transitions. [2025-03-04 00:00:48,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:00:48,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 154 [2025-03-04 00:00:48,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:00:48,673 INFO L225 Difference]: With dead ends: 493 [2025-03-04 00:00:48,673 INFO L226 Difference]: Without dead ends: 387 [2025-03-04 00:00:48,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:00:48,677 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 196 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:00:48,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 598 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 00:00:48,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-04 00:00:48,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 223. [2025-03-04 00:00:48,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 156 states have (on average 1.358974358974359) internal successors, (212), 158 states have internal predecessors, (212), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 00:00:48,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 336 transitions. [2025-03-04 00:00:48,782 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 336 transitions. Word has length 154 [2025-03-04 00:00:48,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:00:48,782 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 336 transitions. [2025-03-04 00:00:48,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:00:48,783 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 336 transitions. [2025-03-04 00:00:48,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 00:00:48,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:00:48,786 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:00:48,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:00:48,786 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:00:48,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:00:48,786 INFO L85 PathProgramCache]: Analyzing trace with hash -618309948, now seen corresponding path program 1 times [2025-03-04 00:00:48,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:00:48,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951900140] [2025-03-04 00:00:48,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:00:48,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:00:48,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 00:00:49,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 00:00:49,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:00:49,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:00:49,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [313128752] [2025-03-04 00:00:49,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:00:49,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:00:49,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:00:49,019 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-04 00:00:49,021 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-04 00:00:49,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 00:00:49,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 00:00:49,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:00:49,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:00:49,281 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:00:49,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 00:00:49,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 00:00:49,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:00:49,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:00:49,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:00:49,509 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:00:49,510 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:00:49,532 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-04 00:00:49,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:00:49,725 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 00:00:49,883 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:00:49,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:00:49 BoogieIcfgContainer [2025-03-04 00:00:49,886 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:00:49,892 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:00:49,892 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:00:49,892 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:00:49,892 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:00:43" (3/4) ... [2025-03-04 00:00:49,894 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:00:49,900 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:00:49,901 INFO L158 Benchmark]: Toolchain (without parser) took 7770.95ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 115.2MB in the beginning and 116.4MB in the end (delta: -1.2MB). Peak memory consumption was 141.8MB. Max. memory is 16.1GB. [2025-03-04 00:00:49,902 INFO L158 Benchmark]: CDTParser took 4.39ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:00:49,902 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.01ms. Allocated memory is still 142.6MB. Free memory was 114.3MB in the beginning and 98.3MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:00:49,902 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.23ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 93.5MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:00:49,902 INFO L158 Benchmark]: Boogie Preprocessor took 95.63ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 82.4MB in the end (delta: 11.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:00:49,902 INFO L158 Benchmark]: IcfgBuilder took 690.00ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 52.8MB in the end (delta: 29.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 00:00:49,902 INFO L158 Benchmark]: TraceAbstraction took 6280.79ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 51.9MB in the beginning and 116.5MB in the end (delta: -64.6MB). Peak memory consumption was 83.1MB. Max. memory is 16.1GB. [2025-03-04 00:00:49,903 INFO L158 Benchmark]: Witness Printer took 9.14ms. Allocated memory is still 285.2MB. Free memory was 116.5MB in the beginning and 116.4MB in the end (delta: 87.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:00:49,906 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 4.39ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 575.01ms. Allocated memory is still 142.6MB. Free memory was 114.3MB in the beginning and 98.3MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.23ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 93.5MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 95.63ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 82.4MB in the end (delta: 11.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 690.00ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 52.8MB in the end (delta: 29.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6280.79ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 51.9MB in the beginning and 116.5MB in the end (delta: -64.6MB). Peak memory consumption was 83.1MB. Max. memory is 16.1GB. * Witness Printer took 9.14ms. Allocated memory is still 285.2MB. Free memory was 116.5MB in the beginning and 116.4MB in the end (delta: 87.6kB). 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 someBinaryArithmeticDOUBLEoperation at line 127, overapproximation of someBinaryFLOATComparisonOperation at line 139, overapproximation of someBinaryFLOATComparisonOperation at line 137, overapproximation of someBinaryFLOATComparisonOperation at line 183, overapproximation of someBinaryFLOATComparisonOperation at line 141, overapproximation of someBinaryFLOATComparisonOperation at line 167, overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryFLOATComparisonOperation at line 143, overapproximation of someBinaryFLOATComparisonOperation at line 57, overapproximation of someBinaryDOUBLEComparisonOperation at line 150, overapproximation of someBinaryDOUBLEComparisonOperation at line 183, overapproximation of someBinaryDOUBLEComparisonOperation at line 148, overapproximation of someBinaryArithmeticFLOAToperation at line 84, overapproximation of someBinaryArithmeticFLOAToperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 99999999999.75; [L23] float var_1_4 = 31.25; [L24] float var_1_5 = 0.0; [L25] float var_1_6 = 99.5; [L26] float var_1_7 = 500.5; [L27] double var_1_8 = 199.96; [L28] double var_1_9 = 256.95; [L29] signed long int var_1_11 = 1523382513; [L30] double var_1_14 = 32.6; [L31] double var_1_15 = 0.875; [L32] unsigned short int var_1_16 = 1; [L33] unsigned char var_1_17 = 1; [L34] float var_1_18 = 0.3; [L35] signed short int var_1_19 = 4; [L36] unsigned char var_1_20 = 0; [L37] unsigned char var_1_24 = 0; [L38] unsigned char var_1_25 = 16; [L39] unsigned char var_1_26 = 5; [L40] signed short int var_1_27 = 64; [L41] unsigned char var_1_28 = 1; [L42] float var_1_29 = 64.5; [L43] float var_1_30 = 0.0; [L44] unsigned long int var_1_31 = 2; [L45] unsigned long int var_1_32 = 1140371764; [L46] unsigned long int var_1_33 = 3119542188; [L47] double var_1_34 = 10.5; [L48] unsigned short int last_1_var_1_16 = 1; [L49] signed short int last_1_var_1_19 = 4; [L50] signed short int last_1_var_1_27 = 64; [L51] float last_1_var_1_29 = 64.5; [L52] unsigned long int last_1_var_1_31 = 2; VAL [isInitial=0, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_4=125/4, var_1_5=0, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L187] isInitial = 1 [L188] FCALL initially() [L189] COND TRUE 1 [L190] CALL updateLastVariables() [L176] last_1_var_1_16 = var_1_16 [L177] last_1_var_1_19 = var_1_19 [L178] last_1_var_1_27 = var_1_27 [L179] last_1_var_1_29 = var_1_29 [L180] last_1_var_1_31 = var_1_31 VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_4=125/4, var_1_5=0, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L190] RET updateLastVariables() [L191] CALL updateVariables() [L136] var_1_4 = __VERIFIER_nondet_float() [L137] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_5=0, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_5=0, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L137] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_5=0, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L138] var_1_5 = __VERIFIER_nondet_float() [L139] CALL assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L139] RET assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L140] var_1_6 = __VERIFIER_nondet_float() [L141] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L141] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L142] var_1_7 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L143] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L144] var_1_11 = __VERIFIER_nondet_long() [L145] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L145] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L146] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L146] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L147] var_1_14 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_14 >= -230584.3009213691390e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L148] RET assume_abort_if_not((var_1_14 >= -230584.3009213691390e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L149] var_1_15 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_15 >= -230584.3009213691390e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L150] RET assume_abort_if_not((var_1_15 >= -230584.3009213691390e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L151] var_1_17 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L152] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L153] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L153] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L154] var_1_20 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L155] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L156] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L156] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L157] var_1_25 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L158] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L159] CALL assume_abort_if_not(var_1_25 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L159] RET assume_abort_if_not(var_1_25 <= 64) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L160] var_1_26 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L161] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L162] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L162] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L163] var_1_28 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L164] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L165] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L165] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L166] var_1_30 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_30 >= 2305843.009213691390e+12F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L167] RET assume_abort_if_not((var_1_30 >= 2305843.009213691390e+12F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L168] var_1_32 = __VERIFIER_nondet_ulong() [L169] CALL assume_abort_if_not(var_1_32 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L169] RET assume_abort_if_not(var_1_32 >= 1073741824) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L170] CALL assume_abort_if_not(var_1_32 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L170] RET assume_abort_if_not(var_1_32 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L171] var_1_33 = __VERIFIER_nondet_ulong() [L172] CALL assume_abort_if_not(var_1_33 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-4294967361, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-4294967361, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L172] RET assume_abort_if_not(var_1_33 >= 2147483647) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-4294967361, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L173] CALL assume_abort_if_not(var_1_33 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-4294967361, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-4294967361, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L173] RET assume_abort_if_not(var_1_33 <= 4294967294) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-4294967361, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L191] RET updateVariables() [L192] CALL step() [L56] unsigned long int stepLocal_1 = last_1_var_1_31; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-4294967361, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L57] COND FALSE !(var_1_4 < (last_1_var_1_29 + ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) [L64] var_1_8 = var_1_7 VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-4294967361, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L66] COND FALSE !(! var_1_20) [L73] var_1_24 = var_1_26 VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=-256, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-4294967361, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L75] signed long int stepLocal_6 = (((var_1_24) < (var_1_24)) ? (var_1_24) : (var_1_24)); [L76] unsigned char stepLocal_5 = var_1_28; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_5=1, stepLocal_6=0, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=-256, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-4294967361, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L77] COND FALSE !(stepLocal_6 < var_1_25) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_5=1, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=-256, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-4294967361, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L82] signed long int stepLocal_0 = ~ var_1_24; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_0=-1, stepLocal_1=2, stepLocal_5=1, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=-256, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-4294967361, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L83] COND TRUE stepLocal_0 <= var_1_24 [L84] var_1_1 = (var_1_4 - (var_1_5 - ((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))))) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_5=1, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=-256, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-4294967361, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L86] var_1_29 = (var_1_6 + ((var_1_30 - 7.6f) - var_1_7)) [L87] var_1_31 = ((((((var_1_11 + var_1_32)) > (var_1_33)) ? ((var_1_11 + var_1_32)) : (var_1_33))) - var_1_26) [L88] unsigned char stepLocal_3 = var_1_24; [L89] unsigned long int stepLocal_2 = var_1_31; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-4294967361, stepLocal_3=-256, stepLocal_5=1, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=-256, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_31=-4294967361, var_1_32=5368709120, var_1_33=-4294967361, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L90] COND FALSE !(\read(var_1_17)) [L97] var_1_16 = var_1_27 VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-4294967361, stepLocal_3=-256, stepLocal_5=1, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=-256, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_31=-4294967361, var_1_32=5368709120, var_1_33=-4294967361, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L99] signed long int stepLocal_8 = ~ var_1_16; [L100] signed long int stepLocal_7 = var_1_24 / var_1_11; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-4294967361, stepLocal_3=-256, stepLocal_5=1, stepLocal_7=0, stepLocal_8=-65, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=-256, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_31=-4294967361, var_1_32=5368709120, var_1_33=-4294967361, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L101] COND FALSE !(stepLocal_8 > var_1_31) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-4294967361, stepLocal_3=-256, stepLocal_5=1, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=-256, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_31=-4294967361, var_1_32=5368709120, var_1_33=-4294967361, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L108] unsigned char stepLocal_4 = var_1_17; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-4294967361, stepLocal_3=-256, stepLocal_4=0, stepLocal_5=1, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=-256, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_31=-4294967361, var_1_32=5368709120, var_1_33=-4294967361, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L109] COND FALSE !(stepLocal_4 && var_1_20) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-4294967361, stepLocal_3=-256, stepLocal_5=1, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=-256, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_31=-4294967361, var_1_32=5368709120, var_1_33=-4294967361, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L116] COND FALSE !((var_1_1 * (- var_1_5)) < (var_1_6 - var_1_7)) [L123] var_1_19 = ((var_1_16 + var_1_24) + 16) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-4294967361, stepLocal_3=-256, stepLocal_5=1, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=80, var_1_20=1, var_1_24=-256, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_31=-4294967361, var_1_32=5368709120, var_1_33=-4294967361, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L126] COND TRUE (var_1_19 - var_1_16) < ((var_1_11 - var_1_24) - var_1_24) [L127] var_1_9 = (var_1_7 + ((((var_1_6) > ((var_1_14 + var_1_15))) ? (var_1_6) : ((var_1_14 + var_1_15))))) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-4294967361, stepLocal_3=-256, stepLocal_5=1, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=80, var_1_20=1, var_1_24=-256, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_31=-4294967361, var_1_32=5368709120, var_1_33=-4294967361, var_1_34=21/2, var_1_7=2, var_1_8=2] [L131] COND FALSE !(var_1_19 <= var_1_16) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-4294967361, stepLocal_3=-256, stepLocal_5=1, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=80, var_1_20=1, var_1_24=-256, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_31=-4294967361, var_1_32=5368709120, var_1_33=-4294967361, var_1_34=21/2, var_1_7=2, var_1_8=2] [L192] RET step() [L193] CALL, EXPR property() [L183-L184] return ((((((((((((~ var_1_24) <= var_1_24) ? (var_1_1 == ((float) (var_1_4 - (var_1_5 - ((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))))))) : 1) && ((var_1_4 < (last_1_var_1_29 + ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) ? ((last_1_var_1_19 < last_1_var_1_31) ? (var_1_8 == ((double) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) + var_1_7))) : (var_1_8 == ((double) var_1_4))) : (var_1_8 == ((double) var_1_7)))) && (((var_1_19 - var_1_16) < ((var_1_11 - var_1_24) - var_1_24)) ? (var_1_9 == ((double) (var_1_7 + ((((var_1_6) > ((var_1_14 + var_1_15))) ? (var_1_6) : ((var_1_14 + var_1_15))))))) : (var_1_9 == ((double) (var_1_7 - var_1_5))))) && (var_1_17 ? ((var_1_11 <= var_1_24) ? ((var_1_24 <= var_1_31) ? (var_1_16 == ((unsigned short int) var_1_27)) : 1) : 1) : (var_1_16 == ((unsigned short int) var_1_27)))) && ((var_1_19 <= var_1_16) ? (var_1_18 == ((float) (var_1_15 + 64.4f))) : 1)) && ((var_1_17 && var_1_20) ? (var_1_17 ? (var_1_19 == ((signed short int) ((var_1_16 - var_1_24) + 50))) : (var_1_19 == ((signed short int) ((((var_1_24) > (var_1_16)) ? (var_1_24) : (var_1_16)))))) : (((var_1_1 * (- var_1_5)) < (var_1_6 - var_1_7)) ? ((var_1_14 == var_1_8) ? (var_1_19 == ((signed short int) var_1_16)) : (var_1_19 == ((signed short int) (var_1_16 + var_1_24)))) : (var_1_19 == ((signed short int) ((var_1_16 + var_1_24) + 16)))))) && ((! var_1_20) ? ((last_1_var_1_16 <= last_1_var_1_16) ? (var_1_24 == ((unsigned char) ((var_1_25 + 1) + var_1_26))) : (var_1_24 == ((unsigned char) var_1_26))) : (var_1_24 == ((unsigned char) var_1_26)))) && ((((((var_1_24) < (var_1_24)) ? (var_1_24) : (var_1_24))) < var_1_25) ? (((var_1_20 || var_1_17) && var_1_28) ? (var_1_27 == ((signed short int) (((((((((var_1_24) > (var_1_24)) ? (var_1_24) : (var_1_24))) + last_1_var_1_27)) < (((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26))))) ? ((((((var_1_24) > (var_1_24)) ? (var_1_24) : (var_1_24))) + last_1_var_1_27)) : (((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))))))) : 1) : 1)) && (var_1_29 == ((float) (var_1_6 + ((var_1_30 - 7.6f) - var_1_7))))) && (var_1_31 == ((unsigned long int) ((((((var_1_11 + var_1_32)) > (var_1_33)) ? ((var_1_11 + var_1_32)) : (var_1_33))) - var_1_26)))) && (((~ var_1_16) > var_1_31) ? (((var_1_24 / var_1_11) >= var_1_26) ? (var_1_34 == ((double) ((((((-5.2001036938992108E18) < 0 ) ? -(-5.2001036938992108E18) : (-5.2001036938992108E18))) - 50.25) - var_1_4))) : (var_1_34 == ((double) var_1_7))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=80, var_1_20=1, var_1_24=-256, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_31=-4294967361, var_1_32=5368709120, var_1_33=-4294967361, var_1_34=21/2, var_1_7=2, var_1_8=2] [L193] RET, EXPR property() [L193] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=80, var_1_20=1, var_1_24=-256, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_31=-4294967361, var_1_32=5368709120, var_1_33=-4294967361, var_1_34=21/2, var_1_7=2, var_1_8=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=80, var_1_20=1, var_1_24=-256, var_1_25=0, var_1_26=-256, var_1_27=64, var_1_28=1, var_1_31=-4294967361, var_1_32=5368709120, var_1_33=-4294967361, var_1_34=21/2, var_1_7=2, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 5, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 288 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 1339 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 767 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 186 IncrementalHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 572 mSDtfsCounter, 186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=223occurred in iteration=4, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 170 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1078 NumberOfCodeBlocks, 1078 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 765 ConstructedInterpolants, 0 QuantifiedInterpolants, 1089 SizeOfPredicates, 0 NumberOfNonLiveVariables, 374 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 5016/5060 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-04 00:00:49,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-84.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 73fe678a1510361e3887d1b58245b9dd4e788878d5dd5b7b4f35abb16874b2b7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:00:53,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:00:53,231 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:00:53,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:00:53,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:00:53,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:00:53,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:00:53,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:00:53,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:00:53,262 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:00:53,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:00:53,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:00:53,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:00:53,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:00:53,263 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:00:53,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:00:53,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:00:53,263 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:00:53,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:00:53,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:00:53,263 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:00:53,263 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:00:53,263 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:00:53,263 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:00:53,263 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:00:53,263 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:00:53,263 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:00:53,263 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:00:53,263 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:00:53,264 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:00:53,264 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:00:53,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:00:53,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:00:53,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:00:53,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:00:53,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:00:53,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:00:53,264 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:00:53,264 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:00:53,264 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:00:53,264 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:00:53,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:00:53,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:00:53,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:00:53,264 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:00:53,264 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 -> 73fe678a1510361e3887d1b58245b9dd4e788878d5dd5b7b4f35abb16874b2b7 [2025-03-04 00:00:53,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:00:53,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:00:53,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:00:53,599 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:00:53,599 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:00:53,603 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-84.i [2025-03-04 00:00:54,981 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1e510902/fd56e9da0fb0475e9b0311d661ba41e2/FLAG5a568f034 [2025-03-04 00:00:55,195 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:00:55,196 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-84.i [2025-03-04 00:00:55,208 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1e510902/fd56e9da0fb0475e9b0311d661ba41e2/FLAG5a568f034 [2025-03-04 00:00:55,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1e510902/fd56e9da0fb0475e9b0311d661ba41e2 [2025-03-04 00:00:55,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:00:55,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:00:55,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:00:55,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:00:55,543 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:00:55,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:00:55" (1/1) ... [2025-03-04 00:00:55,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a359110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:55, skipping insertion in model container [2025-03-04 00:00:55,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:00:55" (1/1) ... [2025-03-04 00:00:55,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:00:55,696 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-84.i[916,929] [2025-03-04 00:00:55,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:00:55,812 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:00:55,822 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-84.i[916,929] [2025-03-04 00:00:55,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:00:55,892 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:00:55,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:55 WrapperNode [2025-03-04 00:00:55,893 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:00:55,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:00:55,894 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:00:55,894 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:00:55,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:55" (1/1) ... [2025-03-04 00:00:55,914 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:55" (1/1) ... [2025-03-04 00:00:55,944 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2025-03-04 00:00:55,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:00:55,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:00:55,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:00:55,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:00:55,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:55" (1/1) ... [2025-03-04 00:00:55,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:55" (1/1) ... [2025-03-04 00:00:55,960 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:55" (1/1) ... [2025-03-04 00:00:55,979 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-04 00:00:55,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:55" (1/1) ... [2025-03-04 00:00:55,981 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:55" (1/1) ... [2025-03-04 00:00:55,992 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:55" (1/1) ... [2025-03-04 00:00:55,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:55" (1/1) ... [2025-03-04 00:00:55,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:55" (1/1) ... [2025-03-04 00:00:55,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:55" (1/1) ... [2025-03-04 00:00:55,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:00:56,000 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:00:56,000 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:00:56,000 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:00:56,001 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:55" (1/1) ... [2025-03-04 00:00:56,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:00:56,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:00:56,043 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-04 00:00:56,046 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-04 00:00:56,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:00:56,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:00:56,067 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:00:56,067 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:00:56,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:00:56,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:00:56,162 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:00:56,165 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:01:10,845 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-04 00:01:10,847 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:01:10,856 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:01:10,856 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:01:10,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:01:10 BoogieIcfgContainer [2025-03-04 00:01:10,856 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:01:10,858 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:01:10,858 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:01:10,862 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:01:10,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:00:55" (1/3) ... [2025-03-04 00:01:10,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d9918f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:01:10, skipping insertion in model container [2025-03-04 00:01:10,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:00:55" (2/3) ... [2025-03-04 00:01:10,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d9918f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:01:10, skipping insertion in model container [2025-03-04 00:01:10,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:01:10" (3/3) ... [2025-03-04 00:01:10,866 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-84.i [2025-03-04 00:01:10,877 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:01:10,878 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-84.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:01:10,923 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:01:10,932 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;@2f7214d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:01:10,932 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:01:10,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 54 states have internal predecessors, (75), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:01:10,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 00:01:10,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:01:10,947 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:01:10,947 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:01:10,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:01:10,952 INFO L85 PathProgramCache]: Analyzing trace with hash 2090448989, now seen corresponding path program 1 times [2025-03-04 00:01:10,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:01:10,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354898688] [2025-03-04 00:01:10,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:01:10,965 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-04 00:01:10,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:01:10,968 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-04 00:01:10,969 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-04 00:01:11,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 00:01:11,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 00:01:11,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:01:11,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:01:11,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:01:11,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:01:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2025-03-04 00:01:11,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:01:11,805 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:01:11,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354898688] [2025-03-04 00:01:11,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354898688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:01:11,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:01:11,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:01:11,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967592061] [2025-03-04 00:01:11,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:01:11,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:01:11,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:01:11,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:01:11,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:01:11,833 INFO L87 Difference]: Start difference. First operand has 79 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 54 states have internal predecessors, (75), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:01:11,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:01:11,854 INFO L93 Difference]: Finished difference Result 152 states and 260 transitions. [2025-03-04 00:01:11,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:01:11,856 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 154 [2025-03-04 00:01:11,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:01:11,861 INFO L225 Difference]: With dead ends: 152 [2025-03-04 00:01:11,861 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 00:01:11,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 153 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-04 00:01:11,866 INFO L435 NwaCegarLoop]: 115 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, 115 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-04 00:01:11,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:01:11,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 00:01:11,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-04 00:01:11,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:01:11,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 115 transitions. [2025-03-04 00:01:11,901 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 115 transitions. Word has length 154 [2025-03-04 00:01:11,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:01:11,901 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 115 transitions. [2025-03-04 00:01:11,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:01:11,902 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 115 transitions. [2025-03-04 00:01:11,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 00:01:11,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:01:11,904 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:01:11,935 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-04 00:01:12,105 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-04 00:01:12,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:01:12,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:01:12,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1617091232, now seen corresponding path program 1 times [2025-03-04 00:01:12,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:01:12,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [18599261] [2025-03-04 00:01:12,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:01:12,107 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-04 00:01:12,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:01:12,111 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-04 00:01:12,113 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-04 00:01:12,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 00:01:12,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 00:01:12,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:01:12,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:01:12,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:01:12,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:01:15,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 508 proven. 39 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-04 00:01:15,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:01:16,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 00:01:16,611 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:01:16,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [18599261] [2025-03-04 00:01:16,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [18599261] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 00:01:16,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:01:16,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2025-03-04 00:01:16,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140158910] [2025-03-04 00:01:16,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:01:16,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:01:16,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:01:16,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:01:16,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:01:16,616 INFO L87 Difference]: Start difference. First operand 76 states and 115 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:01:21,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:01:25,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:01:29,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:01:33,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:01:33,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:01:33,344 INFO L93 Difference]: Finished difference Result 185 states and 277 transitions. [2025-03-04 00:01:33,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:01:33,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 154 [2025-03-04 00:01:33,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:01:33,353 INFO L225 Difference]: With dead ends: 185 [2025-03-04 00:01:33,354 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 00:01:33,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:01:33,357 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 46 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:01:33,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 382 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 4 Unknown, 0 Unchecked, 16.6s Time] [2025-03-04 00:01:33,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 00:01:33,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2025-03-04 00:01:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 76 states have internal predecessors, (100), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 00:01:33,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 162 transitions. [2025-03-04 00:01:33,386 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 162 transitions. Word has length 154 [2025-03-04 00:01:33,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:01:33,387 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 162 transitions. [2025-03-04 00:01:33,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:01:33,387 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 162 transitions. [2025-03-04 00:01:33,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 00:01:33,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:01:33,389 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:01:33,422 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-04 00:01:33,590 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-04 00:01:33,591 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:01:33,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:01:33,593 INFO L85 PathProgramCache]: Analyzing trace with hash -619233469, now seen corresponding path program 1 times [2025-03-04 00:01:33,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:01:33,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947860027] [2025-03-04 00:01:33,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:01:33,594 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-04 00:01:33,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:01:33,598 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-04 00:01:33,600 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-04 00:01:33,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 00:01:34,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 00:01:34,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:01:34,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:01:35,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 00:01:35,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:01:43,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2025-03-04 00:01:43,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:01:45,906 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:01:45,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947860027] [2025-03-04 00:01:45,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947860027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:01:45,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [149769577] [2025-03-04 00:01:45,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:01:45,908 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 00:01:45,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 00:01:45,910 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 00:01:45,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-04 00:01:46,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 00:01:48,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 00:01:48,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:01:48,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:01:48,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 00:01:48,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:01:55,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2025-03-04 00:01:55,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:01:56,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [149769577] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:01:56,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:01:56,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-03-04 00:01:56,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479478573] [2025-03-04 00:01:56,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:01:56,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:01:56,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:01:56,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:01:56,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:01:56,317 INFO L87 Difference]: Start difference. First operand 109 states and 162 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:02:03,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:02:05,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:02:07,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:02:09,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:02:10,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:02:12,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:02:15,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 00:02:17,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 00:02:21,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 00:02:24,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]