./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-1.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-1.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 34e373e2d0377a96da4417e64272a03c4d11bcbb2fc79dad14cabbe84b3959dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:08:46,726 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:08:46,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:08:46,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:08:46,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:08:46,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:08:46,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:08:46,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:08:46,808 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:08:46,808 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:08:46,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:08:46,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:08:46,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:08:46,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:08:46,809 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:08:46,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:08:46,810 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:08:46,810 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:08:46,810 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:08:46,810 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:08:46,810 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:08:46,810 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:08:46,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:08:46,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:08:46,810 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:08:46,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:08:46,810 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:08:46,810 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:08:46,810 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:08:46,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:08:46,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:08:46,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:08:46,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:08:46,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:08:46,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:08:46,811 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:08:46,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:08:46,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:08:46,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:08:46,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:08:46,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:08:46,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:08:46,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:08:46,811 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 -> 34e373e2d0377a96da4417e64272a03c4d11bcbb2fc79dad14cabbe84b3959dd [2025-03-08 10:08:47,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:08:47,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:08:47,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:08:47,050 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:08:47,050 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:08:47,051 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-1.i [2025-03-08 10:08:48,241 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1e29546e/2b4b1656560c43f7b942792f57a0b9f0/FLAGeed2df31a [2025-03-08 10:08:48,484 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:08:48,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-1.i [2025-03-08 10:08:48,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1e29546e/2b4b1656560c43f7b942792f57a0b9f0/FLAGeed2df31a [2025-03-08 10:08:48,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1e29546e/2b4b1656560c43f7b942792f57a0b9f0 [2025-03-08 10:08:48,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:08:48,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:08:48,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:08:48,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:08:48,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:08:48,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:08:48" (1/1) ... [2025-03-08 10:08:48,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@476cee48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:48, skipping insertion in model container [2025-03-08 10:08:48,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:08:48" (1/1) ... [2025-03-08 10:08:48,554 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:08:48,661 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-1.i[916,929] [2025-03-08 10:08:48,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:08:48,705 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:08:48,712 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-1.i[916,929] [2025-03-08 10:08:48,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:08:48,750 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:08:48,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:48 WrapperNode [2025-03-08 10:08:48,750 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:08:48,751 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:08:48,751 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:08:48,751 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:08:48,759 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:08:48" (1/1) ... [2025-03-08 10:08:48,764 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:08:48" (1/1) ... [2025-03-08 10:08:48,785 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2025-03-08 10:08:48,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:08:48,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:08:48,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:08:48,788 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:08:48,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:48" (1/1) ... [2025-03-08 10:08:48,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:48" (1/1) ... [2025-03-08 10:08:48,795 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:48" (1/1) ... [2025-03-08 10:08:48,802 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:08:48,803 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:48" (1/1) ... [2025-03-08 10:08:48,803 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:48" (1/1) ... [2025-03-08 10:08:48,806 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:48" (1/1) ... [2025-03-08 10:08:48,807 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:48" (1/1) ... [2025-03-08 10:08:48,808 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:48" (1/1) ... [2025-03-08 10:08:48,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:48" (1/1) ... [2025-03-08 10:08:48,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:08:48,811 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:08:48,811 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:08:48,811 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:08:48,812 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:48" (1/1) ... [2025-03-08 10:08:48,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:08:48,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:08:48,842 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:08:48,844 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:08:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:08:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:08:48,860 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:08:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:08:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:08:48,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:08:48,922 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:08:48,923 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:08:49,169 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 10:08:49,169 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:08:49,175 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:08:49,176 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:08:49,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:08:49 BoogieIcfgContainer [2025-03-08 10:08:49,176 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:08:49,178 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:08:49,178 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:08:49,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:08:49,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:08:48" (1/3) ... [2025-03-08 10:08:49,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52127b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:08:49, skipping insertion in model container [2025-03-08 10:08:49,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:48" (2/3) ... [2025-03-08 10:08:49,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52127b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:08:49, skipping insertion in model container [2025-03-08 10:08:49,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:08:49" (3/3) ... [2025-03-08 10:08:49,183 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-1.i [2025-03-08 10:08:49,192 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:08:49,193 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-1.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:08:49,243 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:08:49,250 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;@7891f7c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:08:49,250 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:08:49,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 50 states have internal predecessors, (63), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 10:08:49,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 10:08:49,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:08:49,266 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:49,266 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:08:49,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:08:49,271 INFO L85 PathProgramCache]: Analyzing trace with hash 423152270, now seen corresponding path program 1 times [2025-03-08 10:08:49,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:08:49,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638776566] [2025-03-08 10:08:49,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:08:49,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:08:49,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 10:08:49,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 10:08:49,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:08:49,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:08:49,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2025-03-08 10:08:49,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:08:49,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638776566] [2025-03-08 10:08:49,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638776566] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:08:49,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320484433] [2025-03-08 10:08:49,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:08:49,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:08:49,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:08:49,531 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:08:49,532 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:08:49,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 10:08:49,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 10:08:49,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:08:49,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:08:49,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:08:49,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:08:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2025-03-08 10:08:49,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:08:49,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320484433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:08:49,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:08:49,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:08:49,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384890835] [2025-03-08 10:08:49,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:08:49,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:08:49,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:08:49,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:08:49,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:08:49,764 INFO L87 Difference]: Start difference. First operand has 87 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 50 states have internal predecessors, (63), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 10:08:49,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:08:49,788 INFO L93 Difference]: Finished difference Result 168 states and 296 transitions. [2025-03-08 10:08:49,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:08:49,789 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 214 [2025-03-08 10:08:49,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:08:49,793 INFO L225 Difference]: With dead ends: 168 [2025-03-08 10:08:49,793 INFO L226 Difference]: Without dead ends: 84 [2025-03-08 10:08:49,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 215 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:08:49,797 INFO L435 NwaCegarLoop]: 128 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, 128 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:08:49,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:08:49,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-08 10:08:49,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-08 10:08:49,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 10:08:49,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 128 transitions. [2025-03-08 10:08:49,826 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 128 transitions. Word has length 214 [2025-03-08 10:08:49,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:08:49,827 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 128 transitions. [2025-03-08 10:08:49,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 10:08:49,828 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 128 transitions. [2025-03-08 10:08:49,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 10:08:49,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:08:49,832 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:49,839 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:08:50,033 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:08:50,034 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:08:50,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:08:50,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1840330001, now seen corresponding path program 1 times [2025-03-08 10:08:50,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:08:50,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395525240] [2025-03-08 10:08:50,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:08:50,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:08:50,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 10:08:50,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 10:08:50,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:08:50,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:08:50,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 10:08:50,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:08:50,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395525240] [2025-03-08 10:08:50,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395525240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:08:50,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:08:50,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:08:50,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804300402] [2025-03-08 10:08:50,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:08:50,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:08:50,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:08:50,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:08:50,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:08:50,261 INFO L87 Difference]: Start difference. First operand 84 states and 128 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 10:08:50,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:08:50,308 INFO L93 Difference]: Finished difference Result 204 states and 307 transitions. [2025-03-08 10:08:50,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:08:50,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 214 [2025-03-08 10:08:50,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:08:50,313 INFO L225 Difference]: With dead ends: 204 [2025-03-08 10:08:50,313 INFO L226 Difference]: Without dead ends: 123 [2025-03-08 10:08:50,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:08:50,315 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 55 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:08:50,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 240 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:08:50,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-08 10:08:50,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2025-03-08 10:08:50,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 69 states have internal predecessors, (81), 49 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-08 10:08:50,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 179 transitions. [2025-03-08 10:08:50,336 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 179 transitions. Word has length 214 [2025-03-08 10:08:50,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:08:50,337 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 179 transitions. [2025-03-08 10:08:50,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 10:08:50,337 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions. [2025-03-08 10:08:50,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 10:08:50,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:08:50,344 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:50,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:08:50,344 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:08:50,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:08:50,344 INFO L85 PathProgramCache]: Analyzing trace with hash -2073544651, now seen corresponding path program 1 times [2025-03-08 10:08:50,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:08:50,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739129655] [2025-03-08 10:08:50,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:08:50,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:08:50,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 10:08:50,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 10:08:50,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:08:50,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:08:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 102 proven. 96 refuted. 0 times theorem prover too weak. 2182 trivial. 0 not checked. [2025-03-08 10:08:50,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:08:50,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739129655] [2025-03-08 10:08:50,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739129655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:08:50,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488859146] [2025-03-08 10:08:50,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:08:50,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:08:50,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:08:50,947 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:08:50,948 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:08:51,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 10:08:51,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 10:08:51,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:08:51,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:08:51,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 10:08:51,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:08:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1572 proven. 96 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2025-03-08 10:08:51,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:08:51,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 102 proven. 99 refuted. 0 times theorem prover too weak. 2179 trivial. 0 not checked. [2025-03-08 10:08:51,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488859146] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:08:51,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:08:51,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 18 [2025-03-08 10:08:51,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821026063] [2025-03-08 10:08:51,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:08:51,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 10:08:51,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:08:51,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 10:08:51,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-03-08 10:08:51,826 INFO L87 Difference]: Start difference. First operand 120 states and 179 transitions. Second operand has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 6 states have call successors, (83), 3 states have call predecessors, (83), 7 states have return successors, (84), 6 states have call predecessors, (84), 6 states have call successors, (84) [2025-03-08 10:08:52,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:08:52,192 INFO L93 Difference]: Finished difference Result 259 states and 373 transitions. [2025-03-08 10:08:52,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 10:08:52,194 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 6 states have call successors, (83), 3 states have call predecessors, (83), 7 states have return successors, (84), 6 states have call predecessors, (84), 6 states have call successors, (84) Word has length 215 [2025-03-08 10:08:52,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:08:52,197 INFO L225 Difference]: With dead ends: 259 [2025-03-08 10:08:52,197 INFO L226 Difference]: Without dead ends: 142 [2025-03-08 10:08:52,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2025-03-08 10:08:52,201 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 89 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:08:52,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 295 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:08:52,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-08 10:08:52,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 136. [2025-03-08 10:08:52,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 80 states have (on average 1.15) internal successors, (92), 81 states have internal predecessors, (92), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-08 10:08:52,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 190 transitions. [2025-03-08 10:08:52,223 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 190 transitions. Word has length 215 [2025-03-08 10:08:52,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:08:52,224 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 190 transitions. [2025-03-08 10:08:52,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 6 states have call successors, (83), 3 states have call predecessors, (83), 7 states have return successors, (84), 6 states have call predecessors, (84), 6 states have call successors, (84) [2025-03-08 10:08:52,224 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 190 transitions. [2025-03-08 10:08:52,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 10:08:52,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:08:52,228 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:52,236 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:08:52,433 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:08:52,433 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:08:52,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:08:52,434 INFO L85 PathProgramCache]: Analyzing trace with hash 778563380, now seen corresponding path program 1 times [2025-03-08 10:08:52,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:08:52,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228590134] [2025-03-08 10:08:52,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:08:52,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:08:52,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 10:08:52,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 10:08:52,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:08:52,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 10:08:52,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [522805052] [2025-03-08 10:08:52,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:08:52,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:08:52,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:08:52,588 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:08:52,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 10:08:52,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 10:08:52,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 10:08:52,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:08:52,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:08:52,691 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 10:08:52,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 10:08:52,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 10:08:52,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:08:52,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:08:52,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 10:08:52,829 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 10:08:52,830 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 10:08:52,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 10:08:53,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:08:53,038 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 10:08:53,146 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 10:08:53,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:08:53 BoogieIcfgContainer [2025-03-08 10:08:53,149 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 10:08:53,150 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 10:08:53,150 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 10:08:53,150 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 10:08:53,151 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:08:49" (3/4) ... [2025-03-08 10:08:53,152 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 10:08:53,152 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 10:08:53,153 INFO L158 Benchmark]: Toolchain (without parser) took 4620.77ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 124.2MB in the beginning and 273.6MB in the end (delta: -149.4MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. [2025-03-08 10:08:53,154 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:08:53,154 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.68ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 109.7MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:08:53,154 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.05ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 107.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:08:53,155 INFO L158 Benchmark]: Boogie Preprocessor took 22.80ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 104.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:08:53,155 INFO L158 Benchmark]: IcfgBuilder took 365.38ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 83.4MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 10:08:53,155 INFO L158 Benchmark]: TraceAbstraction took 3971.33ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 82.8MB in the beginning and 273.6MB in the end (delta: -190.9MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2025-03-08 10:08:53,156 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 369.1MB. Free memory was 273.6MB in the beginning and 273.6MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:08:53,157 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.17ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.68ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 109.7MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.05ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 107.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.80ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 104.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 365.38ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 83.4MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3971.33ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 82.8MB in the beginning and 273.6MB in the end (delta: -190.9MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 369.1MB. Free memory was 273.6MB in the beginning and 273.6MB in the end (delta: 33.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 126, overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryFLOATComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryArithmeticFLOAToperation at line 68. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] unsigned long int var_1_2 = 256; [L24] unsigned long int var_1_3 = 0; [L25] unsigned long int var_1_4 = 8; [L26] signed short int var_1_5 = 50; [L27] double var_1_6 = 31.5; [L28] signed short int var_1_7 = 128; [L29] signed short int var_1_8 = 64; [L30] double var_1_9 = 1000000000.25; [L31] float var_1_10 = 1.1; [L32] float var_1_11 = 8.75; [L33] float var_1_12 = 63.8; [L34] unsigned char var_1_13 = 1; [L35] float var_1_14 = 127.5; [L36] signed char var_1_15 = -2; [L37] signed char var_1_16 = 1; [L38] signed char var_1_17 = 1; [L39] signed char var_1_18 = 1; [L40] signed char var_1_19 = -2; [L41] signed char var_1_20 = 16; [L42] signed char var_1_21 = 2; [L43] signed char var_1_22 = 8; [L44] unsigned char var_1_23 = 0; [L45] unsigned char var_1_24 = 0; [L46] unsigned char var_1_25 = 0; [L47] unsigned char var_1_26 = 0; [L48] unsigned char var_1_27 = 32; VAL [isInitial=0, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_2=256, var_1_3=0, var_1_4=8, var_1_5=50, var_1_6=63/2, var_1_7=128, var_1_8=64, var_1_9=4000000001/4] [L162] isInitial = 1 [L163] FCALL initially() [L164] COND TRUE 1 [L165] FCALL updateLastVariables() [L166] CALL updateVariables() [L100] var_1_2 = __VERIFIER_nondet_ulong() [L101] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_3=0, var_1_4=8, var_1_5=50, var_1_6=63/2, var_1_7=128, var_1_8=64, var_1_9=4000000001/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_3=0, var_1_4=8, var_1_5=50, var_1_6=63/2, var_1_7=128, var_1_8=64, var_1_9=4000000001/4] [L101] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_3=0, var_1_4=8, var_1_5=50, var_1_6=63/2, var_1_7=128, var_1_8=64, var_1_9=4000000001/4] [L102] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_3=0, var_1_4=8, var_1_5=50, var_1_6=63/2, var_1_7=128, var_1_8=64, var_1_9=4000000001/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_3=0, var_1_4=8, var_1_5=50, var_1_6=63/2, var_1_7=128, var_1_8=64, var_1_9=4000000001/4] [L102] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_3=0, var_1_4=8, var_1_5=50, var_1_6=63/2, var_1_7=128, var_1_8=64, var_1_9=4000000001/4] [L103] var_1_3 = __VERIFIER_nondet_ulong() [L104] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_4=8, var_1_5=50, var_1_6=63/2, var_1_7=128, var_1_8=64, var_1_9=4000000001/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_4=8, var_1_5=50, var_1_6=63/2, var_1_7=128, var_1_8=64, var_1_9=4000000001/4] [L104] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_4=8, var_1_5=50, var_1_6=63/2, var_1_7=128, var_1_8=64, var_1_9=4000000001/4] [L105] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_4=8, var_1_5=50, var_1_6=63/2, var_1_7=128, var_1_8=64, var_1_9=4000000001/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_4=8, var_1_5=50, var_1_6=63/2, var_1_7=128, var_1_8=64, var_1_9=4000000001/4] [L105] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_4=8, var_1_5=50, var_1_6=63/2, var_1_7=128, var_1_8=64, var_1_9=4000000001/4] [L106] var_1_4 = __VERIFIER_nondet_ulong() [L107] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=50, var_1_6=63/2, var_1_7=128, var_1_8=64, var_1_9=4000000001/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=50, var_1_6=63/2, var_1_7=128, var_1_8=64, var_1_9=4000000001/4] [L107] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=50, var_1_6=63/2, var_1_7=128, var_1_8=64, var_1_9=4000000001/4] [L108] CALL assume_abort_if_not(var_1_4 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=50, var_1_6=63/2, var_1_7=128, var_1_8=64, var_1_9=4000000001/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=50, var_1_6=63/2, var_1_7=128, var_1_8=64, var_1_9=4000000001/4] [L108] RET assume_abort_if_not(var_1_4 <= 4294967295) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=50, var_1_6=63/2, var_1_7=128, var_1_8=64, var_1_9=4000000001/4] [L109] var_1_5 = __VERIFIER_nondet_short() [L110] CALL assume_abort_if_not(var_1_5 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=128, var_1_8=64, var_1_9=4000000001/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=128, var_1_8=64, var_1_9=4000000001/4] [L110] RET assume_abort_if_not(var_1_5 >= -16383) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=128, var_1_8=64, var_1_9=4000000001/4] [L111] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=128, var_1_8=64, var_1_9=4000000001/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=128, var_1_8=64, var_1_9=4000000001/4] [L111] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=128, var_1_8=64, var_1_9=4000000001/4] [L112] var_1_7 = __VERIFIER_nondet_short() [L113] CALL assume_abort_if_not(var_1_7 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=64, var_1_9=4000000001/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=64, var_1_9=4000000001/4] [L113] RET assume_abort_if_not(var_1_7 >= -1) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=64, var_1_9=4000000001/4] [L114] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=64, var_1_9=4000000001/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=64, var_1_9=4000000001/4] [L114] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=64, var_1_9=4000000001/4] [L115] var_1_8 = __VERIFIER_nondet_short() [L116] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0, var_1_9=4000000001/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0, var_1_9=4000000001/4] [L116] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0, var_1_9=4000000001/4] [L117] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0, var_1_9=4000000001/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0, var_1_9=4000000001/4] [L117] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0, var_1_9=4000000001/4] [L118] var_1_9 = __VERIFIER_nondet_double() [L119] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L119] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L120] var_1_11 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L121] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L122] var_1_13 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L123] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L124] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L124] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L125] var_1_14 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L126] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L127] var_1_16 = __VERIFIER_nondet_char() [L128] CALL assume_abort_if_not(var_1_16 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L128] RET assume_abort_if_not(var_1_16 >= -1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L129] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L129] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L130] var_1_17 = __VERIFIER_nondet_char() [L131] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L131] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L132] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L132] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L133] var_1_19 = __VERIFIER_nondet_char() [L134] CALL assume_abort_if_not(var_1_19 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L134] RET assume_abort_if_not(var_1_19 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L135] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L135] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L136] var_1_20 = __VERIFIER_nondet_char() [L137] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L137] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L138] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L138] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L139] var_1_21 = __VERIFIER_nondet_char() [L140] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L140] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L141] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L141] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L142] var_1_22 = __VERIFIER_nondet_char() [L143] CALL assume_abort_if_not(var_1_22 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L143] RET assume_abort_if_not(var_1_22 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L144] CALL assume_abort_if_not(var_1_22 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L144] RET assume_abort_if_not(var_1_22 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L145] var_1_24 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L146] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L147] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L147] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L148] var_1_25 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L149] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L150] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L150] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L151] var_1_26 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L152] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L153] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L153] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L166] RET updateVariables() [L167] CALL step() [L52] signed short int stepLocal_1 = var_1_5; [L53] unsigned long int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_4=1, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L54] COND TRUE (var_1_2 + var_1_3) <= stepLocal_0 [L55] var_1_1 = (128 + var_1_5) VAL [isInitial=1, stepLocal_1=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_2=11970073853952, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L63] COND FALSE !(var_1_5 < (var_1_7 - var_1_8)) VAL [isInitial=1, stepLocal_1=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_2=11970073853952, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L66] unsigned long int stepLocal_2 = var_1_3; VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_2=11970073853952, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L67] COND TRUE var_1_4 > stepLocal_2 [L68] var_1_10 = (1.00000000000009E13f - var_1_11) VAL [isInitial=1, stepLocal_1=0, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_2=11970073853952, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L72] unsigned char stepLocal_4 = var_1_5 >= var_1_2; [L73] signed long int stepLocal_3 = 1; VAL [isInitial=1, stepLocal_1=0, stepLocal_3=1, stepLocal_4=1, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_2=11970073853952, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L74] COND FALSE !(var_1_13 && stepLocal_4) VAL [isInitial=1, stepLocal_1=0, stepLocal_3=1, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_2=11970073853952, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L77] COND TRUE stepLocal_3 >= var_1_2 [L78] var_1_12 = var_1_11 VAL [isInitial=1, stepLocal_1=0, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_2=11970073853952, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L83] var_1_15 = (var_1_16 - var_1_17) VAL [isInitial=1, stepLocal_1=0, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_2=11970073853952, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L84] COND TRUE ((((var_1_3) < (var_1_2)) ? (var_1_3) : (var_1_2))) < 25u [L85] var_1_18 = (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))) VAL [isInitial=1, stepLocal_1=0, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_2=11970073853952, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L87] signed short int stepLocal_5 = var_1_8; VAL [isInitial=1, stepLocal_1=0, stepLocal_5=0, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_2=11970073853952, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L88] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, stepLocal_1=0, stepLocal_5=0, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_2=11970073853952, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L97] var_1_27 = var_1_21 VAL [isInitial=1, stepLocal_1=0, stepLocal_5=0, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_2=11970073853952, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L167] RET step() [L168] CALL, EXPR property() [L158-L159] return (((((((((var_1_2 + var_1_3) <= var_1_4) ? (var_1_1 == ((signed short int) (128 + var_1_5))) : ((var_1_5 >= (var_1_4 * var_1_3)) ? (var_1_1 == ((signed short int) var_1_5)) : (var_1_1 == ((signed short int) 1)))) && ((var_1_5 < (var_1_7 - var_1_8)) ? (var_1_6 == ((double) var_1_9)) : 1)) && ((var_1_4 > var_1_3) ? (var_1_10 == ((float) (1.00000000000009E13f - var_1_11))) : (var_1_10 == ((float) 9.75f)))) && ((var_1_13 && (var_1_5 >= var_1_2)) ? (var_1_12 == ((float) var_1_11)) : ((1 >= var_1_2) ? (var_1_12 == ((float) var_1_11)) : (var_1_12 == ((float) var_1_14))))) && (var_1_15 == ((signed char) (var_1_16 - var_1_17)))) && ((((((var_1_3) < (var_1_2)) ? (var_1_3) : (var_1_2))) < 25u) ? (var_1_18 == ((signed char) (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))))) : 1)) && (var_1_13 ? (((~ var_1_21) > var_1_8) ? (var_1_23 == ((unsigned char) (var_1_24 && (! var_1_25)))) : (var_1_24 ? (var_1_23 == ((unsigned char) ((! var_1_25) || var_1_26))) : 1)) : 1)) && (var_1_27 == ((unsigned char) var_1_21)) ; VAL [\result=0, isInitial=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_2=11970073853952, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L168] RET, EXPR property() [L168] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_2=11970073853952, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_2=11970073853952, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=63/2, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 168 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 4, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 144 mSDsluCounter, 663 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 326 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 466 IncrementalHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 337 mSDtfsCounter, 466 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 661 GetRequests, 638 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=3, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1502 NumberOfCodeBlocks, 1502 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1281 ConstructedInterpolants, 0 QuantifiedInterpolants, 2320 SizeOfPredicates, 2 NumberOfNonLiveVariables, 936 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 13921/14280 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:08:53,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-1.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 34e373e2d0377a96da4417e64272a03c4d11bcbb2fc79dad14cabbe84b3959dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:08:54,939 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:08:55,012 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 10:08:55,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:08:55,017 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:08:55,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:08:55,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:08:55,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:08:55,041 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:08:55,041 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:08:55,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:08:55,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:08:55,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:08:55,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:08:55,042 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:08:55,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:08:55,042 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:08:55,042 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:08:55,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:08:55,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:08:55,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:08:55,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:08:55,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:08:55,042 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 10:08:55,042 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 10:08:55,042 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 10:08:55,042 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:08:55,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:08:55,043 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:08:55,043 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:08:55,043 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:08:55,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:08:55,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:08:55,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:08:55,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:08:55,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:08:55,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:08:55,043 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:08:55,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:08:55,043 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 10:08:55,043 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 10:08:55,043 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:08:55,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:08:55,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:08:55,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:08:55,043 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 -> 34e373e2d0377a96da4417e64272a03c4d11bcbb2fc79dad14cabbe84b3959dd [2025-03-08 10:08:55,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:08:55,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:08:55,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:08:55,261 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:08:55,261 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:08:55,262 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-1.i [2025-03-08 10:08:56,411 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc0231315/acfdabe4b93145a7a61e0814e9c2ca13/FLAG3659e6b4f [2025-03-08 10:08:56,594 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:08:56,595 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-1.i [2025-03-08 10:08:56,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc0231315/acfdabe4b93145a7a61e0814e9c2ca13/FLAG3659e6b4f [2025-03-08 10:08:56,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc0231315/acfdabe4b93145a7a61e0814e9c2ca13 [2025-03-08 10:08:56,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:08:56,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:08:56,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:08:56,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:08:56,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:08:56,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:08:56" (1/1) ... [2025-03-08 10:08:56,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5072f377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:56, skipping insertion in model container [2025-03-08 10:08:56,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:08:56" (1/1) ... [2025-03-08 10:08:56,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:08:56,739 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-1.i[916,929] [2025-03-08 10:08:56,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:08:56,787 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:08:56,795 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-1.i[916,929] [2025-03-08 10:08:56,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:08:56,828 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:08:56,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:56 WrapperNode [2025-03-08 10:08:56,829 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:08:56,830 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:08:56,831 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:08:56,831 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:08:56,836 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:08:56" (1/1) ... [2025-03-08 10:08:56,844 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:08:56" (1/1) ... [2025-03-08 10:08:56,867 INFO L138 Inliner]: procedures = 27, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2025-03-08 10:08:56,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:08:56,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:08:56,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:08:56,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:08:56,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:56" (1/1) ... [2025-03-08 10:08:56,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:56" (1/1) ... [2025-03-08 10:08:56,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:56" (1/1) ... [2025-03-08 10:08:56,894 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:08:56,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:56" (1/1) ... [2025-03-08 10:08:56,894 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:56" (1/1) ... [2025-03-08 10:08:56,904 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:56" (1/1) ... [2025-03-08 10:08:56,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:56" (1/1) ... [2025-03-08 10:08:56,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:56" (1/1) ... [2025-03-08 10:08:56,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:56" (1/1) ... [2025-03-08 10:08:56,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:08:56,917 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:08:56,920 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:08:56,920 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:08:56,921 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:56" (1/1) ... [2025-03-08 10:08:56,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:08:56,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:08:56,951 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:08:56,954 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:08:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:08:56,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 10:08:56,972 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:08:56,972 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:08:56,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:08:56,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:08:57,045 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:08:57,046 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:08:57,465 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 10:08:57,465 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:08:57,472 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:08:57,473 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:08:57,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:08:57 BoogieIcfgContainer [2025-03-08 10:08:57,473 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:08:57,475 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:08:57,475 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:08:57,478 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:08:57,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:08:56" (1/3) ... [2025-03-08 10:08:57,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca29a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:08:57, skipping insertion in model container [2025-03-08 10:08:57,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:56" (2/3) ... [2025-03-08 10:08:57,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca29a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:08:57, skipping insertion in model container [2025-03-08 10:08:57,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:08:57" (3/3) ... [2025-03-08 10:08:57,480 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-1.i [2025-03-08 10:08:57,490 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:08:57,491 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-1.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:08:57,525 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:08:57,534 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;@44dd1686, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:08:57,534 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:08:57,538 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 50 states have internal predecessors, (63), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 10:08:57,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 10:08:57,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:08:57,550 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:57,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:08:57,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:08:57,554 INFO L85 PathProgramCache]: Analyzing trace with hash 423152270, now seen corresponding path program 1 times [2025-03-08 10:08:57,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:08:57,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354828757] [2025-03-08 10:08:57,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:08:57,567 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:08:57,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:08:57,569 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:08:57,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 (2)] Waiting until timeout for monitored process [2025-03-08 10:08:57,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 10:08:57,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 10:08:57,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:08:57,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:08:57,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:08:57,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:08:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 824 proven. 0 refuted. 0 times theorem prover too weak. 1556 trivial. 0 not checked. [2025-03-08 10:08:57,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:08:57,910 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:08:57,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354828757] [2025-03-08 10:08:57,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354828757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:08:57,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:08:57,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 10:08:57,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626326612] [2025-03-08 10:08:57,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:08:57,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:08:57,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:08:57,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:08:57,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:08:57,931 INFO L87 Difference]: Start difference. First operand has 87 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 50 states have internal predecessors, (63), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 10:08:57,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:08:57,953 INFO L93 Difference]: Finished difference Result 168 states and 296 transitions. [2025-03-08 10:08:57,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:08:57,955 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 214 [2025-03-08 10:08:57,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:08:57,960 INFO L225 Difference]: With dead ends: 168 [2025-03-08 10:08:57,960 INFO L226 Difference]: Without dead ends: 84 [2025-03-08 10:08:57,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 213 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:08:57,965 INFO L435 NwaCegarLoop]: 128 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, 128 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:08:57,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:08:57,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-08 10:08:57,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-08 10:08:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 10:08:57,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 128 transitions. [2025-03-08 10:08:57,996 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 128 transitions. Word has length 214 [2025-03-08 10:08:57,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:08:57,996 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 128 transitions. [2025-03-08 10:08:57,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 10:08:57,996 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 128 transitions. [2025-03-08 10:08:58,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 10:08:58,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:08:58,000 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:58,009 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:08:58,200 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:08:58,201 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:08:58,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:08:58,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1840330001, now seen corresponding path program 1 times [2025-03-08 10:08:58,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:08:58,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127861448] [2025-03-08 10:08:58,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:08:58,204 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:08:58,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:08:58,206 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:08:58,208 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:08:58,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 10:08:58,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 10:08:58,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:08:58,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:08:58,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 10:08:58,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:08:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 10:08:58,473 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:08:58,473 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:08:58,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127861448] [2025-03-08 10:08:58,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1127861448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:08:58,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:08:58,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:08:58,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998225606] [2025-03-08 10:08:58,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:08:58,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:08:58,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:08:58,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:08:58,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:08:58,475 INFO L87 Difference]: Start difference. First operand 84 states and 128 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 10:08:58,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:08:58,600 INFO L93 Difference]: Finished difference Result 204 states and 307 transitions. [2025-03-08 10:08:58,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:08:58,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 214 [2025-03-08 10:08:58,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:08:58,607 INFO L225 Difference]: With dead ends: 204 [2025-03-08 10:08:58,607 INFO L226 Difference]: Without dead ends: 123 [2025-03-08 10:08:58,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:08:58,608 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 55 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:08:58,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 239 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:08:58,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-08 10:08:58,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2025-03-08 10:08:58,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 69 states have internal predecessors, (81), 49 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-08 10:08:58,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 179 transitions. [2025-03-08 10:08:58,640 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 179 transitions. Word has length 214 [2025-03-08 10:08:58,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:08:58,641 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 179 transitions. [2025-03-08 10:08:58,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 10:08:58,641 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions. [2025-03-08 10:08:58,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 10:08:58,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:08:58,643 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:58,651 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:08:58,844 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:08:58,845 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:08:58,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:08:58,845 INFO L85 PathProgramCache]: Analyzing trace with hash -2073544651, now seen corresponding path program 1 times [2025-03-08 10:08:58,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:08:58,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784939321] [2025-03-08 10:08:58,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:08:58,848 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:08:58,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:08:58,853 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:08:58,854 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:08:58,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 10:08:59,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 10:08:59,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:08:59,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:08:59,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 10:08:59,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:08:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1572 proven. 96 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2025-03-08 10:08:59,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:08:59,656 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:08:59,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784939321] [2025-03-08 10:08:59,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784939321] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:08:59,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1014858585] [2025-03-08 10:08:59,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:08:59,656 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 10:08:59,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 10:08:59,678 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 10:08:59,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-08 10:08:59,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 10:09:00,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 10:09:00,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:09:00,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:09:00,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 10:09:00,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:09:00,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1572 proven. 96 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2025-03-08 10:09:00,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:09:00,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1014858585] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:09:00,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 10:09:00,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2025-03-08 10:09:00,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38443688] [2025-03-08 10:09:00,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 10:09:00,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 10:09:00,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:09:00,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 10:09:00,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-08 10:09:00,544 INFO L87 Difference]: Start difference. First operand 120 states and 179 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 3 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2025-03-08 10:09:01,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:09:01,173 INFO L93 Difference]: Finished difference Result 261 states and 375 transitions. [2025-03-08 10:09:01,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 10:09:01,179 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 3 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 215 [2025-03-08 10:09:01,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:09:01,183 INFO L225 Difference]: With dead ends: 261 [2025-03-08 10:09:01,183 INFO L226 Difference]: Without dead ends: 144 [2025-03-08 10:09:01,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 553 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-03-08 10:09:01,184 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 46 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:09:01,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 340 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:09:01,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-08 10:09:01,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2025-03-08 10:09:01,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 80 states have (on average 1.15) internal successors, (92), 81 states have internal predecessors, (92), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-08 10:09:01,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 190 transitions. [2025-03-08 10:09:01,210 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 190 transitions. Word has length 215 [2025-03-08 10:09:01,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:09:01,211 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 190 transitions. [2025-03-08 10:09:01,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 3 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2025-03-08 10:09:01,212 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 190 transitions. [2025-03-08 10:09:01,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 10:09:01,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:09:01,214 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:01,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 10:09:01,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-03-08 10:09:01,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 10:09:01,619 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:09:01,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:09:01,620 INFO L85 PathProgramCache]: Analyzing trace with hash 778563380, now seen corresponding path program 1 times [2025-03-08 10:09:01,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:09:01,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73682611] [2025-03-08 10:09:01,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:09:01,620 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:09:01,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:09:01,622 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:09:01,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 10:09:01,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 10:09:01,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 10:09:01,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:09:01,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:09:01,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 10:09:01,827 INFO L279 TraceCheckSpWp]: Computing forward predicates...