./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-89.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 0e5b25db77af6087a8d68144f29b6dbfffc93c4c0b7ce6d33c40c5bcadf93148 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:19:06,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:19:06,727 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:19:06,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:19:06,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:19:06,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:19:06,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:19:06,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:19:06,755 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:19:06,755 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:19:06,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:19:06,756 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:19:06,756 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:19:06,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:19:06,756 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:19:06,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:19:06,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:19:06,756 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:19:06,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:19:06,756 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:19:06,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:19:06,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:19:06,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:19:06,757 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:19:06,757 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:19:06,757 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:19:06,757 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:19:06,757 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:19:06,757 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:19:06,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:19:06,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:19:06,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:19:06,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:19:06,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:19:06,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:19:06,757 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:19:06,757 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:19:06,757 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:19:06,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:19:06,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:19:06,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:19:06,757 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:19:06,757 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:19:06,757 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 -> 0e5b25db77af6087a8d68144f29b6dbfffc93c4c0b7ce6d33c40c5bcadf93148 [2025-03-08 10:19:06,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:19:06,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:19:06,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:19:06,986 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:19:06,986 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:19:06,987 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-89.i [2025-03-08 10:19:08,154 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18aa2064d/0f7dc22782a84a7092960269c6654fda/FLAG21a7f8744 [2025-03-08 10:19:08,399 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:19:08,399 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-89.i [2025-03-08 10:19:08,405 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18aa2064d/0f7dc22782a84a7092960269c6654fda/FLAG21a7f8744 [2025-03-08 10:19:08,415 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18aa2064d/0f7dc22782a84a7092960269c6654fda [2025-03-08 10:19:08,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:19:08,418 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:19:08,419 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:19:08,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:19:08,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:19:08,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:19:08" (1/1) ... [2025-03-08 10:19:08,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3641e6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:08, skipping insertion in model container [2025-03-08 10:19:08,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:19:08" (1/1) ... [2025-03-08 10:19:08,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:19:08,552 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-89.i[917,930] [2025-03-08 10:19:08,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:19:08,616 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:19:08,623 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-89.i[917,930] [2025-03-08 10:19:08,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:19:08,670 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:19:08,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:08 WrapperNode [2025-03-08 10:19:08,671 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:19:08,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:19:08,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:19:08,673 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:19:08,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:08" (1/1) ... [2025-03-08 10:19:08,683 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:08" (1/1) ... [2025-03-08 10:19:08,707 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2025-03-08 10:19:08,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:19:08,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:19:08,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:19:08,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:19:08,714 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:08" (1/1) ... [2025-03-08 10:19:08,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:08" (1/1) ... [2025-03-08 10:19:08,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:08" (1/1) ... [2025-03-08 10:19:08,730 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:19:08,731 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:08" (1/1) ... [2025-03-08 10:19:08,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:08" (1/1) ... [2025-03-08 10:19:08,736 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:08" (1/1) ... [2025-03-08 10:19:08,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:08" (1/1) ... [2025-03-08 10:19:08,739 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:08" (1/1) ... [2025-03-08 10:19:08,740 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:08" (1/1) ... [2025-03-08 10:19:08,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:19:08,742 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:19:08,742 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:19:08,742 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:19:08,743 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:08" (1/1) ... [2025-03-08 10:19:08,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:19:08,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:19:08,770 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:19:08,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:19:08,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:19:08,789 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:19:08,789 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:19:08,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:19:08,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:19:08,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:19:08,840 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:19:08,842 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:19:09,077 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 10:19:09,077 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:19:09,086 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:19:09,087 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:19:09,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:19:09 BoogieIcfgContainer [2025-03-08 10:19:09,087 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:19:09,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:19:09,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:19:09,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:19:09,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:19:08" (1/3) ... [2025-03-08 10:19:09,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72139536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:19:09, skipping insertion in model container [2025-03-08 10:19:09,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:08" (2/3) ... [2025-03-08 10:19:09,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72139536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:19:09, skipping insertion in model container [2025-03-08 10:19:09,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:19:09" (3/3) ... [2025-03-08 10:19:09,094 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-89.i [2025-03-08 10:19:09,103 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:19:09,105 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-89.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:19:09,139 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:19:09,146 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;@3499a8b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:19:09,146 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:19:09,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 10:19:09,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 10:19:09,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:19:09,161 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:19:09,162 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:19:09,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:19:09,165 INFO L85 PathProgramCache]: Analyzing trace with hash 278670828, now seen corresponding path program 1 times [2025-03-08 10:19:09,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:19:09,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183459921] [2025-03-08 10:19:09,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:19:09,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:19:09,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 10:19:09,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 10:19:09,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:19:09,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:19:09,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-08 10:19:09,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:19:09,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183459921] [2025-03-08 10:19:09,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183459921] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:19:09,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470775444] [2025-03-08 10:19:09,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:19:09,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:19:09,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:19:09,405 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:19:09,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 10:19:09,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 10:19:09,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 10:19:09,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:19:09,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:19:09,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:19:09,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:19:09,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-08 10:19:09,573 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:19:09,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470775444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:19:09,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:19:09,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:19:09,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299734340] [2025-03-08 10:19:09,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:19:09,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:19:09,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:19:09,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:19:09,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:19:09,600 INFO L87 Difference]: Start difference. First operand has 70 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 10:19:09,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:19:09,620 INFO L93 Difference]: Finished difference Result 134 states and 235 transitions. [2025-03-08 10:19:09,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:19:09,621 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 150 [2025-03-08 10:19:09,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:19:09,626 INFO L225 Difference]: With dead ends: 134 [2025-03-08 10:19:09,626 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 10:19:09,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:19:09,630 INFO L435 NwaCegarLoop]: 103 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, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:19:09,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:19:09,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 10:19:09,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-08 10:19:09,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 10:19:09,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2025-03-08 10:19:09,660 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 150 [2025-03-08 10:19:09,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:19:09,661 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2025-03-08 10:19:09,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 10:19:09,661 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2025-03-08 10:19:09,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 10:19:09,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:19:09,664 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:19:09,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 10:19:09,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 10:19:09,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:19:09,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:19:09,866 INFO L85 PathProgramCache]: Analyzing trace with hash -756578546, now seen corresponding path program 1 times [2025-03-08 10:19:09,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:19:09,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272301010] [2025-03-08 10:19:09,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:19:09,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:19:09,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 10:19:09,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 10:19:09,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:19:09,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:19:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 10:19:10,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:19:10,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272301010] [2025-03-08 10:19:10,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272301010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:19:10,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:19:10,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:19:10,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974533572] [2025-03-08 10:19:10,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:19:10,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:19:10,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:19:10,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:19:10,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:19:10,297 INFO L87 Difference]: Start difference. First operand 67 states and 103 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 10:19:10,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:19:10,340 INFO L93 Difference]: Finished difference Result 194 states and 301 transitions. [2025-03-08 10:19:10,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:19:10,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 150 [2025-03-08 10:19:10,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:19:10,342 INFO L225 Difference]: With dead ends: 194 [2025-03-08 10:19:10,344 INFO L226 Difference]: Without dead ends: 130 [2025-03-08 10:19:10,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-08 10:19:10,345 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 50 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:19:10,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 195 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:19:10,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-08 10:19:10,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2025-03-08 10:19:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 75 states have (on average 1.32) internal successors, (99), 75 states have internal predecessors, (99), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 10:19:10,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 195 transitions. [2025-03-08 10:19:10,372 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 195 transitions. Word has length 150 [2025-03-08 10:19:10,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:19:10,372 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 195 transitions. [2025-03-08 10:19:10,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 10:19:10,372 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 195 transitions. [2025-03-08 10:19:10,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 10:19:10,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:19:10,374 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:19:10,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:19:10,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:19:10,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:19:10,377 INFO L85 PathProgramCache]: Analyzing trace with hash 216812588, now seen corresponding path program 1 times [2025-03-08 10:19:10,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:19:10,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243487637] [2025-03-08 10:19:10,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:19:10,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:19:10,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 10:19:10,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 10:19:10,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:19:10,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 10:19:10,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [788055473] [2025-03-08 10:19:10,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:19:10,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:19:10,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:19:10,528 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-08 10:19:10,529 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-08 10:19:10,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 10:19:10,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 10:19:10,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:19:10,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:19:10,834 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 10:19:10,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 10:19:10,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 10:19:10,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:19:10,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:19:10,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 10:19:10,925 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 10:19:10,926 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 10:19:10,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 10:19:11,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 10:19:11,131 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 10:19:11,194 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 10:19:11,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:19:11 BoogieIcfgContainer [2025-03-08 10:19:11,196 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 10:19:11,197 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 10:19:11,197 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 10:19:11,197 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 10:19:11,197 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:19:09" (3/4) ... [2025-03-08 10:19:11,199 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 10:19:11,199 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 10:19:11,200 INFO L158 Benchmark]: Toolchain (without parser) took 2782.06ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 46.3MB in the end (delta: 65.9MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. [2025-03-08 10:19:11,200 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:19:11,200 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.77ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 98.2MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:19:11,200 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.83ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 95.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:19:11,200 INFO L158 Benchmark]: Boogie Preprocessor took 33.63ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 91.7MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:19:11,200 INFO L158 Benchmark]: IcfgBuilder took 344.98ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 71.1MB in the end (delta: 20.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 10:19:11,201 INFO L158 Benchmark]: TraceAbstraction took 2107.23ms. Allocated memory is still 142.6MB. Free memory was 70.6MB in the beginning and 47.2MB in the end (delta: 23.4MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2025-03-08 10:19:11,201 INFO L158 Benchmark]: Witness Printer took 2.60ms. Allocated memory is still 142.6MB. Free memory was 46.3MB in the beginning and 46.3MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:19:11,202 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.21ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.77ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 98.2MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.83ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 95.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.63ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 91.7MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 344.98ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 71.1MB in the end (delta: 20.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2107.23ms. Allocated memory is still 142.6MB. Free memory was 70.6MB in the beginning and 47.2MB in the end (delta: 23.4MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * Witness Printer took 2.60ms. Allocated memory is still 142.6MB. Free memory was 46.3MB in the beginning and 46.3MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 138. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 32; [L23] signed long int var_1_2 = 16; [L24] signed long int var_1_3 = 4; [L25] unsigned char var_1_4 = 0; [L26] signed long int var_1_5 = 4; [L27] signed long int var_1_6 = 256; [L28] signed long int var_1_7 = -1; [L29] unsigned short int var_1_8 = 32; [L30] signed long int var_1_9 = -16; [L31] unsigned short int var_1_10 = 5; [L32] unsigned short int var_1_11 = 128; [L33] unsigned char var_1_12 = 32; [L34] unsigned char var_1_13 = 1; [L35] unsigned char var_1_14 = 0; [L36] unsigned char var_1_15 = 0; [L37] double var_1_16 = 63.75; [L38] double var_1_17 = 8.5; [L39] signed short int var_1_18 = -64; VAL [isInitial=0, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=16, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L142] isInitial = 1 [L143] FCALL initially() [L144] COND TRUE 1 [L145] FCALL updateLastVariables() [L146] CALL updateVariables() [L98] var_1_2 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L99] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L100] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L100] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L101] var_1_3 = __VERIFIER_nondet_long() [L102] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L102] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L103] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L103] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L104] var_1_4 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L105] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L106] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L106] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L107] var_1_5 = __VERIFIER_nondet_long() [L108] CALL assume_abort_if_not(var_1_5 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L108] RET assume_abort_if_not(var_1_5 >= -2147483647) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L109] CALL assume_abort_if_not(var_1_5 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L109] RET assume_abort_if_not(var_1_5 <= 2147483646) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L110] var_1_6 = __VERIFIER_nondet_long() [L111] CALL assume_abort_if_not(var_1_6 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-1, var_1_8=32, var_1_9=-16] [L111] RET assume_abort_if_not(var_1_6 >= -2147483647) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-1, var_1_8=32, var_1_9=-16] [L112] CALL assume_abort_if_not(var_1_6 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-1, var_1_8=32, var_1_9=-16] [L112] RET assume_abort_if_not(var_1_6 <= 2147483646) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-1, var_1_8=32, var_1_9=-16] [L113] var_1_7 = __VERIFIER_nondet_long() [L114] CALL assume_abort_if_not(var_1_7 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-16] [L114] RET assume_abort_if_not(var_1_7 >= -2147483647) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-16] [L115] CALL assume_abort_if_not(var_1_7 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-16] [L115] RET assume_abort_if_not(var_1_7 <= 2147483646) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-16] [L116] var_1_9 = __VERIFIER_nondet_long() [L117] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L117] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L118] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L118] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L119] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L119] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L120] var_1_10 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L121] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L122] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L122] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, var_1_10=32, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L123] var_1_11 = __VERIFIER_nondet_ushort() [L124] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L124] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L125] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L125] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L126] var_1_13 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L127] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L128] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L128] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L129] var_1_15 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L130] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L131] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L131] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L132] var_1_17 = __VERIFIER_nondet_double() [L133] 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=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L133] 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=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L146] RET updateVariables() [L147] CALL step() [L43] COND FALSE !(var_1_2 != var_1_3) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L48] signed long int stepLocal_1 = var_1_5 / var_1_9; [L49] signed long int stepLocal_0 = var_1_2 * 256; VAL [isInitial=1, stepLocal_0=8192, stepLocal_1=0, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L50] COND FALSE !(var_1_6 >= stepLocal_1) [L57] var_1_8 = var_1_10 VAL [isInitial=1, stepLocal_0=8192, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L59] COND FALSE !(var_1_10 < var_1_1) VAL [isInitial=1, stepLocal_0=8192, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L70] unsigned char stepLocal_2 = var_1_12; VAL [isInitial=1, stepLocal_0=8192, stepLocal_2=32, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L71] COND FALSE !(stepLocal_2 > (((((var_1_3) < (var_1_8)) ? (var_1_3) : (var_1_8))) + var_1_10)) VAL [isInitial=1, stepLocal_0=8192, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L82] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, stepLocal_0=8192, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L89] COND FALSE !(\read(var_1_4)) [L92] var_1_16 = var_1_17 VAL [isInitial=1, stepLocal_0=8192, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L95] var_1_18 = var_1_12 VAL [isInitial=1, stepLocal_0=8192, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L147] RET step() [L148] CALL, EXPR property() [L138-L139] return ((((((var_1_2 != var_1_3) ? (var_1_4 ? (var_1_1 == ((signed long int) ((((((((-5) > (var_1_5)) ? (-5) : (var_1_5)))) < (((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))))) ? (((((-5) > (var_1_5)) ? (-5) : (var_1_5)))) : (((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7)))))))) : 1) : 1) && ((var_1_6 >= (var_1_5 / var_1_9)) ? ((var_1_3 < (var_1_2 * 256)) ? (var_1_8 == ((unsigned short int) ((((var_1_10) < (((((128) < (var_1_11)) ? (128) : (var_1_11))))) ? (var_1_10) : (((((128) < (var_1_11)) ? (128) : (var_1_11)))))))) : (var_1_8 == ((unsigned short int) var_1_11))) : (var_1_8 == ((unsigned short int) var_1_10)))) && ((var_1_10 < var_1_1) ? ((var_1_3 <= (5 - var_1_8)) ? (var_1_12 == ((unsigned char) var_1_13)) : ((var_1_3 == var_1_6) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) var_1_13)))) : 1)) && ((var_1_12 > (((((var_1_3) < (var_1_8)) ? (var_1_3) : (var_1_8))) + var_1_10)) ? ((! (var_1_8 >= var_1_5)) ? (var_1_4 ? (var_1_14 == ((unsigned char) 0)) : (var_1_14 == ((unsigned char) var_1_15))) : (var_1_14 == ((unsigned char) var_1_15))) : 1)) && (var_1_14 ? (var_1_15 ? (var_1_16 == ((double) var_1_17)) : (var_1_16 == ((double) (((((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) > (var_1_17)) ? ((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) : (var_1_17)))))) : (var_1_4 ? (var_1_16 == ((double) 5.2)) : (var_1_16 == ((double) var_1_17))))) && (var_1_18 == ((signed short int) var_1_12)) ; VAL [\result=0, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L148] RET, EXPR property() [L148] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 132 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 3, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 298 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 204 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 750 NumberOfCodeBlocks, 750 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 447 ConstructedInterpolants, 0 QuantifiedInterpolants, 823 SizeOfPredicates, 0 NumberOfNonLiveVariables, 330 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 3266/3312 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 10:19:11,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-89.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 0e5b25db77af6087a8d68144f29b6dbfffc93c4c0b7ce6d33c40c5bcadf93148 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:19:12,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:19:13,072 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 10:19:13,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:19:13,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:19:13,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:19:13,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:19:13,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:19:13,125 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:19:13,125 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:19:13,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:19:13,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:19:13,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:19:13,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:19:13,130 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:19:13,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:19:13,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:19:13,130 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:19:13,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:19:13,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:19:13,130 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:19:13,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:19:13,130 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:19:13,130 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 10:19:13,131 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 10:19:13,131 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 10:19:13,131 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:19:13,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:19:13,131 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:19:13,131 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:19:13,131 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:19:13,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:19:13,131 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:19:13,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:19:13,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:19:13,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:19:13,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:19:13,131 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:19:13,131 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:19:13,131 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 10:19:13,133 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 10:19:13,133 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:19:13,133 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:19:13,133 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:19:13,134 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:19:13,134 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 -> 0e5b25db77af6087a8d68144f29b6dbfffc93c4c0b7ce6d33c40c5bcadf93148 [2025-03-08 10:19:13,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:19:13,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:19:13,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:19:13,374 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:19:13,374 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:19:13,376 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-89.i [2025-03-08 10:19:14,483 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af271e402/5144acfe67d84d4cb548d4d8ef2116d0/FLAG1e5f3ebd2 [2025-03-08 10:19:14,703 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:19:14,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-89.i [2025-03-08 10:19:14,712 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af271e402/5144acfe67d84d4cb548d4d8ef2116d0/FLAG1e5f3ebd2 [2025-03-08 10:19:14,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af271e402/5144acfe67d84d4cb548d4d8ef2116d0 [2025-03-08 10:19:14,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:19:14,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:19:14,734 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:19:14,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:19:14,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:19:14,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:19:14" (1/1) ... [2025-03-08 10:19:14,738 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b88d5d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:14, skipping insertion in model container [2025-03-08 10:19:14,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:19:14" (1/1) ... [2025-03-08 10:19:14,755 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:19:14,864 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-89.i[917,930] [2025-03-08 10:19:14,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:19:14,915 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:19:14,925 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-89.i[917,930] [2025-03-08 10:19:14,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:19:14,954 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:19:14,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:14 WrapperNode [2025-03-08 10:19:14,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:19:14,956 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:19:14,956 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:19:14,956 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:19:14,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:14" (1/1) ... [2025-03-08 10:19:14,972 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:14" (1/1) ... [2025-03-08 10:19:14,991 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2025-03-08 10:19:14,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:19:14,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:19:14,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:19:14,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:19:14,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:14" (1/1) ... [2025-03-08 10:19:14,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:14" (1/1) ... [2025-03-08 10:19:15,002 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:14" (1/1) ... [2025-03-08 10:19:15,015 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:19:15,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:14" (1/1) ... [2025-03-08 10:19:15,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:14" (1/1) ... [2025-03-08 10:19:15,023 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:14" (1/1) ... [2025-03-08 10:19:15,027 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:14" (1/1) ... [2025-03-08 10:19:15,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:14" (1/1) ... [2025-03-08 10:19:15,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:14" (1/1) ... [2025-03-08 10:19:15,036 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:19:15,037 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:19:15,037 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:19:15,037 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:19:15,038 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:14" (1/1) ... [2025-03-08 10:19:15,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:19:15,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:19:15,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:19:15,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:19:15,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:19:15,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 10:19:15,087 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:19:15,087 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:19:15,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:19:15,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:19:15,144 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:19:15,145 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:19:15,483 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 10:19:15,483 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:19:15,492 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:19:15,493 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:19:15,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:19:15 BoogieIcfgContainer [2025-03-08 10:19:15,493 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:19:15,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:19:15,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:19:15,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:19:15,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:19:14" (1/3) ... [2025-03-08 10:19:15,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@391c4356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:19:15, skipping insertion in model container [2025-03-08 10:19:15,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:14" (2/3) ... [2025-03-08 10:19:15,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@391c4356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:19:15, skipping insertion in model container [2025-03-08 10:19:15,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:19:15" (3/3) ... [2025-03-08 10:19:15,502 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-89.i [2025-03-08 10:19:15,511 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:19:15,512 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-89.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:19:15,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:19:15,563 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;@27578f1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:19:15,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:19:15,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 10:19:15,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 10:19:15,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:19:15,574 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:19:15,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:19:15,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:19:15,578 INFO L85 PathProgramCache]: Analyzing trace with hash 278670828, now seen corresponding path program 1 times [2025-03-08 10:19:15,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:19:15,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93318465] [2025-03-08 10:19:15,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:19:15,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:19:15,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:19:15,588 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:19:15,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 10:19:15,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 10:19:15,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 10:19:15,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:19:15,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:19:15,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:19:15,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:19:15,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2025-03-08 10:19:15,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:19:15,842 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:19:15,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93318465] [2025-03-08 10:19:15,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [93318465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:19:15,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:19:15,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 10:19:15,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072982471] [2025-03-08 10:19:15,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:19:15,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:19:15,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:19:15,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:19:15,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:19:15,862 INFO L87 Difference]: Start difference. First operand has 70 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 10:19:15,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:19:15,885 INFO L93 Difference]: Finished difference Result 134 states and 235 transitions. [2025-03-08 10:19:15,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:19:15,887 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 150 [2025-03-08 10:19:15,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:19:15,891 INFO L225 Difference]: With dead ends: 134 [2025-03-08 10:19:15,891 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 10:19:15,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:19:15,895 INFO L435 NwaCegarLoop]: 103 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, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:19:15,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:19:15,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 10:19:15,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-08 10:19:15,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 10:19:15,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2025-03-08 10:19:15,934 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 150 [2025-03-08 10:19:15,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:19:15,934 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2025-03-08 10:19:15,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 10:19:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2025-03-08 10:19:15,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 10:19:15,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:19:15,937 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:19:15,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-08 10:19:16,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:19:16,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:19:16,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:19:16,140 INFO L85 PathProgramCache]: Analyzing trace with hash -756578546, now seen corresponding path program 1 times [2025-03-08 10:19:16,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:19:16,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353880319] [2025-03-08 10:19:16,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:19:16,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:19:16,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:19:16,143 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:19:16,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 10:19:16,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 10:19:16,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 10:19:16,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:19:16,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:19:16,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 10:19:16,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:19:16,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 10:19:16,641 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:19:16,641 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:19:16,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353880319] [2025-03-08 10:19:16,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353880319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:19:16,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:19:16,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 10:19:16,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78196401] [2025-03-08 10:19:16,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:19:16,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:19:16,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:19:16,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:19:16,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:19:16,644 INFO L87 Difference]: Start difference. First operand 67 states and 103 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 10:19:16,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:19:16,764 INFO L93 Difference]: Finished difference Result 193 states and 299 transitions. [2025-03-08 10:19:16,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:19:16,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 150 [2025-03-08 10:19:16,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:19:16,767 INFO L225 Difference]: With dead ends: 193 [2025-03-08 10:19:16,767 INFO L226 Difference]: Without dead ends: 129 [2025-03-08 10:19:16,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 148 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-08 10:19:16,768 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 23 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:19:16,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 193 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:19:16,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-08 10:19:16,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2025-03-08 10:19:16,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 74 states have internal predecessors, (97), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 10:19:16,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 193 transitions. [2025-03-08 10:19:16,787 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 193 transitions. Word has length 150 [2025-03-08 10:19:16,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:19:16,787 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 193 transitions. [2025-03-08 10:19:16,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 10:19:16,787 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 193 transitions. [2025-03-08 10:19:16,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 10:19:16,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:19:16,789 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:19:16,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 10:19:16,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:19:16,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:19:16,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:19:16,990 INFO L85 PathProgramCache]: Analyzing trace with hash 216812588, now seen corresponding path program 1 times [2025-03-08 10:19:16,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:19:16,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772648215] [2025-03-08 10:19:16,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:19:16,991 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:19:16,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:19:16,993 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:19:16,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 10:19:17,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 10:19:17,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 10:19:17,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:19:17,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:19:17,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 10:19:17,266 INFO L279 TraceCheckSpWp]: Computing forward predicates...