./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-42.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-42.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 8f23a76680a88b4e3582239a1d89eab7ec3ee1b0bc583f7f275d3fe6394371a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:13:00,532 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:13:00,588 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:13:00,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:13:00,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:13:00,612 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:13:00,613 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:13:00,613 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:13:00,614 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:13:00,614 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:13:00,614 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:13:00,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:13:00,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:13:00,615 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:13:00,615 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:13:00,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:13:00,615 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:13:00,615 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:13:00,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:13:00,615 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:13:00,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:13:00,616 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:13:00,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:13:00,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:13:00,616 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:13:00,616 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:13:00,616 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:13:00,616 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:13:00,617 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:13:00,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:13:00,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:13:00,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:13:00,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:13:00,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:13:00,617 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:13:00,618 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:13:00,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:13:00,618 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:13:00,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:13:00,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:13:00,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:13:00,618 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:13:00,618 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:13:00,618 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 -> 8f23a76680a88b4e3582239a1d89eab7ec3ee1b0bc583f7f275d3fe6394371a3 [2025-03-08 10:13:00,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:13:00,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:13:00,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:13:00,854 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:13:00,854 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:13:00,856 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-42.i [2025-03-08 10:13:02,016 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ea29dd45/d1db75b63bb84b0e941b6e2953e76c2a/FLAG8b1218c48 [2025-03-08 10:13:02,281 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:13:02,282 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-42.i [2025-03-08 10:13:02,293 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ea29dd45/d1db75b63bb84b0e941b6e2953e76c2a/FLAG8b1218c48 [2025-03-08 10:13:02,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ea29dd45/d1db75b63bb84b0e941b6e2953e76c2a [2025-03-08 10:13:02,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:13:02,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:13:02,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:13:02,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:13:02,602 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:13:02,602 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:13:02" (1/1) ... [2025-03-08 10:13:02,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22e18117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:02, skipping insertion in model container [2025-03-08 10:13:02,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:13:02" (1/1) ... [2025-03-08 10:13:02,615 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:13:02,713 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-42.i[917,930] [2025-03-08 10:13:02,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:13:02,758 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:13:02,765 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-42.i[917,930] [2025-03-08 10:13:02,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:13:02,795 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:13:02,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:02 WrapperNode [2025-03-08 10:13:02,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:13:02,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:13:02,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:13:02,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:13:02,800 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:13:02" (1/1) ... [2025-03-08 10:13:02,806 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:13:02" (1/1) ... [2025-03-08 10:13:02,834 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2025-03-08 10:13:02,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:13:02,835 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:13:02,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:13:02,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:13:02,841 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:02" (1/1) ... [2025-03-08 10:13:02,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:02" (1/1) ... [2025-03-08 10:13:02,843 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:02" (1/1) ... [2025-03-08 10:13:02,857 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:13:02,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:02" (1/1) ... [2025-03-08 10:13:02,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:02" (1/1) ... [2025-03-08 10:13:02,865 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:02" (1/1) ... [2025-03-08 10:13:02,870 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:02" (1/1) ... [2025-03-08 10:13:02,871 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:02" (1/1) ... [2025-03-08 10:13:02,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:02" (1/1) ... [2025-03-08 10:13:02,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:13:02,878 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:13:02,878 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:13:02,878 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:13:02,879 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:02" (1/1) ... [2025-03-08 10:13:02,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:13:02,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:13:02,903 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:13:02,906 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:13:02,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:13:02,922 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:13:02,922 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:13:02,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:13:02,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:13:02,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:13:02,978 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:13:02,980 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:13:03,223 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-08 10:13:03,223 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:13:03,232 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:13:03,233 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:13:03,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:13:03 BoogieIcfgContainer [2025-03-08 10:13:03,233 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:13:03,239 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:13:03,239 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:13:03,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:13:03,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:13:02" (1/3) ... [2025-03-08 10:13:03,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c39f983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:13:03, skipping insertion in model container [2025-03-08 10:13:03,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:02" (2/3) ... [2025-03-08 10:13:03,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c39f983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:13:03, skipping insertion in model container [2025-03-08 10:13:03,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:13:03" (3/3) ... [2025-03-08 10:13:03,244 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-42.i [2025-03-08 10:13:03,255 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:13:03,257 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-42.i that has 2 procedures, 69 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:13:03,306 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:13:03,317 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;@72bb9277, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:13:03,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:13:03,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 10:13:03,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 10:13:03,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:13:03,332 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:13:03,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:13:03,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:13:03,337 INFO L85 PathProgramCache]: Analyzing trace with hash 408543392, now seen corresponding path program 1 times [2025-03-08 10:13:03,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:13:03,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063713143] [2025-03-08 10:13:03,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:13:03,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:13:03,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 10:13:03,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 10:13:03,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:13:03,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:13:03,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-08 10:13:03,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:13:03,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063713143] [2025-03-08 10:13:03,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063713143] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:13:03,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797165280] [2025-03-08 10:13:03,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:13:03,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:13:03,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:13:03,606 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:13:03,608 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:13:03,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 10:13:03,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 10:13:03,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:13:03,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:13:03,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:13:03,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:13:03,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-08 10:13:03,784 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:13:03,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797165280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:13:03,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:13:03,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:13:03,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420555133] [2025-03-08 10:13:03,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:13:03,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:13:03,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:13:03,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:13:03,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:13:03,805 INFO L87 Difference]: Start difference. First operand has 69 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 10:13:03,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:13:03,828 INFO L93 Difference]: Finished difference Result 132 states and 226 transitions. [2025-03-08 10:13:03,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:13:03,829 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 148 [2025-03-08 10:13:03,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:13:03,836 INFO L225 Difference]: With dead ends: 132 [2025-03-08 10:13:03,836 INFO L226 Difference]: Without dead ends: 66 [2025-03-08 10:13:03,839 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:13:03,840 INFO L435 NwaCegarLoop]: 99 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, 99 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:13:03,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:13:03,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-08 10:13:03,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-08 10:13:03,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 10:13:03,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 99 transitions. [2025-03-08 10:13:03,875 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 99 transitions. Word has length 148 [2025-03-08 10:13:03,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:13:03,875 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 99 transitions. [2025-03-08 10:13:03,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 10:13:03,875 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 99 transitions. [2025-03-08 10:13:03,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 10:13:03,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:13:03,877 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:13:03,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 10:13:04,078 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:13:04,079 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:13:04,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:13:04,080 INFO L85 PathProgramCache]: Analyzing trace with hash -2138425215, now seen corresponding path program 1 times [2025-03-08 10:13:04,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:13:04,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161516179] [2025-03-08 10:13:04,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:13:04,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:13:04,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 10:13:04,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 10:13:04,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:13:04,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:13:04,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 10:13:04,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:13:04,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161516179] [2025-03-08 10:13:04,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161516179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:13:04,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:13:04,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:13:04,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287521730] [2025-03-08 10:13:04,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:13:04,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:13:04,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:13:04,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:13:04,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:13:04,600 INFO L87 Difference]: Start difference. First operand 66 states and 99 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 10:13:04,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:13:04,648 INFO L93 Difference]: Finished difference Result 149 states and 223 transitions. [2025-03-08 10:13:04,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:13:04,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 148 [2025-03-08 10:13:04,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:13:04,650 INFO L225 Difference]: With dead ends: 149 [2025-03-08 10:13:04,651 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 10:13:04,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:13:04,652 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 22 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:13:04,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 205 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:13:04,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 10:13:04,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2025-03-08 10:13:04,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 10:13:04,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 111 transitions. [2025-03-08 10:13:04,667 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 111 transitions. Word has length 148 [2025-03-08 10:13:04,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:13:04,668 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 111 transitions. [2025-03-08 10:13:04,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 10:13:04,668 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 111 transitions. [2025-03-08 10:13:04,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 10:13:04,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:13:04,672 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:13:04,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:13:04,672 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:13:04,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:13:04,673 INFO L85 PathProgramCache]: Analyzing trace with hash -98065627, now seen corresponding path program 1 times [2025-03-08 10:13:04,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:13:04,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435834517] [2025-03-08 10:13:04,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:13:04,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:13:04,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 10:13:04,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 10:13:04,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:13:04,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 10:13:04,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [698750115] [2025-03-08 10:13:04,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:13:04,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:13:04,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:13:04,774 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:13:04,782 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:13:04,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 10:13:05,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 10:13:05,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:13:05,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:13:05,075 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 10:13:05,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 10:13:05,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 10:13:05,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:13:05,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:13:05,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 10:13:05,181 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 10:13:05,182 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 10:13:05,189 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:13:05,383 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:13:05,386 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 10:13:05,449 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 10:13:05,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:13:05 BoogieIcfgContainer [2025-03-08 10:13:05,451 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 10:13:05,452 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 10:13:05,452 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 10:13:05,452 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 10:13:05,452 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:13:03" (3/4) ... [2025-03-08 10:13:05,454 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 10:13:05,454 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 10:13:05,455 INFO L158 Benchmark]: Toolchain (without parser) took 2857.54ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 77.8MB in the end (delta: 28.6MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2025-03-08 10:13:05,456 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:13:05,458 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.18ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 92.4MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:13:05,459 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.26ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 88.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:13:05,459 INFO L158 Benchmark]: Boogie Preprocessor took 39.73ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 84.9MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:13:05,459 INFO L158 Benchmark]: IcfgBuilder took 355.39ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 63.4MB in the end (delta: 21.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 10:13:05,460 INFO L158 Benchmark]: TraceAbstraction took 2212.60ms. Allocated memory is still 142.6MB. Free memory was 63.4MB in the beginning and 77.8MB in the end (delta: -14.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:13:05,460 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 142.6MB. Free memory was 77.8MB in the beginning and 77.8MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:13:05,461 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.23ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.18ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 92.4MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.26ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 88.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.73ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 84.9MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 355.39ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 63.4MB in the end (delta: 21.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2212.60ms. Allocated memory is still 142.6MB. Free memory was 63.4MB in the beginning and 77.8MB in the end (delta: -14.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 142.6MB. Free memory was 77.8MB in the beginning and 77.8MB 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 someBinaryFLOATComparisonOperation at line 56, overapproximation of someBinaryFLOATComparisonOperation at line 138, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 125, overapproximation of someBinaryFLOATComparisonOperation at line 127, overapproximation of someUnaryDOUBLEoperation at line 35, overapproximation of someBinaryArithmeticFLOAToperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] unsigned char var_1_2 = 0; [L24] signed short int var_1_3 = -200; [L25] signed short int var_1_4 = 2; [L26] signed char var_1_5 = -8; [L27] unsigned char var_1_6 = 10; [L28] unsigned char var_1_7 = 128; [L29] unsigned char var_1_8 = 1; [L30] float var_1_9 = 9999999999.5; [L31] unsigned char var_1_10 = 1; [L32] unsigned char var_1_11 = 0; [L33] unsigned char var_1_12 = 0; [L34] signed short int var_1_13 = 200; [L35] float var_1_14 = -0.8; [L36] float var_1_15 = 127.25; [L37] float var_1_16 = 3.5; [L38] unsigned short int var_1_17 = 16; [L39] unsigned short int var_1_18 = 100; [L40] unsigned char var_1_19 = 1; [L41] unsigned char var_1_20 = 0; VAL [isInitial=0, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=0, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L142] isInitial = 1 [L143] FCALL initially() [L144] COND TRUE 1 [L145] FCALL updateLastVariables() [L146] CALL updateVariables() [L98] var_1_2 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L99] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L100] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L100] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L101] var_1_3 = __VERIFIER_nondet_short() [L102] CALL assume_abort_if_not(var_1_3 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L102] RET assume_abort_if_not(var_1_3 >= -32767) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L103] CALL assume_abort_if_not(var_1_3 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L103] RET assume_abort_if_not(var_1_3 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L104] var_1_4 = __VERIFIER_nondet_short() [L105] CALL assume_abort_if_not(var_1_4 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L105] RET assume_abort_if_not(var_1_4 >= -32767) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L106] CALL assume_abort_if_not(var_1_4 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L106] RET assume_abort_if_not(var_1_4 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L107] var_1_5 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L108] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L109] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L109] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L110] var_1_7 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1, var_1_9=19999999999/2] [L111] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1, var_1_9=19999999999/2] [L112] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1, var_1_9=19999999999/2] [L112] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1, var_1_9=19999999999/2] [L113] var_1_9 = __VERIFIER_nondet_float() [L114] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L114] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L115] var_1_10 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L116] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L117] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L117] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L118] var_1_11 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L119] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L120] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L120] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L121] var_1_12 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L122] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L123] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L123] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L124] var_1_15 = __VERIFIER_nondet_float() [L125] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L125] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L126] var_1_16 = __VERIFIER_nondet_float() [L127] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L127] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L128] var_1_18 = __VERIFIER_nondet_ushort() [L129] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L129] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L130] CALL assume_abort_if_not(var_1_18 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=101, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=101, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L130] RET assume_abort_if_not(var_1_18 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=101, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L131] var_1_20 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=101, var_1_19=1, var_1_1=16, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=101, var_1_19=1, var_1_1=16, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L132] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=101, var_1_19=1, var_1_1=16, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L133] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=101, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=101, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L133] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=101, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L146] RET updateVariables() [L147] CALL step() [L45] signed short int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=127, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=101, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L46] COND TRUE \read(var_1_2) [L47] var_1_1 = ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))) VAL [isInitial=1, stepLocal_0=127, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=101, var_1_19=1, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=639, var_1_8=1] [L53] COND TRUE var_1_5 >= -2 [L54] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, stepLocal_0=127, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=101, var_1_19=1, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=639, var_1_8=1] [L56] unsigned char stepLocal_2 = 49.5f <= var_1_9; [L57] signed short int stepLocal_1 = var_1_1; VAL [isInitial=1, stepLocal_0=127, stepLocal_1=3557, stepLocal_2=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=101, var_1_19=1, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=639, var_1_8=1] [L58] COND FALSE !(stepLocal_2 && (var_1_2 && var_1_10)) [L65] var_1_8 = var_1_12 VAL [isInitial=1, stepLocal_0=127, stepLocal_1=3557, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=101, var_1_19=1, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=639, var_1_8=0] [L67] unsigned char stepLocal_4 = var_1_6; [L68] signed long int stepLocal_3 = (((((((var_1_3) > (var_1_6)) ? (var_1_3) : (var_1_6)))) > (var_1_5)) ? (((((var_1_3) > (var_1_6)) ? (var_1_3) : (var_1_6)))) : (var_1_5)); VAL [isInitial=1, stepLocal_0=127, stepLocal_1=3557, stepLocal_3=127, stepLocal_4=27, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=101, var_1_19=1, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=639, var_1_8=0] [L69] COND FALSE !(stepLocal_4 >= (var_1_1 / var_1_7)) [L76] var_1_13 = var_1_3 VAL [isInitial=1, stepLocal_0=127, stepLocal_1=3557, stepLocal_3=127, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=127, var_1_17=16, var_1_18=101, var_1_19=1, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=639, var_1_8=0] [L78] unsigned char stepLocal_6 = var_1_2; [L79] signed short int stepLocal_5 = var_1_13; VAL [isInitial=1, stepLocal_0=127, stepLocal_1=3557, stepLocal_3=127, stepLocal_5=127, stepLocal_6=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=127, var_1_17=16, var_1_18=101, var_1_19=1, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=639, var_1_8=0] [L80] COND TRUE (((((var_1_13) < (8)) ? (var_1_13) : (8))) <= var_1_5) || stepLocal_6 VAL [isInitial=1, stepLocal_0=127, stepLocal_1=3557, stepLocal_3=127, stepLocal_5=127, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=127, var_1_17=16, var_1_18=101, var_1_19=1, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=639, var_1_8=0] [L81] COND TRUE stepLocal_5 <= var_1_3 [L82] var_1_14 = (var_1_15 + var_1_16) VAL [isInitial=1, stepLocal_0=127, stepLocal_1=3557, stepLocal_3=127, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=127, var_1_17=16, var_1_18=101, var_1_19=1, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=639, var_1_8=0] [L89] signed short int stepLocal_7 = var_1_3; VAL [isInitial=1, stepLocal_0=127, stepLocal_1=3557, stepLocal_3=127, stepLocal_7=127, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=127, var_1_17=16, var_1_18=101, var_1_19=1, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=639, var_1_8=0] [L90] COND TRUE var_1_4 > stepLocal_7 [L91] var_1_17 = ((((25) > ((var_1_6 + var_1_18))) ? (25) : ((var_1_6 + var_1_18)))) VAL [isInitial=1, stepLocal_0=127, stepLocal_1=3557, stepLocal_3=127, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=127, var_1_17=128, var_1_18=101, var_1_19=1, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=639, var_1_8=0] [L93] COND TRUE var_1_9 <= var_1_15 [L94] var_1_19 = (var_1_12 || var_1_20) VAL [isInitial=1, stepLocal_0=127, stepLocal_1=3557, stepLocal_3=127, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=127, var_1_17=128, var_1_18=101, var_1_19=0, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=639, var_1_8=0] [L147] RET step() [L148] CALL, EXPR property() [L138-L139] return ((((((var_1_2 ? (var_1_1 == ((signed short int) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_3) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_9) && (var_1_2 && var_1_10)) ? ((var_1_1 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_2 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((var_1_6 >= (var_1_1 / var_1_7)) ? ((var_1_1 != ((((((((var_1_3) > (var_1_6)) ? (var_1_3) : (var_1_6)))) > (var_1_5)) ? (((((var_1_3) > (var_1_6)) ? (var_1_3) : (var_1_6)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) var_1_6))) : (var_1_13 == ((signed short int) var_1_3)))) && (((((((var_1_13) < (8)) ? (var_1_13) : (8))) <= var_1_5) || var_1_2) ? ((var_1_13 <= var_1_3) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_4 > var_1_3) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_6 + var_1_18))) ? (25) : ((var_1_6 + var_1_18)))))) : 1)) && ((var_1_9 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=127, var_1_17=128, var_1_18=101, var_1_19=0, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=639, var_1_8=0] [L148] RET, EXPR property() [L148] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=127, var_1_17=128, var_1_18=101, var_1_19=0, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=639, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=127, var_1_17=128, var_1_18=101, var_1_19=0, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=127, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=639, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 127 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 304 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 110 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 194 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=2, InterpolantAutomatonStates: 6, 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, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 742 NumberOfCodeBlocks, 742 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 441 ConstructedInterpolants, 0 QuantifiedInterpolants, 482 SizeOfPredicates, 0 NumberOfNonLiveVariables, 340 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2992/3036 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:13:05,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-42.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 8f23a76680a88b4e3582239a1d89eab7ec3ee1b0bc583f7f275d3fe6394371a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:13:07,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:13:07,353 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 10:13:07,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:13:07,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:13:07,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:13:07,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:13:07,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:13:07,385 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:13:07,385 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:13:07,385 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:13:07,385 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:13:07,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:13:07,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:13:07,385 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:13:07,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:13:07,386 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:13:07,386 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:13:07,386 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:13:07,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:13:07,386 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:13:07,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:13:07,386 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:13:07,386 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 10:13:07,386 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 10:13:07,386 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 10:13:07,386 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:13:07,388 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:13:07,388 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:13:07,388 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:13:07,389 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:13:07,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:13:07,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:13:07,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:13:07,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:13:07,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:13:07,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:13:07,389 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:13:07,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:13:07,389 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 10:13:07,389 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 10:13:07,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:13:07,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:13:07,389 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:13:07,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:13:07,389 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 -> 8f23a76680a88b4e3582239a1d89eab7ec3ee1b0bc583f7f275d3fe6394371a3 [2025-03-08 10:13:07,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:13:07,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:13:07,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:13:07,621 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:13:07,622 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:13:07,622 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-42.i [2025-03-08 10:13:08,748 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c9f33d1e/9a12e90b82e14abbab6ae8adcf851d43/FLAG032ad2987 [2025-03-08 10:13:08,909 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:13:08,909 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-42.i [2025-03-08 10:13:08,915 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c9f33d1e/9a12e90b82e14abbab6ae8adcf851d43/FLAG032ad2987 [2025-03-08 10:13:08,925 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c9f33d1e/9a12e90b82e14abbab6ae8adcf851d43 [2025-03-08 10:13:08,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:13:08,929 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:13:08,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:13:08,930 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:13:08,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:13:08,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:13:08" (1/1) ... [2025-03-08 10:13:08,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64ec69af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:08, skipping insertion in model container [2025-03-08 10:13:08,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:13:08" (1/1) ... [2025-03-08 10:13:08,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:13:09,051 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-42.i[917,930] [2025-03-08 10:13:09,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:13:09,126 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:13:09,135 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-42.i[917,930] [2025-03-08 10:13:09,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:13:09,192 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:13:09,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:09 WrapperNode [2025-03-08 10:13:09,194 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:13:09,195 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:13:09,195 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:13:09,195 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:13:09,201 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:13:09" (1/1) ... [2025-03-08 10:13:09,213 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:13:09" (1/1) ... [2025-03-08 10:13:09,241 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2025-03-08 10:13:09,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:13:09,247 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:13:09,247 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:13:09,247 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:13:09,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:09" (1/1) ... [2025-03-08 10:13:09,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:09" (1/1) ... [2025-03-08 10:13:09,256 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:09" (1/1) ... [2025-03-08 10:13:09,270 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:13:09,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:09" (1/1) ... [2025-03-08 10:13:09,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:09" (1/1) ... [2025-03-08 10:13:09,279 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:09" (1/1) ... [2025-03-08 10:13:09,286 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:09" (1/1) ... [2025-03-08 10:13:09,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:09" (1/1) ... [2025-03-08 10:13:09,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:09" (1/1) ... [2025-03-08 10:13:09,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:13:09,296 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:13:09,296 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:13:09,296 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:13:09,297 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:09" (1/1) ... [2025-03-08 10:13:09,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:13:09,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:13:09,325 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:13:09,328 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:13:09,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:13:09,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 10:13:09,345 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:13:09,345 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:13:09,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:13:09,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:13:09,400 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:13:09,402 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:13:09,760 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-08 10:13:09,762 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:13:09,768 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:13:09,769 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:13:09,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:13:09 BoogieIcfgContainer [2025-03-08 10:13:09,769 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:13:09,771 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:13:09,771 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:13:09,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:13:09,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:13:08" (1/3) ... [2025-03-08 10:13:09,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a3155e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:13:09, skipping insertion in model container [2025-03-08 10:13:09,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:09" (2/3) ... [2025-03-08 10:13:09,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a3155e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:13:09, skipping insertion in model container [2025-03-08 10:13:09,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:13:09" (3/3) ... [2025-03-08 10:13:09,778 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-42.i [2025-03-08 10:13:09,787 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:13:09,788 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-42.i that has 2 procedures, 69 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:13:09,826 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:13:09,835 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;@6406e110, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:13:09,836 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:13:09,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 10:13:09,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 10:13:09,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:13:09,850 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:13:09,850 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:13:09,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:13:09,855 INFO L85 PathProgramCache]: Analyzing trace with hash 408543392, now seen corresponding path program 1 times [2025-03-08 10:13:09,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:13:09,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644574302] [2025-03-08 10:13:09,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:13:09,864 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:13:09,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:13:09,866 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:13:09,868 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:13:09,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 10:13:10,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 10:13:10,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:13:10,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:13:10,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:13:10,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:13:10,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2025-03-08 10:13:10,124 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:13:10,125 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:13:10,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644574302] [2025-03-08 10:13:10,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644574302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:13:10,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:13:10,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 10:13:10,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936593375] [2025-03-08 10:13:10,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:13:10,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:13:10,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:13:10,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:13:10,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:13:10,145 INFO L87 Difference]: Start difference. First operand has 69 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 10:13:10,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:13:10,165 INFO L93 Difference]: Finished difference Result 132 states and 226 transitions. [2025-03-08 10:13:10,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:13:10,166 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 148 [2025-03-08 10:13:10,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:13:10,170 INFO L225 Difference]: With dead ends: 132 [2025-03-08 10:13:10,170 INFO L226 Difference]: Without dead ends: 66 [2025-03-08 10:13:10,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 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:13:10,175 INFO L435 NwaCegarLoop]: 99 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, 99 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:13:10,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:13:10,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-08 10:13:10,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-08 10:13:10,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 10:13:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 99 transitions. [2025-03-08 10:13:10,205 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 99 transitions. Word has length 148 [2025-03-08 10:13:10,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:13:10,206 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 99 transitions. [2025-03-08 10:13:10,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 10:13:10,207 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 99 transitions. [2025-03-08 10:13:10,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 10:13:10,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:13:10,210 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:13:10,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 10:13:10,410 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:13:10,411 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:13:10,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:13:10,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2138425215, now seen corresponding path program 1 times [2025-03-08 10:13:10,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:13:10,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193438886] [2025-03-08 10:13:10,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:13:10,412 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:13:10,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:13:10,415 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:13:10,416 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:13:10,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 10:13:10,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 10:13:10,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:13:10,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:13:10,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 10:13:10,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:13:10,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 108 proven. 63 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2025-03-08 10:13:10,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:13:11,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 10:13:11,014 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:13:11,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193438886] [2025-03-08 10:13:11,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193438886] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 10:13:11,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:13:11,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-08 10:13:11,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065723132] [2025-03-08 10:13:11,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:13:11,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:13:11,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:13:11,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:13:11,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:13:11,020 INFO L87 Difference]: Start difference. First operand 66 states and 99 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 10:13:11,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:13:11,338 INFO L93 Difference]: Finished difference Result 149 states and 223 transitions. [2025-03-08 10:13:11,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:13:11,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 148 [2025-03-08 10:13:11,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:13:11,342 INFO L225 Difference]: With dead ends: 149 [2025-03-08 10:13:11,342 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 10:13:11,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:13:11,343 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 23 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:13:11,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 275 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:13:11,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 10:13:11,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2025-03-08 10:13:11,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 10:13:11,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 111 transitions. [2025-03-08 10:13:11,361 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 111 transitions. Word has length 148 [2025-03-08 10:13:11,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:13:11,364 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 111 transitions. [2025-03-08 10:13:11,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 10:13:11,365 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 111 transitions. [2025-03-08 10:13:11,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 10:13:11,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:13:11,366 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:13:11,373 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:13:11,566 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:13:11,567 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:13:11,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:13:11,567 INFO L85 PathProgramCache]: Analyzing trace with hash -98065627, now seen corresponding path program 1 times [2025-03-08 10:13:11,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:13:11,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343143936] [2025-03-08 10:13:11,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:13:11,568 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:13:11,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:13:11,570 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:13:11,571 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:13:11,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 10:13:11,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 10:13:11,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:13:11,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:13:11,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 10:13:11,741 INFO L279 TraceCheckSpWp]: Computing forward predicates...