./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-42.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 063560dffd28e6ff007173441068d18177141fab7727eec62b2f4e0016a02efd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:15:19,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:15:19,297 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:15:19,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:15:19,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:15:19,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:15:19,322 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:15:19,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:15:19,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:15:19,323 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:15:19,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:15:19,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:15:19,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:15:19,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:15:19,325 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:15:19,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:15:19,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:15:19,325 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:15:19,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:15:19,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:15:19,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:15:19,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:15:19,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:15:19,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:15:19,326 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:15:19,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:15:19,326 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:15:19,326 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:15:19,326 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:15:19,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:15:19,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:15:19,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:15:19,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:15:19,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:15:19,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:15:19,327 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:15:19,327 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:15:19,327 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:15:19,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:15:19,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:15:19,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:15:19,327 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:15:19,327 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:15:19,327 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 -> 063560dffd28e6ff007173441068d18177141fab7727eec62b2f4e0016a02efd [2025-03-03 21:15:19,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:15:19,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:15:19,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:15:19,555 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:15:19,556 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:15:19,557 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-42.i [2025-03-03 21:15:20,675 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52a1e637b/f0bc2e382ab846d0bf113403c3def886/FLAG2e50381b4 [2025-03-03 21:15:20,930 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:15:20,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-42.i [2025-03-03 21:15:20,939 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52a1e637b/f0bc2e382ab846d0bf113403c3def886/FLAG2e50381b4 [2025-03-03 21:15:21,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52a1e637b/f0bc2e382ab846d0bf113403c3def886 [2025-03-03 21:15:21,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:15:21,274 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:15:21,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:15:21,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:15:21,278 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:15:21,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:15:21" (1/1) ... [2025-03-03 21:15:21,279 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d8b9875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:21, skipping insertion in model container [2025-03-03 21:15:21,279 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:15:21" (1/1) ... [2025-03-03 21:15:21,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:15:21,401 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_fillercode_fillercodestructure_filler-pr-cn_file-42.i[919,932] [2025-03-03 21:15:21,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:15:21,499 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:15:21,507 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_fillercode_fillercodestructure_filler-pr-cn_file-42.i[919,932] [2025-03-03 21:15:21,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:15:21,563 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:15:21,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:21 WrapperNode [2025-03-03 21:15:21,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:15:21,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:15:21,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:15:21,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:15:21,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:21" (1/1) ... [2025-03-03 21:15:21,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:21" (1/1) ... [2025-03-03 21:15:21,604 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 230 [2025-03-03 21:15:21,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:15:21,606 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:15:21,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:15:21,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:15:21,613 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:21" (1/1) ... [2025-03-03 21:15:21,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:21" (1/1) ... [2025-03-03 21:15:21,620 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:21" (1/1) ... [2025-03-03 21:15:21,642 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:15:21,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:21" (1/1) ... [2025-03-03 21:15:21,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:21" (1/1) ... [2025-03-03 21:15:21,649 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:21" (1/1) ... [2025-03-03 21:15:21,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:21" (1/1) ... [2025-03-03 21:15:21,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:21" (1/1) ... [2025-03-03 21:15:21,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:21" (1/1) ... [2025-03-03 21:15:21,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:15:21,658 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:15:21,658 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:15:21,658 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:15:21,659 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:21" (1/1) ... [2025-03-03 21:15:21,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:15:21,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:15:21,685 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:15:21,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:15:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:15:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:15:21,705 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:15:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:15:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:15:21,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:15:21,782 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:15:21,784 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:15:22,100 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-03 21:15:22,100 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:15:22,112 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:15:22,112 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:15:22,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:15:22 BoogieIcfgContainer [2025-03-03 21:15:22,112 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:15:22,114 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:15:22,114 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:15:22,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:15:22,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:15:21" (1/3) ... [2025-03-03 21:15:22,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754a5863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:15:22, skipping insertion in model container [2025-03-03 21:15:22,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:21" (2/3) ... [2025-03-03 21:15:22,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754a5863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:15:22, skipping insertion in model container [2025-03-03 21:15:22,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:15:22" (3/3) ... [2025-03-03 21:15:22,120 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-42.i [2025-03-03 21:15:22,131 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:15:22,133 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-42.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:15:22,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:15:22,180 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;@8de652b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:15:22,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:15:22,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-03 21:15:22,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-03 21:15:22,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:15:22,196 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:15:22,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:15:22,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:15:22,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1692044333, now seen corresponding path program 1 times [2025-03-03 21:15:22,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:15:22,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402636357] [2025-03-03 21:15:22,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:15:22,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:15:22,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-03 21:15:22,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-03 21:15:22,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:15:22,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:15:22,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 2592 trivial. 0 not checked. [2025-03-03 21:15:22,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:15:22,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402636357] [2025-03-03 21:15:22,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402636357] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:15:22,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562253910] [2025-03-03 21:15:22,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:15:22,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:15:22,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:15:22,524 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:15:22,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 21:15:22,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-03 21:15:22,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-03 21:15:22,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:15:22,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:15:22,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:15:22,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:15:22,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 2592 trivial. 0 not checked. [2025-03-03 21:15:22,765 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:15:22,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562253910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:15:22,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:15:22,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:15:22,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629627738] [2025-03-03 21:15:22,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:15:22,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:15:22,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:15:22,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:15:22,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:15:22,789 INFO L87 Difference]: Start difference. First operand has 100 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-03 21:15:22,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:15:22,811 INFO L93 Difference]: Finished difference Result 193 states and 348 transitions. [2025-03-03 21:15:22,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:15:22,813 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) Word has length 234 [2025-03-03 21:15:22,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:15:22,818 INFO L225 Difference]: With dead ends: 193 [2025-03-03 21:15:22,818 INFO L226 Difference]: Without dead ends: 96 [2025-03-03 21:15:22,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:15:22,823 INFO L435 NwaCegarLoop]: 151 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, 151 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:15:22,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:15:22,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-03 21:15:22,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-03 21:15:22,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 57 states have internal predecessors, (77), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-03 21:15:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 151 transitions. [2025-03-03 21:15:22,854 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 151 transitions. Word has length 234 [2025-03-03 21:15:22,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:15:22,854 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 151 transitions. [2025-03-03 21:15:22,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-03 21:15:22,854 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 151 transitions. [2025-03-03 21:15:22,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-03 21:15:22,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:15:22,860 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:15:22,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 21:15:23,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 21:15:23,061 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:15:23,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:15:23,062 INFO L85 PathProgramCache]: Analyzing trace with hash 310133900, now seen corresponding path program 1 times [2025-03-03 21:15:23,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:15:23,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759139640] [2025-03-03 21:15:23,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:15:23,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:15:23,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-03 21:15:23,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-03 21:15:23,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:15:23,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:15:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-03 21:15:23,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:15:23,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759139640] [2025-03-03 21:15:23,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759139640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:15:23,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:15:23,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:15:23,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506946505] [2025-03-03 21:15:23,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:15:23,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:15:23,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:15:23,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:15:23,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:15:23,517 INFO L87 Difference]: Start difference. First operand 96 states and 151 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 21:15:23,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:15:23,716 INFO L93 Difference]: Finished difference Result 283 states and 448 transitions. [2025-03-03 21:15:23,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:15:23,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 234 [2025-03-03 21:15:23,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:15:23,722 INFO L225 Difference]: With dead ends: 283 [2025-03-03 21:15:23,722 INFO L226 Difference]: Without dead ends: 190 [2025-03-03 21:15:23,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:15:23,725 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 117 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:15:23,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 435 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:15:23,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-03 21:15:23,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 160. [2025-03-03 21:15:23,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 states have internal predecessors, (103), 74 states have call successors, (74), 2 states have call predecessors, (74), 2 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 21:15:23,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 251 transitions. [2025-03-03 21:15:23,760 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 251 transitions. Word has length 234 [2025-03-03 21:15:23,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:15:23,761 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 251 transitions. [2025-03-03 21:15:23,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 21:15:23,761 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 251 transitions. [2025-03-03 21:15:23,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 21:15:23,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:15:23,763 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:15:23,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:15:23,763 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:15:23,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:15:23,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1782325657, now seen corresponding path program 1 times [2025-03-03 21:15:23,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:15:23,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82019813] [2025-03-03 21:15:23,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:15:23,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:15:23,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 21:15:23,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 21:15:23,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:15:23,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:15:24,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-03 21:15:24,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:15:24,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82019813] [2025-03-03 21:15:24,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82019813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:15:24,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:15:24,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:15:24,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439068964] [2025-03-03 21:15:24,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:15:24,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:15:24,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:15:24,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:15:24,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:15:24,177 INFO L87 Difference]: Start difference. First operand 160 states and 251 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 21:15:24,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:15:24,511 INFO L93 Difference]: Finished difference Result 409 states and 651 transitions. [2025-03-03 21:15:24,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 21:15:24,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 235 [2025-03-03 21:15:24,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:15:24,516 INFO L225 Difference]: With dead ends: 409 [2025-03-03 21:15:24,516 INFO L226 Difference]: Without dead ends: 316 [2025-03-03 21:15:24,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:15:24,517 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 164 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:15:24,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 621 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:15:24,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-03 21:15:24,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 251. [2025-03-03 21:15:24,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 136 states have (on average 1.286764705882353) internal successors, (175), 136 states have internal predecessors, (175), 111 states have call successors, (111), 3 states have call predecessors, (111), 3 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2025-03-03 21:15:24,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 397 transitions. [2025-03-03 21:15:24,568 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 397 transitions. Word has length 235 [2025-03-03 21:15:24,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:15:24,568 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 397 transitions. [2025-03-03 21:15:24,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 21:15:24,568 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 397 transitions. [2025-03-03 21:15:24,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 21:15:24,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:15:24,570 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:15:24,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:15:24,571 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:15:24,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:15:24,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1715318904, now seen corresponding path program 1 times [2025-03-03 21:15:24,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:15:24,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633331537] [2025-03-03 21:15:24,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:15:24,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:15:24,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 21:15:24,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 21:15:24,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:15:24,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:15:24,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-03 21:15:24,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:15:24,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633331537] [2025-03-03 21:15:24,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633331537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:15:24,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:15:24,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:15:24,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182784543] [2025-03-03 21:15:24,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:15:24,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:15:24,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:15:24,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:15:24,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:15:24,755 INFO L87 Difference]: Start difference. First operand 251 states and 397 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 21:15:24,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:15:24,794 INFO L93 Difference]: Finished difference Result 435 states and 691 transitions. [2025-03-03 21:15:24,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:15:24,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 235 [2025-03-03 21:15:24,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:15:24,798 INFO L225 Difference]: With dead ends: 435 [2025-03-03 21:15:24,798 INFO L226 Difference]: Without dead ends: 251 [2025-03-03 21:15:24,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:15:24,799 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:15:24,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:15:24,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-03 21:15:24,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2025-03-03 21:15:24,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 136 states have (on average 1.2720588235294117) internal successors, (173), 136 states have internal predecessors, (173), 111 states have call successors, (111), 3 states have call predecessors, (111), 3 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2025-03-03 21:15:24,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 395 transitions. [2025-03-03 21:15:24,839 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 395 transitions. Word has length 235 [2025-03-03 21:15:24,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:15:24,840 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 395 transitions. [2025-03-03 21:15:24,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 21:15:24,840 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 395 transitions. [2025-03-03 21:15:24,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 21:15:24,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:15:24,843 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:15:24,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:15:24,844 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:15:24,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:15:24,844 INFO L85 PathProgramCache]: Analyzing trace with hash -81632455, now seen corresponding path program 1 times [2025-03-03 21:15:24,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:15:24,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861474334] [2025-03-03 21:15:24,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:15:24,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:15:24,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 21:15:24,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 21:15:24,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:15:24,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:15:25,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 51 proven. 159 refuted. 0 times theorem prover too weak. 2454 trivial. 0 not checked. [2025-03-03 21:15:25,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:15:25,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861474334] [2025-03-03 21:15:25,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861474334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:15:25,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372606945] [2025-03-03 21:15:25,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:15:25,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:15:25,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:15:25,527 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:15:25,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 21:15:25,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 21:15:25,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 21:15:25,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:15:25,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:15:25,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 21:15:25,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:15:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1199 proven. 159 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2025-03-03 21:15:26,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:15:27,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 51 proven. 162 refuted. 0 times theorem prover too weak. 2451 trivial. 0 not checked. [2025-03-03 21:15:27,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372606945] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:15:27,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:15:27,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-03-03 21:15:27,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326061694] [2025-03-03 21:15:27,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:15:27,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 21:15:27,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:15:27,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 21:15:27,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:15:27,032 INFO L87 Difference]: Start difference. First operand 251 states and 395 transitions. Second operand has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (68), 3 states have call predecessors, (68), 3 states have call successors, (68) [2025-03-03 21:15:27,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:15:27,990 INFO L93 Difference]: Finished difference Result 722 states and 1081 transitions. [2025-03-03 21:15:27,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-03 21:15:27,990 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (68), 3 states have call predecessors, (68), 3 states have call successors, (68) Word has length 235 [2025-03-03 21:15:27,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:15:27,994 INFO L225 Difference]: With dead ends: 722 [2025-03-03 21:15:27,994 INFO L226 Difference]: Without dead ends: 629 [2025-03-03 21:15:27,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 466 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 21:15:27,995 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 476 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:15:27,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 587 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 21:15:27,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2025-03-03 21:15:28,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 391. [2025-03-03 21:15:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 230 states have (on average 1.2826086956521738) internal successors, (295), 230 states have internal predecessors, (295), 148 states have call successors, (148), 12 states have call predecessors, (148), 12 states have return successors, (148), 148 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-03 21:15:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 591 transitions. [2025-03-03 21:15:28,041 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 591 transitions. Word has length 235 [2025-03-03 21:15:28,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:15:28,041 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 591 transitions. [2025-03-03 21:15:28,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (68), 3 states have call predecessors, (68), 3 states have call successors, (68) [2025-03-03 21:15:28,041 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 591 transitions. [2025-03-03 21:15:28,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 21:15:28,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:15:28,043 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:15:28,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 21:15:28,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:15:28,244 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:15:28,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:15:28,244 INFO L85 PathProgramCache]: Analyzing trace with hash -926104326, now seen corresponding path program 1 times [2025-03-03 21:15:28,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:15:28,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514432902] [2025-03-03 21:15:28,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:15:28,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:15:28,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 21:15:28,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 21:15:28,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:15:28,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:15:28,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1457277910] [2025-03-03 21:15:28,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:15:28,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:15:28,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:15:28,337 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-03 21:15:28,339 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-03 21:15:28,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 21:15:28,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 21:15:28,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:15:28,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:15:28,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 21:15:28,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:15:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 312 proven. 102 refuted. 0 times theorem prover too weak. 2250 trivial. 0 not checked. [2025-03-03 21:15:29,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:15:29,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:15:29,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514432902] [2025-03-03 21:15:29,787 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 21:15:29,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457277910] [2025-03-03 21:15:29,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457277910] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:15:29,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:15:29,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-03 21:15:29,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590496809] [2025-03-03 21:15:29,788 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 21:15:29,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 21:15:29,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:15:29,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 21:15:29,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:15:29,789 INFO L87 Difference]: Start difference. First operand 391 states and 591 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-03 21:15:30,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:15:30,434 INFO L93 Difference]: Finished difference Result 1075 states and 1587 transitions. [2025-03-03 21:15:30,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 21:15:30,434 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 235 [2025-03-03 21:15:30,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:15:30,439 INFO L225 Difference]: With dead ends: 1075 [2025-03-03 21:15:30,439 INFO L226 Difference]: Without dead ends: 876 [2025-03-03 21:15:30,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2025-03-03 21:15:30,440 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 258 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:15:30,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 747 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:15:30,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2025-03-03 21:15:30,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 764. [2025-03-03 21:15:30,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 473 states have (on average 1.2980972515856237) internal successors, (614), 475 states have internal predecessors, (614), 263 states have call successors, (263), 27 states have call predecessors, (263), 27 states have return successors, (263), 261 states have call predecessors, (263), 263 states have call successors, (263) [2025-03-03 21:15:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1140 transitions. [2025-03-03 21:15:30,515 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1140 transitions. Word has length 235 [2025-03-03 21:15:30,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:15:30,515 INFO L471 AbstractCegarLoop]: Abstraction has 764 states and 1140 transitions. [2025-03-03 21:15:30,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-03 21:15:30,515 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1140 transitions. [2025-03-03 21:15:30,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 21:15:30,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:15:30,517 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:15:30,524 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-03 21:15:30,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:15:30,718 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:15:30,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:15:30,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1923176679, now seen corresponding path program 1 times [2025-03-03 21:15:30,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:15:30,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562962019] [2025-03-03 21:15:30,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:15:30,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:15:30,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 21:15:30,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 21:15:30,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:15:30,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:15:30,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [734083459] [2025-03-03 21:15:30,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:15:30,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:15:30,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:15:30,826 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:15:30,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 21:15:30,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 21:15:30,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 21:15:30,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:15:30,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:15:30,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 21:15:30,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:15:32,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 312 proven. 102 refuted. 0 times theorem prover too weak. 2250 trivial. 0 not checked. [2025-03-03 21:15:32,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:15:33,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:15:33,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562962019] [2025-03-03 21:15:33,066 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 21:15:33,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734083459] [2025-03-03 21:15:33,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734083459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:15:33,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:15:33,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-03 21:15:33,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111443224] [2025-03-03 21:15:33,066 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 21:15:33,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 21:15:33,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:15:33,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 21:15:33,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:15:33,067 INFO L87 Difference]: Start difference. First operand 764 states and 1140 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-03 21:15:33,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:15:33,832 INFO L93 Difference]: Finished difference Result 1465 states and 2189 transitions. [2025-03-03 21:15:33,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 21:15:33,833 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 235 [2025-03-03 21:15:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:15:33,841 INFO L225 Difference]: With dead ends: 1465 [2025-03-03 21:15:33,842 INFO L226 Difference]: Without dead ends: 1161 [2025-03-03 21:15:33,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-03-03 21:15:33,847 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 262 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:15:33,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 935 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:15:33,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2025-03-03 21:15:33,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 969. [2025-03-03 21:15:33,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 596 states have (on average 1.2902684563758389) internal successors, (769), 598 states have internal predecessors, (769), 337 states have call successors, (337), 35 states have call predecessors, (337), 35 states have return successors, (337), 335 states have call predecessors, (337), 337 states have call successors, (337) [2025-03-03 21:15:33,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1443 transitions. [2025-03-03 21:15:33,963 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1443 transitions. Word has length 235 [2025-03-03 21:15:33,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:15:33,963 INFO L471 AbstractCegarLoop]: Abstraction has 969 states and 1443 transitions. [2025-03-03 21:15:33,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-03 21:15:33,963 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1443 transitions. [2025-03-03 21:15:33,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-03 21:15:33,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:15:33,965 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:15:33,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 21:15:34,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:15:34,165 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:15:34,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:15:34,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1388056527, now seen corresponding path program 1 times [2025-03-03 21:15:34,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:15:34,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603965942] [2025-03-03 21:15:34,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:15:34,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:15:34,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 21:15:34,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 21:15:34,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:15:34,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:15:34,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 6 proven. 102 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2025-03-03 21:15:34,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:15:34,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603965942] [2025-03-03 21:15:34,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603965942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:15:34,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523917024] [2025-03-03 21:15:34,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:15:34,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:15:34,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:15:34,684 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:15:34,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 21:15:34,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 21:15:34,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 21:15:34,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:15:34,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:15:34,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 21:15:34,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:15:36,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 348 proven. 198 refuted. 0 times theorem prover too weak. 2118 trivial. 0 not checked. [2025-03-03 21:15:36,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:15:37,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 12 proven. 201 refuted. 0 times theorem prover too weak. 2451 trivial. 0 not checked. [2025-03-03 21:15:37,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523917024] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:15:37,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:15:37,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 13] total 30 [2025-03-03 21:15:37,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127296233] [2025-03-03 21:15:37,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:15:37,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 21:15:37,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:15:37,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 21:15:37,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=678, Unknown=0, NotChecked=0, Total=870 [2025-03-03 21:15:37,027 INFO L87 Difference]: Start difference. First operand 969 states and 1443 transitions. Second operand has 30 states, 29 states have (on average 5.068965517241379) internal successors, (147), 28 states have internal predecessors, (147), 8 states have call successors, (111), 4 states have call predecessors, (111), 8 states have return successors, (111), 8 states have call predecessors, (111), 8 states have call successors, (111) [2025-03-03 21:15:38,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:15:38,333 INFO L93 Difference]: Finished difference Result 1448 states and 2109 transitions. [2025-03-03 21:15:38,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 21:15:38,334 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 5.068965517241379) internal successors, (147), 28 states have internal predecessors, (147), 8 states have call successors, (111), 4 states have call predecessors, (111), 8 states have return successors, (111), 8 states have call predecessors, (111), 8 states have call successors, (111) Word has length 236 [2025-03-03 21:15:38,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:15:38,341 INFO L225 Difference]: With dead ends: 1448 [2025-03-03 21:15:38,341 INFO L226 Difference]: Without dead ends: 989 [2025-03-03 21:15:38,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=560, Invalid=1696, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 21:15:38,343 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 520 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 1579 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 1579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 21:15:38,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1090 Invalid, 1879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 1579 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 21:15:38,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2025-03-03 21:15:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 842. [2025-03-03 21:15:38,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 511 states have (on average 1.2720156555772995) internal successors, (650), 511 states have internal predecessors, (650), 296 states have call successors, (296), 34 states have call predecessors, (296), 34 states have return successors, (296), 296 states have call predecessors, (296), 296 states have call successors, (296) [2025-03-03 21:15:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1242 transitions. [2025-03-03 21:15:38,487 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1242 transitions. Word has length 236 [2025-03-03 21:15:38,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:15:38,487 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1242 transitions. [2025-03-03 21:15:38,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 5.068965517241379) internal successors, (147), 28 states have internal predecessors, (147), 8 states have call successors, (111), 4 states have call predecessors, (111), 8 states have return successors, (111), 8 states have call predecessors, (111), 8 states have call successors, (111) [2025-03-03 21:15:38,488 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1242 transitions. [2025-03-03 21:15:38,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-03 21:15:38,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:15:38,490 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:15:38,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 21:15:38,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:15:38,691 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:15:38,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:15:38,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1893615152, now seen corresponding path program 1 times [2025-03-03 21:15:38,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:15:38,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003465828] [2025-03-03 21:15:38,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:15:38,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:15:38,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 21:15:38,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 21:15:38,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:15:38,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:15:38,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1240608596] [2025-03-03 21:15:38,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:15:38,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:15:38,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:15:38,760 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:15:38,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 21:15:38,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 21:15:38,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 21:15:38,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:15:38,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:15:38,870 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 21:15:38,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 21:15:38,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 21:15:38,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:15:38,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:15:39,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 21:15:39,061 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 21:15:39,061 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 21:15:39,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 21:15:39,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:15:39,266 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:15:39,397 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 21:15:39,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:15:39 BoogieIcfgContainer [2025-03-03 21:15:39,399 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 21:15:39,400 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 21:15:39,400 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 21:15:39,400 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 21:15:39,401 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:15:22" (3/4) ... [2025-03-03 21:15:39,402 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 21:15:39,402 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 21:15:39,403 INFO L158 Benchmark]: Toolchain (without parser) took 18129.11ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 122.2MB in the beginning and 135.1MB in the end (delta: -12.9MB). Peak memory consumption was 184.9MB. Max. memory is 16.1GB. [2025-03-03 21:15:39,403 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:15:39,403 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.10ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 106.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 21:15:39,404 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.90ms. Allocated memory is still 167.8MB. Free memory was 106.2MB in the beginning and 102.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:15:39,404 INFO L158 Benchmark]: Boogie Preprocessor took 51.77ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 96.4MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:15:39,404 INFO L158 Benchmark]: IcfgBuilder took 454.39ms. Allocated memory is still 167.8MB. Free memory was 96.0MB in the beginning and 66.6MB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 21:15:39,404 INFO L158 Benchmark]: TraceAbstraction took 17285.22ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 66.1MB in the beginning and 135.2MB in the end (delta: -69.1MB). Peak memory consumption was 126.1MB. Max. memory is 16.1GB. [2025-03-03 21:15:39,404 INFO L158 Benchmark]: Witness Printer took 2.78ms. Allocated memory is still 369.1MB. Free memory was 135.2MB in the beginning and 135.1MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:15:39,405 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.28ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.10ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 106.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.90ms. Allocated memory is still 167.8MB. Free memory was 106.2MB in the beginning and 102.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.77ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 96.4MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 454.39ms. Allocated memory is still 167.8MB. Free memory was 96.0MB in the beginning and 66.6MB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17285.22ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 66.1MB in the beginning and 135.2MB in the end (delta: -69.1MB). Peak memory consumption was 126.1MB. Max. memory is 16.1GB. * Witness Printer took 2.78ms. Allocated memory is still 369.1MB. Free memory was 135.2MB in the beginning and 135.1MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 216, overapproximation of someBinaryFLOATComparisonOperation at line 164, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 187, overapproximation of someBinaryFLOATComparisonOperation at line 140, overapproximation of someBinaryFLOATComparisonOperation at line 189, overapproximation of someBinaryFLOATComparisonOperation at line 166, overapproximation of someUnaryDOUBLEoperation at line 30, overapproximation of someBinaryArithmeticFLOAToperation at line 118. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] unsigned char var_1_21 = 0; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 1; [L39] signed short int var_1_24 = -32; [L40] unsigned char var_1_25 = 1; [L41] float var_1_26 = 500.65; [L42] signed long int var_1_27 = -8; [L43] float var_1_28 = 255.5; [L44] float var_1_29 = 7.5; [L45] float var_1_30 = 9.8; [L46] unsigned char var_1_31 = 4; [L47] signed long int var_1_32 = 1; [L48] unsigned char var_1_33 = 2; [L49] unsigned short int var_1_34 = 1; [L50] unsigned long int var_1_35 = 10; [L51] unsigned char var_1_36 = 10; [L52] unsigned char var_1_37 = 128; [L53] unsigned char var_1_38 = 16; [L54] unsigned char var_1_39 = 0; [L55] unsigned short int var_1_40 = 10; [L56] unsigned short int var_1_41 = 128; [L57] unsigned short int var_1_42 = 40597; [L58] signed short int last_1_var_1_1 = 16; [L59] unsigned char last_1_var_1_6 = 10; [L60] unsigned char last_1_var_1_8 = 1; [L61] signed short int last_1_var_1_13 = 200; VAL [isInitial=0, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L220] isInitial = 1 [L221] FCALL initially() [L222] COND TRUE 1 [L223] CALL updateLastVariables() [L210] last_1_var_1_1 = var_1_1 [L211] last_1_var_1_6 = var_1_6 [L212] last_1_var_1_8 = var_1_8 [L213] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L223] RET updateLastVariables() [L224] CALL updateVariables() [L151] var_1_5 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=128, var_1_8=1] [L152] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=128, var_1_8=1] [L153] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=128, var_1_8=1] [L153] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=128, var_1_8=1] [L154] var_1_7 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L155] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L156] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L156] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L157] var_1_11 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L158] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L159] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L159] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L160] var_1_12 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L161] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L162] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L162] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L163] var_1_15 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L164] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L165] var_1_16 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L166] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L167] var_1_20 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L168] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L169] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L169] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L170] var_1_22 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L171] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L172] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L172] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L173] var_1_23 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L174] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L175] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L175] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L176] var_1_24 = __VERIFIER_nondet_short() [L177] CALL assume_abort_if_not(var_1_24 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L177] RET assume_abort_if_not(var_1_24 >= -32768) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L178] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L178] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L179] var_1_25 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_25 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L180] RET assume_abort_if_not(var_1_25 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L181] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L181] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L182] var_1_27 = __VERIFIER_nondet_long() [L183] CALL assume_abort_if_not(var_1_27 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L183] RET assume_abort_if_not(var_1_27 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L184] CALL assume_abort_if_not(var_1_27 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L184] RET assume_abort_if_not(var_1_27 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L185] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L185] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L186] var_1_28 = __VERIFIER_nondet_float() [L187] CALL assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L187] RET assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L188] var_1_29 = __VERIFIER_nondet_float() [L189] CALL assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L189] RET assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L190] var_1_32 = __VERIFIER_nondet_long() [L191] CALL assume_abort_if_not(var_1_32 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L191] RET assume_abort_if_not(var_1_32 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L192] CALL assume_abort_if_not(var_1_32 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L192] RET assume_abort_if_not(var_1_32 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L193] var_1_33 = __VERIFIER_nondet_uchar() [L194] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L194] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L195] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L195] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L196] var_1_37 = __VERIFIER_nondet_uchar() [L197] CALL assume_abort_if_not(var_1_37 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L197] RET assume_abort_if_not(var_1_37 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L198] CALL assume_abort_if_not(var_1_37 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L198] RET assume_abort_if_not(var_1_37 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L199] var_1_38 = __VERIFIER_nondet_uchar() [L200] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L200] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L201] CALL assume_abort_if_not(var_1_38 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L201] RET assume_abort_if_not(var_1_38 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L202] var_1_39 = __VERIFIER_nondet_uchar() [L203] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L203] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L204] CALL assume_abort_if_not(var_1_39 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L204] RET assume_abort_if_not(var_1_39 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L205] var_1_42 = __VERIFIER_nondet_ushort() [L206] CALL assume_abort_if_not(var_1_42 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L206] RET assume_abort_if_not(var_1_42 >= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L207] CALL assume_abort_if_not(var_1_42 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L207] RET assume_abort_if_not(var_1_42 <= 65534) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L224] RET updateVariables() [L225] CALL step() [L65] signed long int stepLocal_6 = last_1_var_1_1; [L66] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=0, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L67] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L68] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L71] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L76] COND TRUE (- var_1_28) < ((((var_1_26) > (var_1_29)) ? (var_1_26) : (var_1_29))) [L77] var_1_30 = var_1_29 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L79] COND TRUE \read(var_1_25) [L80] var_1_35 = var_1_33 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L82] COND TRUE \read(var_1_25) [L83] var_1_36 = (var_1_37 - var_1_38) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L87] COND FALSE !(var_1_33 <= (~ var_1_34)) [L92] var_1_41 = var_1_36 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=0, var_1_42=32767, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L94] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=0, var_1_42=32767, var_1_5=7, var_1_6=10, var_1_7=-258, var_1_8=1] [L97] COND TRUE var_1_5 >= -2 [L98] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=4, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=0, var_1_42=32767, var_1_5=7, var_1_6=154, var_1_7=-258, var_1_8=1] [L100] COND TRUE ((((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) < (var_1_24)) ? (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) : (var_1_24))) <= var_1_32 [L101] var_1_31 = var_1_33 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=0, var_1_42=32767, var_1_5=7, var_1_6=154, var_1_7=-258, var_1_8=1] [L103] COND TRUE (- var_1_36) != var_1_34 [L104] var_1_40 = var_1_39 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=7, var_1_6=154, var_1_7=-258, var_1_8=1] [L106] unsigned char stepLocal_4 = var_1_6; [L107] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=154, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=7, var_1_6=154, var_1_7=-258, var_1_8=1] [L108] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=154, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=7, var_1_6=154, var_1_7=-258, var_1_8=1] [L109] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L110] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=10013/20, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=7, var_1_6=154, var_1_7=-258, var_1_8=1] [L117] COND TRUE ((var_1_24 + 25) % var_1_27) < 2 [L118] var_1_26 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) + var_1_29) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=7, var_1_6=154, var_1_7=-258, var_1_8=1] [L120] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=7, var_1_6=154, var_1_7=-258, var_1_8=1] [L121] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=7, var_1_6=154, var_1_7=-258, var_1_8=1] [L124] COND TRUE var_1_31 < ((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))) [L125] var_1_34 = ((((((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) > (var_1_33)) ? (((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) : (var_1_33))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=7, var_1_6=154, var_1_7=-258, var_1_8=1] [L127] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=7, var_1_6=154, var_1_7=-258, var_1_8=1] [L128] COND TRUE \read(var_1_19) [L129] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=7, var_1_6=154, var_1_7=-258, var_1_8=1] [L135] COND TRUE var_1_22 || var_1_23 [L136] var_1_21 = ((var_1_24 > -4) || var_1_25) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=7, var_1_6=154, var_1_7=-258, var_1_8=1] [L138] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L139] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=-258, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=7, var_1_6=154, var_1_7=-258, var_1_8=1] [L140] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L147] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=-258, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=7, var_1_6=154, var_1_7=-258, var_1_8=0] [L225] RET step() [L226] CALL, EXPR property() [L216-L217] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=7, var_1_6=154, var_1_7=-258, var_1_8=0] [L226] RET, EXPR property() [L226] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=7, var_1_6=154, var_1_7=-258, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_27=25, var_1_29=3, var_1_30=3, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=7, var_1_6=154, var_1_7=-258, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.1s, OverallIterations: 9, TraceHistogramMax: 37, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1837 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1797 mSDsluCounter, 4852 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3594 mSDsCounter, 983 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3422 IncrementalHoareTripleChecker+Invalid, 4405 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 983 mSolverCounterUnsat, 1258 mSDtfsCounter, 3422 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2191 GetRequests, 2042 SyntacticMatches, 2 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1241 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=969occurred in iteration=7, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 784 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 3526 NumberOfCodeBlocks, 3526 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3042 ConstructedInterpolants, 2 QuantifiedInterpolants, 18505 SizeOfPredicates, 23 NumberOfNonLiveVariables, 2708 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 33375/34632 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 21:15:39,444 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_fillercode_fillercodestructure_filler-pr-cn_file-42.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 063560dffd28e6ff007173441068d18177141fab7727eec62b2f4e0016a02efd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:15:41,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:15:41,480 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 21:15:41,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:15:41,485 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:15:41,503 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:15:41,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:15:41,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:15:41,504 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:15:41,504 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:15:41,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:15:41,504 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:15:41,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:15:41,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:15:41,504 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:15:41,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:15:41,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:15:41,504 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:15:41,504 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:15:41,504 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:15:41,504 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:15:41,506 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:15:41,506 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:15:41,506 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 21:15:41,506 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 21:15:41,506 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 21:15:41,506 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:15:41,506 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:15:41,506 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:15:41,506 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:15:41,506 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:15:41,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:15:41,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:15:41,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:15:41,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:15:41,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:15:41,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:15:41,506 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:15:41,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:15:41,506 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 21:15:41,506 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 21:15:41,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:15:41,507 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:15:41,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:15:41,507 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:15:41,507 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 -> 063560dffd28e6ff007173441068d18177141fab7727eec62b2f4e0016a02efd [2025-03-03 21:15:41,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:15:41,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:15:41,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:15:41,783 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:15:41,783 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:15:41,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-42.i [2025-03-03 21:15:42,961 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a3aad873/e39fb36ce0134bcca42d245bb75dc260/FLAGc2cb3afeb [2025-03-03 21:15:43,177 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:15:43,179 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-42.i [2025-03-03 21:15:43,186 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a3aad873/e39fb36ce0134bcca42d245bb75dc260/FLAGc2cb3afeb [2025-03-03 21:15:43,201 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a3aad873/e39fb36ce0134bcca42d245bb75dc260 [2025-03-03 21:15:43,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:15:43,206 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:15:43,207 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:15:43,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:15:43,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:15:43,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:15:43" (1/1) ... [2025-03-03 21:15:43,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c76904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:43, skipping insertion in model container [2025-03-03 21:15:43,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:15:43" (1/1) ... [2025-03-03 21:15:43,233 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:15:43,344 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_fillercode_fillercodestructure_filler-pr-cn_file-42.i[919,932] [2025-03-03 21:15:43,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:15:43,435 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:15:43,447 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_fillercode_fillercodestructure_filler-pr-cn_file-42.i[919,932] [2025-03-03 21:15:43,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:15:43,501 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:15:43,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:43 WrapperNode [2025-03-03 21:15:43,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:15:43,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:15:43,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:15:43,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:15:43,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:43" (1/1) ... [2025-03-03 21:15:43,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:43" (1/1) ... [2025-03-03 21:15:43,555 INFO L138 Inliner]: procedures = 27, calls = 50, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2025-03-03 21:15:43,559 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:15:43,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:15:43,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:15:43,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:15:43,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:43" (1/1) ... [2025-03-03 21:15:43,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:43" (1/1) ... [2025-03-03 21:15:43,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:43" (1/1) ... [2025-03-03 21:15:43,591 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:15:43,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:43" (1/1) ... [2025-03-03 21:15:43,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:43" (1/1) ... [2025-03-03 21:15:43,605 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:43" (1/1) ... [2025-03-03 21:15:43,607 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:43" (1/1) ... [2025-03-03 21:15:43,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:43" (1/1) ... [2025-03-03 21:15:43,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:43" (1/1) ... [2025-03-03 21:15:43,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:15:43,621 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:15:43,621 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:15:43,621 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:15:43,622 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:43" (1/1) ... [2025-03-03 21:15:43,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:15:43,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:15:43,655 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:15:43,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:15:43,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:15:43,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 21:15:43,673 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:15:43,673 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:15:43,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:15:43,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:15:43,740 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:15:43,741 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:15:44,383 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-03 21:15:44,384 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:15:44,398 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:15:44,399 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:15:44,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:15:44 BoogieIcfgContainer [2025-03-03 21:15:44,399 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:15:44,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:15:44,401 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:15:44,406 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:15:44,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:15:43" (1/3) ... [2025-03-03 21:15:44,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ae118a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:15:44, skipping insertion in model container [2025-03-03 21:15:44,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:15:43" (2/3) ... [2025-03-03 21:15:44,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ae118a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:15:44, skipping insertion in model container [2025-03-03 21:15:44,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:15:44" (3/3) ... [2025-03-03 21:15:44,409 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-42.i [2025-03-03 21:15:44,420 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:15:44,422 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-42.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:15:44,472 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:15:44,481 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;@51f53190, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:15:44,482 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:15:44,486 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-03 21:15:44,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-03 21:15:44,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:15:44,524 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:15:44,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:15:44,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:15:44,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1692044333, now seen corresponding path program 1 times [2025-03-03 21:15:44,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:15:44,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516554870] [2025-03-03 21:15:44,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:15:44,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:15:44,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:15:44,541 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:15:44,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 21:15:44,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-03 21:15:44,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-03 21:15:44,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:15:44,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:15:44,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:15:44,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:15:44,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 884 proven. 0 refuted. 0 times theorem prover too weak. 1780 trivial. 0 not checked. [2025-03-03 21:15:44,932 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:15:44,933 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:15:44,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516554870] [2025-03-03 21:15:44,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516554870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:15:44,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:15:44,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:15:44,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009450574] [2025-03-03 21:15:44,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:15:44,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:15:44,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:15:44,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:15:44,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:15:44,953 INFO L87 Difference]: Start difference. First operand has 100 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-03 21:15:44,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:15:44,976 INFO L93 Difference]: Finished difference Result 193 states and 348 transitions. [2025-03-03 21:15:44,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:15:44,977 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 234 [2025-03-03 21:15:44,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:15:44,985 INFO L225 Difference]: With dead ends: 193 [2025-03-03 21:15:44,985 INFO L226 Difference]: Without dead ends: 96 [2025-03-03 21:15:44,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:15:44,989 INFO L435 NwaCegarLoop]: 151 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, 151 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:15:44,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:15:44,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-03 21:15:45,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-03 21:15:45,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 57 states have internal predecessors, (77), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-03 21:15:45,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 151 transitions. [2025-03-03 21:15:45,031 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 151 transitions. Word has length 234 [2025-03-03 21:15:45,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:15:45,031 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 151 transitions. [2025-03-03 21:15:45,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-03 21:15:45,031 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 151 transitions. [2025-03-03 21:15:45,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-03 21:15:45,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:15:45,034 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:15:45,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 21:15:45,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:15:45,235 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:15:45,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:15:45,235 INFO L85 PathProgramCache]: Analyzing trace with hash 310133900, now seen corresponding path program 1 times [2025-03-03 21:15:45,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:15:45,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121346036] [2025-03-03 21:15:45,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:15:45,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:15:45,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:15:45,238 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:15:45,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 21:15:45,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-03 21:15:45,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-03 21:15:45,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:15:45,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:15:45,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 21:15:45,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:15:45,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-03 21:15:45,933 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:15:45,933 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:15:45,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121346036] [2025-03-03 21:15:45,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121346036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:15:45,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:15:45,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:15:45,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530196782] [2025-03-03 21:15:45,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:15:45,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:15:45,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:15:45,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:15:45,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:15:45,939 INFO L87 Difference]: Start difference. First operand 96 states and 151 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 21:15:46,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:15:46,324 INFO L93 Difference]: Finished difference Result 283 states and 448 transitions. [2025-03-03 21:15:46,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:15:46,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 234 [2025-03-03 21:15:46,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:15:46,333 INFO L225 Difference]: With dead ends: 283 [2025-03-03 21:15:46,334 INFO L226 Difference]: Without dead ends: 190 [2025-03-03 21:15:46,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:15:46,335 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 114 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:15:46,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 435 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:15:46,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-03 21:15:46,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 160. [2025-03-03 21:15:46,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 states have internal predecessors, (103), 74 states have call successors, (74), 2 states have call predecessors, (74), 2 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 21:15:46,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 251 transitions. [2025-03-03 21:15:46,375 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 251 transitions. Word has length 234 [2025-03-03 21:15:46,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:15:46,375 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 251 transitions. [2025-03-03 21:15:46,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 21:15:46,375 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 251 transitions. [2025-03-03 21:15:46,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 21:15:46,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:15:46,380 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:15:46,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-03 21:15:46,580 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-03 21:15:46,580 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:15:46,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:15:46,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1782325657, now seen corresponding path program 1 times [2025-03-03 21:15:46,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:15:46,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754207308] [2025-03-03 21:15:46,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:15:46,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:15:46,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:15:46,584 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-03 21:15:46,584 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-03 21:15:46,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 21:15:46,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 21:15:46,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:15:46,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:15:46,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 21:15:46,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:15:47,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-03 21:15:47,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:15:47,689 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:15:47,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754207308] [2025-03-03 21:15:47,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754207308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:15:47,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:15:47,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:15:47,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281198167] [2025-03-03 21:15:47,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:15:47,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:15:47,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:15:47,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:15:47,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:15:47,692 INFO L87 Difference]: Start difference. First operand 160 states and 251 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 21:15:48,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:15:48,446 INFO L93 Difference]: Finished difference Result 409 states and 651 transitions. [2025-03-03 21:15:48,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 21:15:48,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 235 [2025-03-03 21:15:48,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:15:48,454 INFO L225 Difference]: With dead ends: 409 [2025-03-03 21:15:48,454 INFO L226 Difference]: Without dead ends: 316 [2025-03-03 21:15:48,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:15:48,455 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 161 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 21:15:48,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 621 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 21:15:48,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-03 21:15:48,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 251. [2025-03-03 21:15:48,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 136 states have (on average 1.286764705882353) internal successors, (175), 136 states have internal predecessors, (175), 111 states have call successors, (111), 3 states have call predecessors, (111), 3 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2025-03-03 21:15:48,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 397 transitions. [2025-03-03 21:15:48,494 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 397 transitions. Word has length 235 [2025-03-03 21:15:48,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:15:48,495 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 397 transitions. [2025-03-03 21:15:48,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 21:15:48,495 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 397 transitions. [2025-03-03 21:15:48,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 21:15:48,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:15:48,498 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:15:48,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-03 21:15:48,698 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 [2025-03-03 21:15:48,699 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:15:48,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:15:48,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1715318904, now seen corresponding path program 1 times [2025-03-03 21:15:48,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:15:48,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323778526] [2025-03-03 21:15:48,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:15:48,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:15:48,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:15:48,702 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:15:48,703 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 (5)] Waiting until timeout for monitored process [2025-03-03 21:15:48,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 21:15:48,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 21:15:48,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:15:48,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:15:48,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 21:15:48,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:15:48,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-03 21:15:48,997 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:15:48,997 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:15:48,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323778526] [2025-03-03 21:15:48,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323778526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:15:48,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:15:48,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:15:48,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953658487] [2025-03-03 21:15:48,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:15:48,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:15:48,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:15:48,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:15:48,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:15:48,998 INFO L87 Difference]: Start difference. First operand 251 states and 397 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 21:15:49,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:15:49,126 INFO L93 Difference]: Finished difference Result 435 states and 691 transitions. [2025-03-03 21:15:49,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:15:49,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 235 [2025-03-03 21:15:49,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:15:49,134 INFO L225 Difference]: With dead ends: 435 [2025-03-03 21:15:49,134 INFO L226 Difference]: Without dead ends: 251 [2025-03-03 21:15:49,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:15:49,135 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:15:49,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:15:49,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-03 21:15:49,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2025-03-03 21:15:49,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 136 states have (on average 1.2720588235294117) internal successors, (173), 136 states have internal predecessors, (173), 111 states have call successors, (111), 3 states have call predecessors, (111), 3 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2025-03-03 21:15:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 395 transitions. [2025-03-03 21:15:49,155 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 395 transitions. Word has length 235 [2025-03-03 21:15:49,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:15:49,156 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 395 transitions. [2025-03-03 21:15:49,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 21:15:49,156 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 395 transitions. [2025-03-03 21:15:49,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 21:15:49,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:15:49,158 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:15:49,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-03-03 21:15:49,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:15:49,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:15:49,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:15:49,359 INFO L85 PathProgramCache]: Analyzing trace with hash -81632455, now seen corresponding path program 1 times [2025-03-03 21:15:49,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:15:49,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87638663] [2025-03-03 21:15:49,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:15:49,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:15:49,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:15:49,363 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-03 21:15:49,366 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-03 21:15:49,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 21:15:49,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 21:15:49,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:15:49,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:15:49,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 21:15:49,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:15:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1199 proven. 159 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2025-03-03 21:15:50,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:15:50,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 51 proven. 162 refuted. 0 times theorem prover too weak. 2451 trivial. 0 not checked. [2025-03-03 21:15:50,539 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:15:50,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87638663] [2025-03-03 21:15:50,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87638663] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:15:50,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:15:50,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2025-03-03 21:15:50,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233274889] [2025-03-03 21:15:50,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:15:50,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 21:15:50,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:15:50,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 21:15:50,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:15:50,540 INFO L87 Difference]: Start difference. First operand 251 states and 395 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2025-03-03 21:15:51,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:15:51,660 INFO L93 Difference]: Finished difference Result 510 states and 765 transitions. [2025-03-03 21:15:51,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 21:15:51,661 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) Word has length 235 [2025-03-03 21:15:51,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:15:51,663 INFO L225 Difference]: With dead ends: 510 [2025-03-03 21:15:51,663 INFO L226 Difference]: Without dead ends: 417 [2025-03-03 21:15:51,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 458 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 21:15:51,669 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 351 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 21:15:51,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 625 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 21:15:51,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-03 21:15:51,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 391. [2025-03-03 21:15:51,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 230 states have (on average 1.2826086956521738) internal successors, (295), 230 states have internal predecessors, (295), 148 states have call successors, (148), 12 states have call predecessors, (148), 12 states have return successors, (148), 148 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-03 21:15:51,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 591 transitions. [2025-03-03 21:15:51,711 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 591 transitions. Word has length 235 [2025-03-03 21:15:51,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:15:51,713 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 591 transitions. [2025-03-03 21:15:51,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2025-03-03 21:15:51,713 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 591 transitions. [2025-03-03 21:15:51,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 21:15:51,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:15:51,715 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:15:51,727 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 (6)] Ended with exit code 0 [2025-03-03 21:15:51,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:15:51,916 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:15:51,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:15:51,916 INFO L85 PathProgramCache]: Analyzing trace with hash -926104326, now seen corresponding path program 1 times [2025-03-03 21:15:51,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:15:51,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775687964] [2025-03-03 21:15:51,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:15:51,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:15:51,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:15:51,921 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:15:51,922 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 (7)] Waiting until timeout for monitored process [2025-03-03 21:15:51,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 21:15:52,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 21:15:52,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:15:52,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:15:52,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 21:15:52,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:15:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 312 proven. 102 refuted. 0 times theorem prover too weak. 2250 trivial. 0 not checked. [2025-03-03 21:15:52,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:15:53,314 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:15:53,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775687964] [2025-03-03 21:15:53,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775687964] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:15:53,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1501153878] [2025-03-03 21:15:53,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:15:53,315 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 21:15:53,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 21:15:53,317 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 21:15:53,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-03-03 21:15:53,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 21:15:54,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 21:15:54,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:15:54,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:15:54,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 21:15:54,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:15:54,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-03 21:15:54,570 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:15:54,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1501153878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:15:54,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:15:54,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-03 21:15:54,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496052841] [2025-03-03 21:15:54,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:15:54,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:15:54,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:15:54,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:15:54,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:15:54,571 INFO L87 Difference]: Start difference. First operand 391 states and 591 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 21:15:56,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:15:56,322 INFO L93 Difference]: Finished difference Result 1035 states and 1551 transitions. [2025-03-03 21:15:56,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 21:15:56,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 235 [2025-03-03 21:15:56,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:15:56,332 INFO L225 Difference]: With dead ends: 1035 [2025-03-03 21:15:56,333 INFO L226 Difference]: Without dead ends: 836 [2025-03-03 21:15:56,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:15:56,334 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 200 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:15:56,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 636 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 21:15:56,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2025-03-03 21:15:56,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 748. [2025-03-03 21:15:56,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 461 states have (on average 1.3058568329718003) internal successors, (602), 463 states have internal predecessors, (602), 263 states have call successors, (263), 23 states have call predecessors, (263), 23 states have return successors, (263), 261 states have call predecessors, (263), 263 states have call successors, (263) [2025-03-03 21:15:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1128 transitions. [2025-03-03 21:15:56,418 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1128 transitions. Word has length 235 [2025-03-03 21:15:56,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:15:56,419 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 1128 transitions. [2025-03-03 21:15:56,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 21:15:56,419 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1128 transitions. [2025-03-03 21:15:56,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 21:15:56,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:15:56,421 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:15:56,431 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 (7)] Ended with exit code 0 [2025-03-03 21:15:56,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2025-03-03 21:15:56,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 21:15:56,822 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:15:56,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:15:56,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1923176679, now seen corresponding path program 1 times [2025-03-03 21:15:56,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:15:56,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076013563] [2025-03-03 21:15:56,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:15:56,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:15:56,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:15:56,826 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:15:56,827 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 (9)] Waiting until timeout for monitored process [2025-03-03 21:15:56,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 21:15:57,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 21:15:57,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:15:57,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:15:57,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 21:15:57,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:15:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 312 proven. 102 refuted. 0 times theorem prover too weak. 2250 trivial. 0 not checked. [2025-03-03 21:15:57,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:15:58,097 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:15:58,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076013563] [2025-03-03 21:15:58,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1076013563] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:15:58,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1564964732] [2025-03-03 21:15:58,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:15:58,098 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 21:15:58,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 21:15:58,100 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 21:15:58,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-03-03 21:15:58,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 21:15:58,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 21:15:58,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:15:58,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:15:58,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 21:15:58,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:15:59,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-03 21:15:59,521 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:15:59,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1564964732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:15:59,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:15:59,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-03-03 21:15:59,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828367563] [2025-03-03 21:15:59,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:15:59,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:15:59,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:15:59,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:15:59,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:15:59,522 INFO L87 Difference]: Start difference. First operand 748 states and 1128 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 21:16:01,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:16:01,265 INFO L93 Difference]: Finished difference Result 1300 states and 1960 transitions. [2025-03-03 21:16:01,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:16:01,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 235 [2025-03-03 21:16:01,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:16:01,275 INFO L225 Difference]: With dead ends: 1300 [2025-03-03 21:16:01,275 INFO L226 Difference]: Without dead ends: 996 [2025-03-03 21:16:01,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 484 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:16:01,277 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 131 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:16:01,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 548 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 21:16:01,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2025-03-03 21:16:01,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 945. [2025-03-03 21:16:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 578 states have (on average 1.2993079584775087) internal successors, (751), 580 states have internal predecessors, (751), 337 states have call successors, (337), 29 states have call predecessors, (337), 29 states have return successors, (337), 335 states have call predecessors, (337), 337 states have call successors, (337) [2025-03-03 21:16:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1425 transitions. [2025-03-03 21:16:01,364 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1425 transitions. Word has length 235 [2025-03-03 21:16:01,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:16:01,364 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1425 transitions. [2025-03-03 21:16:01,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 21:16:01,365 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1425 transitions. [2025-03-03 21:16:01,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-03 21:16:01,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:16:01,366 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:16:01,379 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 (9)] Ended with exit code 0 [2025-03-03 21:16:01,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2025-03-03 21:16:01,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 21:16:01,768 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:16:01,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:16:01,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1388056527, now seen corresponding path program 1 times [2025-03-03 21:16:01,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:16:01,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1848060227] [2025-03-03 21:16:01,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:16:01,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:16:01,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:16:01,770 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:16:01,771 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 (11)] Waiting until timeout for monitored process [2025-03-03 21:16:01,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 21:16:02,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 21:16:02,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:16:02,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:16:02,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 21:16:02,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:16:02,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 312 proven. 102 refuted. 0 times theorem prover too weak. 2250 trivial. 0 not checked. [2025-03-03 21:16:02,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:16:03,013 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:16:03,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1848060227] [2025-03-03 21:16:03,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1848060227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:16:03,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1783561074] [2025-03-03 21:16:03,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:16:03,013 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 21:16:03,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 21:16:03,015 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 21:16:03,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-03-03 21:16:03,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 21:16:03,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 21:16:03,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:16:03,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:16:03,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 21:16:03,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:16:04,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 312 proven. 102 refuted. 0 times theorem prover too weak. 2250 trivial. 0 not checked. [2025-03-03 21:16:04,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:16:04,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1783561074] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:16:04,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:16:04,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-03-03 21:16:04,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766966226] [2025-03-03 21:16:04,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:16:04,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 21:16:04,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:16:04,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 21:16:04,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:16:04,585 INFO L87 Difference]: Start difference. First operand 945 states and 1425 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-03 21:16:05,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:16:05,530 INFO L93 Difference]: Finished difference Result 1278 states and 1895 transitions. [2025-03-03 21:16:05,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 21:16:05,536 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 236 [2025-03-03 21:16:05,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:16:05,542 INFO L225 Difference]: With dead ends: 1278 [2025-03-03 21:16:05,542 INFO L226 Difference]: Without dead ends: 827 [2025-03-03 21:16:05,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2025-03-03 21:16:05,543 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 205 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:16:05,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 772 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 21:16:05,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2025-03-03 21:16:05,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 719. [2025-03-03 21:16:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 434 states have (on average 1.2788018433179724) internal successors, (555), 434 states have internal predecessors, (555), 259 states have call successors, (259), 25 states have call predecessors, (259), 25 states have return successors, (259), 259 states have call predecessors, (259), 259 states have call successors, (259) [2025-03-03 21:16:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1073 transitions. [2025-03-03 21:16:05,616 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1073 transitions. Word has length 236 [2025-03-03 21:16:05,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:16:05,616 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 1073 transitions. [2025-03-03 21:16:05,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-03 21:16:05,617 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1073 transitions. [2025-03-03 21:16:05,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-03 21:16:05,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:16:05,618 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:16:05,628 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 (11)] Ended with exit code 0 [2025-03-03 21:16:05,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2025-03-03 21:16:06,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 21:16:06,019 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:16:06,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:16:06,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1893615152, now seen corresponding path program 1 times [2025-03-03 21:16:06,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:16:06,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860140268] [2025-03-03 21:16:06,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:16:06,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:16:06,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:16:06,022 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:16:06,023 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 (13)] Waiting until timeout for monitored process [2025-03-03 21:16:06,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 21:16:06,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 21:16:06,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:16:06,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:16:06,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 21:16:06,275 INFO L279 TraceCheckSpWp]: Computing forward predicates...