./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.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_codestructure_steplocals_file-74.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 02baa2e59f749b8f6a62bf588b2331b287a06a0eaebbebe18816d2b78fb71465 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:06:02,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:06:02,398 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:06:02,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:06:02,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:06:02,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:06:02,427 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:06:02,428 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:06:02,428 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:06:02,428 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:06:02,428 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:06:02,428 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:06:02,428 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:06:02,428 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:06:02,429 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:06:02,429 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:06:02,429 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:06:02,429 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:06:02,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:06:02,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:06:02,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:06:02,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:06:02,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:06:02,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:06:02,429 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:06:02,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:06:02,430 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:06:02,430 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:06:02,430 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:06:02,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:06:02,430 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:06:02,430 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:06:02,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:06:02,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:06:02,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:06:02,430 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:06:02,431 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:06:02,431 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:06:02,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:06:02,431 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:06:02,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:06:02,431 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:06:02,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:06:02,431 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 -> 02baa2e59f749b8f6a62bf588b2331b287a06a0eaebbebe18816d2b78fb71465 [2025-03-03 19:06:02,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:06:02,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:06:02,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:06:02,650 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:06:02,650 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:06:02,651 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.i [2025-03-03 19:06:03,759 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8035fe1b6/277cce89a4b748baa61ab5dcd11adf4a/FLAGfb9765bbc [2025-03-03 19:06:03,974 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:06:03,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.i [2025-03-03 19:06:03,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8035fe1b6/277cce89a4b748baa61ab5dcd11adf4a/FLAGfb9765bbc [2025-03-03 19:06:04,328 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8035fe1b6/277cce89a4b748baa61ab5dcd11adf4a [2025-03-03 19:06:04,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:06:04,331 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:06:04,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:06:04,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:06:04,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:06:04,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:06:04" (1/1) ... [2025-03-03 19:06:04,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6340505d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:04, skipping insertion in model container [2025-03-03 19:06:04,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:06:04" (1/1) ... [2025-03-03 19:06:04,353 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:06:04,443 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_codestructure_steplocals_file-74.i[917,930] [2025-03-03 19:06:04,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:06:04,504 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:06:04,514 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_codestructure_steplocals_file-74.i[917,930] [2025-03-03 19:06:04,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:06:04,562 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:06:04,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:04 WrapperNode [2025-03-03 19:06:04,563 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:06:04,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:06:04,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:06:04,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:06:04,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:04" (1/1) ... [2025-03-03 19:06:04,580 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:04" (1/1) ... [2025-03-03 19:06:04,610 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2025-03-03 19:06:04,612 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:06:04,613 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:06:04,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:06:04,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:06:04,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:04" (1/1) ... [2025-03-03 19:06:04,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:04" (1/1) ... [2025-03-03 19:06:04,626 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:04" (1/1) ... [2025-03-03 19:06:04,637 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 19:06:04,637 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:04" (1/1) ... [2025-03-03 19:06:04,637 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:04" (1/1) ... [2025-03-03 19:06:04,646 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:04" (1/1) ... [2025-03-03 19:06:04,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:04" (1/1) ... [2025-03-03 19:06:04,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:04" (1/1) ... [2025-03-03 19:06:04,655 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:04" (1/1) ... [2025-03-03 19:06:04,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:06:04,664 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:06:04,664 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:06:04,664 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:06:04,665 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:04" (1/1) ... [2025-03-03 19:06:04,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:06:04,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:06:04,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:06:04,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:06:04,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:06:04,706 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:06:04,706 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:06:04,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:06:04,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:06:04,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:06:04,775 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:06:04,777 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:06:05,074 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L144: havoc property_#t~ite23#1;havoc property_#t~bitwise22#1;havoc property_#t~short24#1; [2025-03-03 19:06:05,100 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-03 19:06:05,102 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:06:05,115 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:06:05,116 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-03 19:06:05,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:06:05 BoogieIcfgContainer [2025-03-03 19:06:05,116 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:06:05,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:06:05,119 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:06:05,122 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:06:05,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:06:04" (1/3) ... [2025-03-03 19:06:05,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61931940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:06:05, skipping insertion in model container [2025-03-03 19:06:05,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:04" (2/3) ... [2025-03-03 19:06:05,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61931940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:06:05, skipping insertion in model container [2025-03-03 19:06:05,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:06:05" (3/3) ... [2025-03-03 19:06:05,123 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-74.i [2025-03-03 19:06:05,134 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:06:05,136 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-74.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:06:05,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:06:05,196 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;@67104c59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:06:05,197 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:06:05,201 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 56 states have internal predecessors, (74), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 19:06:05,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 19:06:05,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:06:05,212 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:06:05,212 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:06:05,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:06:05,217 INFO L85 PathProgramCache]: Analyzing trace with hash -377835695, now seen corresponding path program 1 times [2025-03-03 19:06:05,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:06:05,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121606337] [2025-03-03 19:06:05,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:06:05,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:06:05,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 19:06:05,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 19:06:05,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:06:05,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:06:05,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-03 19:06:05,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:06:05,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121606337] [2025-03-03 19:06:05,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121606337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:06:05,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019321548] [2025-03-03 19:06:05,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:06:05,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:06:05,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:06:05,511 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:06:05,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 19:06:05,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 19:06:05,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 19:06:05,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:06:05,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:06:05,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:06:05,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:06:05,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-03 19:06:05,698 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:06:05,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019321548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:06:05,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:06:05,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:06:05,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524256168] [2025-03-03 19:06:05,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:06:05,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:06:05,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:06:05,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:06:05,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:06:05,725 INFO L87 Difference]: Start difference. First operand has 86 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 56 states have internal predecessors, (74), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 19:06:05,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:06:05,749 INFO L93 Difference]: Finished difference Result 166 states and 283 transitions. [2025-03-03 19:06:05,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:06:05,752 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 178 [2025-03-03 19:06:05,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:06:05,758 INFO L225 Difference]: With dead ends: 166 [2025-03-03 19:06:05,758 INFO L226 Difference]: Without dead ends: 83 [2025-03-03 19:06:05,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:06:05,764 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:06:05,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:06:05,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-03 19:06:05,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-03 19:06:05,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 19:06:05,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2025-03-03 19:06:05,801 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 178 [2025-03-03 19:06:05,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:06:05,802 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2025-03-03 19:06:05,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 19:06:05,802 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2025-03-03 19:06:05,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 19:06:05,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:06:05,808 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:06:05,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 19:06:06,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 19:06:06,011 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:06:06,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:06:06,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1915192363, now seen corresponding path program 1 times [2025-03-03 19:06:06,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:06:06,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937359880] [2025-03-03 19:06:06,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:06:06,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:06:06,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 19:06:06,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 19:06:06,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:06:06,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:06:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 19:06:06,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:06:06,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937359880] [2025-03-03 19:06:06,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937359880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:06:06,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:06:06,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:06:06,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330626886] [2025-03-03 19:06:06,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:06:06,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:06:06,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:06:06,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:06:06,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:06:06,256 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:06:06,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:06:06,309 INFO L93 Difference]: Finished difference Result 206 states and 308 transitions. [2025-03-03 19:06:06,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:06:06,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2025-03-03 19:06:06,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:06:06,311 INFO L225 Difference]: With dead ends: 206 [2025-03-03 19:06:06,311 INFO L226 Difference]: Without dead ends: 126 [2025-03-03 19:06:06,312 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-03 19:06:06,312 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 61 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:06:06,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 231 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:06:06,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-03 19:06:06,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2025-03-03 19:06:06,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 78 states have (on average 1.2692307692307692) internal successors, (99), 79 states have internal predecessors, (99), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 19:06:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 183 transitions. [2025-03-03 19:06:06,326 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 183 transitions. Word has length 178 [2025-03-03 19:06:06,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:06:06,327 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 183 transitions. [2025-03-03 19:06:06,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:06:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 183 transitions. [2025-03-03 19:06:06,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 19:06:06,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:06:06,329 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:06:06,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:06:06,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:06:06,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:06:06,329 INFO L85 PathProgramCache]: Analyzing trace with hash 107737900, now seen corresponding path program 1 times [2025-03-03 19:06:06,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:06:06,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001110482] [2025-03-03 19:06:06,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:06:06,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:06:06,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 19:06:06,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 19:06:06,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:06:06,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:06:07,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 19:06:07,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:06:07,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001110482] [2025-03-03 19:06:07,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001110482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:06:07,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:06:07,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:06:07,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272991603] [2025-03-03 19:06:07,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:06:07,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:06:07,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:06:07,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:06:07,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:06:07,129 INFO L87 Difference]: Start difference. First operand 123 states and 183 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:06:07,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:06:07,246 INFO L93 Difference]: Finished difference Result 288 states and 426 transitions. [2025-03-03 19:06:07,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:06:07,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2025-03-03 19:06:07,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:06:07,250 INFO L225 Difference]: With dead ends: 288 [2025-03-03 19:06:07,252 INFO L226 Difference]: Without dead ends: 168 [2025-03-03 19:06:07,254 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-03 19:06:07,256 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 31 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:06:07,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 332 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:06:07,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-03 19:06:07,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 144. [2025-03-03 19:06:07,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 99 states have (on average 1.3232323232323233) internal successors, (131), 100 states have internal predecessors, (131), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 19:06:07,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 215 transitions. [2025-03-03 19:06:07,274 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 215 transitions. Word has length 178 [2025-03-03 19:06:07,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:06:07,275 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 215 transitions. [2025-03-03 19:06:07,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:06:07,275 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 215 transitions. [2025-03-03 19:06:07,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 19:06:07,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:06:07,278 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:06:07,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:06:07,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:06:07,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:06:07,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1731349180, now seen corresponding path program 1 times [2025-03-03 19:06:07,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:06:07,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863992907] [2025-03-03 19:06:07,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:06:07,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:06:07,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 19:06:07,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 19:06:07,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:06:07,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:06:08,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 19:06:08,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:06:08,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863992907] [2025-03-03 19:06:08,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863992907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:06:08,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:06:08,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 19:06:08,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916613126] [2025-03-03 19:06:08,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:06:08,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 19:06:08,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:06:08,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 19:06:08,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:06:08,311 INFO L87 Difference]: Start difference. First operand 144 states and 215 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:06:08,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:06:08,578 INFO L93 Difference]: Finished difference Result 380 states and 553 transitions. [2025-03-03 19:06:08,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 19:06:08,580 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 179 [2025-03-03 19:06:08,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:06:08,583 INFO L225 Difference]: With dead ends: 380 [2025-03-03 19:06:08,585 INFO L226 Difference]: Without dead ends: 239 [2025-03-03 19:06:08,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:06:08,587 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 102 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:06:08,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 599 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:06:08,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-03 19:06:08,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 165. [2025-03-03 19:06:08,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 120 states have (on average 1.3333333333333333) internal successors, (160), 121 states have internal predecessors, (160), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 19:06:08,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2025-03-03 19:06:08,611 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 179 [2025-03-03 19:06:08,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:06:08,612 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2025-03-03 19:06:08,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:06:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2025-03-03 19:06:08,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 19:06:08,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:06:08,616 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:06:08,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:06:08,616 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:06:08,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:06:08,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1220815003, now seen corresponding path program 1 times [2025-03-03 19:06:08,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:06:08,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705442252] [2025-03-03 19:06:08,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:06:08,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:06:08,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 19:06:08,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 19:06:08,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:06:08,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:06:09,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 19:06:09,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:06:09,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705442252] [2025-03-03 19:06:09,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705442252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:06:09,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:06:09,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 19:06:09,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324002738] [2025-03-03 19:06:09,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:06:09,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:06:09,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:06:09,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:06:09,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:06:09,207 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:06:09,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:06:09,373 INFO L93 Difference]: Finished difference Result 367 states and 531 transitions. [2025-03-03 19:06:09,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:06:09,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 179 [2025-03-03 19:06:09,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:06:09,376 INFO L225 Difference]: With dead ends: 367 [2025-03-03 19:06:09,376 INFO L226 Difference]: Without dead ends: 205 [2025-03-03 19:06:09,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:06:09,377 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 62 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:06:09,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 871 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:06:09,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-03 19:06:09,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 144. [2025-03-03 19:06:09,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 99 states have (on average 1.2727272727272727) internal successors, (126), 100 states have internal predecessors, (126), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 19:06:09,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 210 transitions. [2025-03-03 19:06:09,393 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 210 transitions. Word has length 179 [2025-03-03 19:06:09,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:06:09,393 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 210 transitions. [2025-03-03 19:06:09,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:06:09,393 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 210 transitions. [2025-03-03 19:06:09,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-03 19:06:09,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:06:09,394 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:06:09,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:06:09,396 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:06:09,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:06:09,397 INFO L85 PathProgramCache]: Analyzing trace with hash -226346683, now seen corresponding path program 1 times [2025-03-03 19:06:09,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:06:09,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10595898] [2025-03-03 19:06:09,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:06:09,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:06:09,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 19:06:09,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 19:06:09,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:06:09,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:06:09,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1396177238] [2025-03-03 19:06:09,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:06:09,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:06:09,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:06:09,456 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:06:09,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 19:06:09,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 19:06:09,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 19:06:09,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:06:09,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:06:09,566 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:06:09,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 19:06:09,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 19:06:09,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:06:09,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:06:09,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:06:09,687 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:06:09,687 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:06:09,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 19:06:09,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-03 19:06:09,891 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-03 19:06:09,960 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:06:09,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:06:09 BoogieIcfgContainer [2025-03-03 19:06:09,963 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:06:09,963 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:06:09,963 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:06:09,963 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:06:09,964 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:06:05" (3/4) ... [2025-03-03 19:06:09,965 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:06:09,966 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:06:09,966 INFO L158 Benchmark]: Toolchain (without parser) took 5635.53ms. Allocated memory was 201.3MB in the beginning and 545.3MB in the end (delta: 343.9MB). Free memory was 154.4MB in the beginning and 337.3MB in the end (delta: -182.9MB). Peak memory consumption was 160.6MB. Max. memory is 16.1GB. [2025-03-03 19:06:09,966 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:06:09,966 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.60ms. Allocated memory is still 201.3MB. Free memory was 154.4MB in the beginning and 140.7MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:06:09,967 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.00ms. Allocated memory is still 201.3MB. Free memory was 140.7MB in the beginning and 137.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:06:09,967 INFO L158 Benchmark]: Boogie Preprocessor took 47.11ms. Allocated memory is still 201.3MB. Free memory was 137.9MB in the beginning and 136.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:06:09,967 INFO L158 Benchmark]: IcfgBuilder took 452.11ms. Allocated memory is still 201.3MB. Free memory was 136.1MB in the beginning and 113.7MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 19:06:09,967 INFO L158 Benchmark]: TraceAbstraction took 4844.01ms. Allocated memory was 201.3MB in the beginning and 545.3MB in the end (delta: 343.9MB). Free memory was 112.8MB in the beginning and 337.5MB in the end (delta: -224.7MB). Peak memory consumption was 118.6MB. Max. memory is 16.1GB. [2025-03-03 19:06:09,967 INFO L158 Benchmark]: Witness Printer took 2.70ms. Allocated memory is still 545.3MB. Free memory was 337.5MB in the beginning and 337.3MB in the end (delta: 175.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:06:09,968 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.60ms. Allocated memory is still 201.3MB. Free memory was 154.4MB in the beginning and 140.7MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.00ms. Allocated memory is still 201.3MB. Free memory was 140.7MB in the beginning and 137.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.11ms. Allocated memory is still 201.3MB. Free memory was 137.9MB in the beginning and 136.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 452.11ms. Allocated memory is still 201.3MB. Free memory was 136.1MB in the beginning and 113.7MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4844.01ms. Allocated memory was 201.3MB in the beginning and 545.3MB in the end (delta: 343.9MB). Free memory was 112.8MB in the beginning and 337.5MB in the end (delta: -224.7MB). Peak memory consumption was 118.6MB. Max. memory is 16.1GB. * Witness Printer took 2.70ms. Allocated memory is still 545.3MB. Free memory was 337.5MB in the beginning and 337.3MB in the end (delta: 175.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 139, overapproximation of someBinaryFLOATComparisonOperation at line 144, overapproximation of someBinaryFLOATComparisonOperation at line 135, overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of someBinaryFLOATComparisonOperation at line 137, overapproximation of someBinaryFLOATComparisonOperation at line 129, overapproximation of someBinaryFLOATComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 144, overapproximation of someBinaryArithmeticFLOAToperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 64; [L23] signed long int var_1_2 = -1; [L24] signed long int var_1_3 = -2; [L25] unsigned char var_1_4 = 0; [L26] unsigned long int var_1_5 = 3914692693; [L27] unsigned long int var_1_6 = 32; [L28] unsigned long int var_1_7 = 1; [L29] unsigned char var_1_8 = 0; [L30] unsigned char var_1_9 = 0; [L31] unsigned char var_1_10 = 0; [L32] unsigned char var_1_11 = 50; [L33] signed long int var_1_12 = 25; [L34] signed long int var_1_13 = 1; [L35] float var_1_15 = 4.75; [L36] unsigned char var_1_16 = 100; [L37] float var_1_17 = 50.1; [L38] float var_1_18 = 100.9; [L39] float var_1_19 = 8.5; [L40] float var_1_20 = 10.625; [L41] float var_1_21 = 0.0; [L42] float var_1_22 = 7.8; [L43] float var_1_23 = 8.25; [L44] double var_1_24 = 5.5; VAL [isInitial=0, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=-1, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L148] isInitial = 1 [L149] FCALL initially() [L150] COND TRUE 1 [L151] FCALL updateLastVariables() [L152] CALL updateVariables() [L95] var_1_2 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L96] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L97] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L98] var_1_3 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L99] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L100] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L101] var_1_4 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L102] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L103] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L103] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L104] var_1_5 = __VERIFIER_nondet_ulong() [L105] CALL assume_abort_if_not(var_1_5 >= 3221225470) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L105] RET assume_abort_if_not(var_1_5 >= 3221225470) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L106] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L106] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L107] var_1_6 = __VERIFIER_nondet_ulong() [L108] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_7=1, var_1_8=0, var_1_9=0] [L108] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_7=1, var_1_8=0, var_1_9=0] [L109] CALL assume_abort_if_not(var_1_6 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L109] RET assume_abort_if_not(var_1_6 <= 1073741823) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L110] var_1_7 = __VERIFIER_nondet_ulong() [L111] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_8=0, var_1_9=0] [L111] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_8=0, var_1_9=0] [L112] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L112] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L113] var_1_9 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0] [L114] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0] [L115] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L115] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L116] var_1_10 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L117] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L118] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L118] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L119] var_1_12 = __VERIFIER_nondet_long() [L120] CALL assume_abort_if_not(var_1_12 >= 14) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L120] RET assume_abort_if_not(var_1_12 >= 14) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L121] CALL assume_abort_if_not(var_1_12 <= 29) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L121] RET assume_abort_if_not(var_1_12 <= 29) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L122] var_1_13 = __VERIFIER_nondet_long() [L123] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L123] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L124] CALL assume_abort_if_not(var_1_13 <= 14) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L124] RET assume_abort_if_not(var_1_13 <= 14) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L125] var_1_16 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L126] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L127] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L127] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L128] var_1_17 = __VERIFIER_nondet_float() [L129] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L129] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L130] var_1_19 = __VERIFIER_nondet_float() [L131] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L131] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L132] var_1_20 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L133] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L134] var_1_21 = __VERIFIER_nondet_float() [L135] CALL assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L135] RET assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L136] var_1_22 = __VERIFIER_nondet_float() [L137] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L137] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L138] var_1_23 = __VERIFIER_nondet_float() [L139] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L139] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L152] RET updateVariables() [L153] CALL step() [L48] COND FALSE !(! (var_1_2 >= var_1_3)) [L55] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L57] signed long int stepLocal_1 = var_1_3; [L58] signed long int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L59] COND FALSE !(var_1_6 < stepLocal_0) VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L64] EXPR 5u << (var_1_12 - var_1_13) VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L64] unsigned long int stepLocal_3 = 5u << (var_1_12 - var_1_13); [L65] unsigned long int stepLocal_2 = var_1_7; VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=5, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L66] COND FALSE !(! ((var_1_5 > var_1_7) || var_1_4)) [L77] var_1_11 = var_1_12 VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=5, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L79] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=5, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L84] COND FALSE !(\read(var_1_10)) [L87] var_1_18 = (((var_1_21 - var_1_22) - var_1_23) + var_1_20) VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=5, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L89] signed long int stepLocal_4 = var_1_12 - var_1_11; VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=5, stepLocal_4=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L90] COND TRUE (~ var_1_3) <= stepLocal_4 [L91] var_1_24 = var_1_22 VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=5, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L153] RET step() [L154] CALL, EXPR property() [L144] EXPR (((! (var_1_2 >= var_1_3)) ? (var_1_4 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_6) - var_1_7))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_7))) && ((var_1_6 < var_1_3) ? ((var_1_3 <= var_1_6) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_4)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L144] EXPR (! ((var_1_5 > var_1_7) || var_1_4)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)) VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L144] EXPR (((! (var_1_2 >= var_1_3)) ? (var_1_4 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_6) - var_1_7))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_7))) && ((var_1_6 < var_1_3) ? ((var_1_3 <= var_1_6) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_4)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L144-L145] return ((((((! (var_1_2 >= var_1_3)) ? (var_1_4 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_6) - var_1_7))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_7))) && ((var_1_6 < var_1_3) ? ((var_1_3 <= var_1_6) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_4)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)))) && (var_1_10 ? ((var_1_11 > (var_1_6 / (var_1_12 + var_1_16))) ? (var_1_15 == ((float) var_1_17)) : 1) : 1)) && (var_1_10 ? (var_1_18 == ((float) (var_1_19 + var_1_20))) : (var_1_18 == ((float) (((var_1_21 - var_1_22) - var_1_23) + var_1_20))))) && (((~ var_1_3) <= (var_1_12 - var_1_11)) ? (var_1_24 == ((double) var_1_22)) : 1) ; [L154] RET, EXPR property() [L154] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 6, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 256 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 256 mSDsluCounter, 2156 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1476 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 435 IncrementalHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 680 mSDtfsCounter, 435 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=4, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 162 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1430 NumberOfCodeBlocks, 1430 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1064 ConstructedInterpolants, 0 QuantifiedInterpolants, 2071 SizeOfPredicates, 0 NumberOfNonLiveVariables, 389 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 9018/9072 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 19:06:09,987 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_codestructure_steplocals_file-74.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 02baa2e59f749b8f6a62bf588b2331b287a06a0eaebbebe18816d2b78fb71465 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:06:11,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:06:11,852 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:06:11,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:06:11,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:06:11,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:06:11,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:06:11,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:06:11,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:06:11,875 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:06:11,875 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:06:11,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:06:11,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:06:11,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:06:11,876 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:06:11,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:06:11,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:06:11,876 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:06:11,876 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:06:11,876 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:06:11,876 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:06:11,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:06:11,876 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:06:11,876 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:06:11,876 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:06:11,876 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:06:11,876 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:06:11,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:06:11,876 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:06:11,876 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:06:11,876 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:06:11,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:06:11,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:06:11,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:06:11,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:06:11,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:06:11,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:06:11,877 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:06:11,877 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:06:11,877 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:06:11,877 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:06:11,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:06:11,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:06:11,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:06:11,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:06:11,877 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 -> 02baa2e59f749b8f6a62bf588b2331b287a06a0eaebbebe18816d2b78fb71465 [2025-03-03 19:06:12,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:06:12,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:06:12,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:06:12,106 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:06:12,107 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:06:12,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.i [2025-03-03 19:06:13,249 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccc76147a/f73b9e031edb4e76858c7bbc438db942/FLAGb9d2d15a8 [2025-03-03 19:06:13,452 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:06:13,453 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.i [2025-03-03 19:06:13,461 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccc76147a/f73b9e031edb4e76858c7bbc438db942/FLAGb9d2d15a8 [2025-03-03 19:06:13,832 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccc76147a/f73b9e031edb4e76858c7bbc438db942 [2025-03-03 19:06:13,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:06:13,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:06:13,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:06:13,838 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:06:13,841 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:06:13,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:06:13" (1/1) ... [2025-03-03 19:06:13,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a88997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:13, skipping insertion in model container [2025-03-03 19:06:13,843 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:06:13" (1/1) ... [2025-03-03 19:06:13,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:06:13,948 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_codestructure_steplocals_file-74.i[917,930] [2025-03-03 19:06:13,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:06:13,994 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:06:14,001 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_codestructure_steplocals_file-74.i[917,930] [2025-03-03 19:06:14,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:06:14,034 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:06:14,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:14 WrapperNode [2025-03-03 19:06:14,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:06:14,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:06:14,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:06:14,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:06:14,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:14" (1/1) ... [2025-03-03 19:06:14,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:14" (1/1) ... [2025-03-03 19:06:14,071 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 161 [2025-03-03 19:06:14,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:06:14,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:06:14,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:06:14,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:06:14,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:14" (1/1) ... [2025-03-03 19:06:14,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:14" (1/1) ... [2025-03-03 19:06:14,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:14" (1/1) ... [2025-03-03 19:06:14,099 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 19:06:14,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:14" (1/1) ... [2025-03-03 19:06:14,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:14" (1/1) ... [2025-03-03 19:06:14,111 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:14" (1/1) ... [2025-03-03 19:06:14,115 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:14" (1/1) ... [2025-03-03 19:06:14,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:14" (1/1) ... [2025-03-03 19:06:14,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:14" (1/1) ... [2025-03-03 19:06:14,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:06:14,124 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:06:14,124 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:06:14,124 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:06:14,125 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:14" (1/1) ... [2025-03-03 19:06:14,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:06:14,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:06:14,158 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:06:14,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:06:14,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:06:14,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:06:14,182 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:06:14,182 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:06:14,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:06:14,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:06:14,253 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:06:14,255 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:06:16,889 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 19:06:16,889 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:06:16,898 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:06:16,898 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:06:16,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:06:16 BoogieIcfgContainer [2025-03-03 19:06:16,898 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:06:16,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:06:16,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:06:16,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:06:16,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:06:13" (1/3) ... [2025-03-03 19:06:16,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d61dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:06:16, skipping insertion in model container [2025-03-03 19:06:16,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:06:14" (2/3) ... [2025-03-03 19:06:16,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d61dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:06:16, skipping insertion in model container [2025-03-03 19:06:16,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:06:16" (3/3) ... [2025-03-03 19:06:16,905 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-74.i [2025-03-03 19:06:16,914 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:06:16,915 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-74.i that has 2 procedures, 77 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:06:16,947 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:06:16,954 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;@6c35d659, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:06:16,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:06:16,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 19:06:16,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 19:06:16,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:06:16,965 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:06:16,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:06:16,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:06:16,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1575457778, now seen corresponding path program 1 times [2025-03-03 19:06:16,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:06:16,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377455834] [2025-03-03 19:06:16,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:06:16,976 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:06:16,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:06:16,979 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:06:16,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 19:06:17,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 19:06:17,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 19:06:17,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:06:17,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:06:17,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:06:17,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:06:17,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2025-03-03 19:06:17,363 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:06:17,364 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:06:17,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377455834] [2025-03-03 19:06:17,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377455834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:06:17,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:06:17,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:06:17,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311600957] [2025-03-03 19:06:17,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:06:17,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:06:17,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:06:17,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:06:17,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:06:17,382 INFO L87 Difference]: Start difference. First operand has 77 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 19:06:17,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:06:17,398 INFO L93 Difference]: Finished difference Result 148 states and 257 transitions. [2025-03-03 19:06:17,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:06:17,400 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 175 [2025-03-03 19:06:17,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:06:17,405 INFO L225 Difference]: With dead ends: 148 [2025-03-03 19:06:17,405 INFO L226 Difference]: Without dead ends: 74 [2025-03-03 19:06:17,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:06:17,409 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:06:17,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:06:17,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-03 19:06:17,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-03 19:06:17,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 19:06:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 112 transitions. [2025-03-03 19:06:17,444 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 112 transitions. Word has length 175 [2025-03-03 19:06:17,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:06:17,445 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 112 transitions. [2025-03-03 19:06:17,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 19:06:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 112 transitions. [2025-03-03 19:06:17,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 19:06:17,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:06:17,449 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:06:17,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 19:06:17,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:06:17,650 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:06:17,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:06:17,651 INFO L85 PathProgramCache]: Analyzing trace with hash 738547060, now seen corresponding path program 1 times [2025-03-03 19:06:17,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:06:17,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215300819] [2025-03-03 19:06:17,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:06:17,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:06:17,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:06:17,655 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:06:17,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 19:06:17,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 19:06:18,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 19:06:18,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:06:18,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:06:18,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-03 19:06:18,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:07:02,714 WARN L286 SmtUtils]: Spent 16.21s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)