./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-85.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 ad5d1ae9c41c5ead7b162591ee3109c786bcb523ca4e884a3cf08883cc71895e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:44:17,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:44:17,225 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 12:44:17,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:44:17,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:44:17,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:44:17,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:44:17,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:44:17,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:44:17,250 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:44:17,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:44:17,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:44:17,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:44:17,250 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:44:17,250 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:44:17,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:44:17,250 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:44:17,251 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:44:17,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 12:44:17,251 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:44:17,251 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:44:17,251 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:44:17,251 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:44:17,251 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:44:17,251 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:44:17,251 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:44:17,251 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:44:17,251 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:44:17,251 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:44:17,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:44:17,251 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:44:17,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:44:17,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:44:17,251 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:44:17,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:44:17,251 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:44:17,251 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:44:17,251 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 12:44:17,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 12:44:17,252 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:44:17,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:44:17,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:44:17,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:44:17,252 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 -> ad5d1ae9c41c5ead7b162591ee3109c786bcb523ca4e884a3cf08883cc71895e [2025-03-08 12:44:17,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:44:17,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:44:17,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:44:17,491 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:44:17,491 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:44:17,492 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-co_file-85.i [2025-03-08 12:44:18,641 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebced6cee/06bca52a1c7a480e91524a8f83f31518/FLAGbb5cc4168 [2025-03-08 12:44:18,916 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:44:18,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-85.i [2025-03-08 12:44:18,926 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebced6cee/06bca52a1c7a480e91524a8f83f31518/FLAGbb5cc4168 [2025-03-08 12:44:19,211 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebced6cee/06bca52a1c7a480e91524a8f83f31518 [2025-03-08 12:44:19,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:44:19,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:44:19,216 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:44:19,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:44:19,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:44:19,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:44:19" (1/1) ... [2025-03-08 12:44:19,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d389e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:19, skipping insertion in model container [2025-03-08 12:44:19,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:44:19" (1/1) ... [2025-03-08 12:44:19,239 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:44:19,343 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-co_file-85.i[919,932] [2025-03-08 12:44:19,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:44:19,419 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:44:19,426 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-co_file-85.i[919,932] [2025-03-08 12:44:19,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:44:19,466 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:44:19,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:19 WrapperNode [2025-03-08 12:44:19,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:44:19,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:44:19,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:44:19,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:44:19,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:19" (1/1) ... [2025-03-08 12:44:19,483 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:19" (1/1) ... [2025-03-08 12:44:19,514 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2025-03-08 12:44:19,514 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:44:19,515 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:44:19,515 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:44:19,515 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:44:19,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:19" (1/1) ... [2025-03-08 12:44:19,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:19" (1/1) ... [2025-03-08 12:44:19,525 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:19" (1/1) ... [2025-03-08 12:44:19,544 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 12:44:19,547 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:19" (1/1) ... [2025-03-08 12:44:19,547 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:19" (1/1) ... [2025-03-08 12:44:19,553 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:19" (1/1) ... [2025-03-08 12:44:19,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:19" (1/1) ... [2025-03-08 12:44:19,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:19" (1/1) ... [2025-03-08 12:44:19,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:19" (1/1) ... [2025-03-08 12:44:19,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:44:19,559 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:44:19,559 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:44:19,559 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:44:19,560 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:19" (1/1) ... [2025-03-08 12:44:19,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:44:19,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:44:19,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 12:44:19,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 12:44:19,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:44:19,602 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:44:19,603 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:44:19,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 12:44:19,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:44:19,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:44:19,669 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:44:19,670 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:44:19,933 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 12:44:19,934 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:44:19,947 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:44:19,947 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 12:44:19,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:44:19 BoogieIcfgContainer [2025-03-08 12:44:19,948 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:44:19,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:44:19,950 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:44:19,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:44:19,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:44:19" (1/3) ... [2025-03-08 12:44:19,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e9585c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:44:19, skipping insertion in model container [2025-03-08 12:44:19,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:19" (2/3) ... [2025-03-08 12:44:19,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e9585c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:44:19, skipping insertion in model container [2025-03-08 12:44:19,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:44:19" (3/3) ... [2025-03-08 12:44:19,955 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-85.i [2025-03-08 12:44:19,965 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:44:19,966 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-85.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:44:20,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:44:20,013 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;@4969b62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:44:20,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:44:20,017 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 12:44:20,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 12:44:20,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:44:20,029 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:44:20,030 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:44:20,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:44:20,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1369102714, now seen corresponding path program 1 times [2025-03-08 12:44:20,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:44:20,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516316462] [2025-03-08 12:44:20,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:44:20,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:44:20,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 12:44:20,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 12:44:20,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:44:20,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:44:20,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-03-08 12:44:20,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:44:20,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516316462] [2025-03-08 12:44:20,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516316462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:44:20,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617136290] [2025-03-08 12:44:20,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:44:20,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:44:20,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:44:20,359 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:44:20,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 12:44:20,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 12:44:20,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 12:44:20,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:44:20,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:44:20,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:44:20,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:44:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-03-08 12:44:20,531 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:44:20,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617136290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:44:20,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:44:20,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 12:44:20,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657289590] [2025-03-08 12:44:20,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:44:20,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:44:20,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:44:20,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:44:20,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:44:20,552 INFO L87 Difference]: Start difference. First operand has 89 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-08 12:44:20,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:44:20,575 INFO L93 Difference]: Finished difference Result 172 states and 303 transitions. [2025-03-08 12:44:20,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:44:20,578 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 190 [2025-03-08 12:44:20,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:44:20,583 INFO L225 Difference]: With dead ends: 172 [2025-03-08 12:44:20,583 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 12:44:20,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:44:20,589 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:44:20,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:44:20,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 12:44:20,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-08 12:44:20,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 12:44:20,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 133 transitions. [2025-03-08 12:44:20,625 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 133 transitions. Word has length 190 [2025-03-08 12:44:20,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:44:20,625 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 133 transitions. [2025-03-08 12:44:20,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-08 12:44:20,625 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 133 transitions. [2025-03-08 12:44:20,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 12:44:20,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:44:20,632 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:44:20,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 12:44:20,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 12:44:20,833 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:44:20,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:44:20,834 INFO L85 PathProgramCache]: Analyzing trace with hash -2029715976, now seen corresponding path program 1 times [2025-03-08 12:44:20,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:44:20,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689081837] [2025-03-08 12:44:20,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:44:20,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:44:20,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 12:44:20,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 12:44:20,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:44:20,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:44:21,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-08 12:44:21,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:44:21,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689081837] [2025-03-08 12:44:21,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689081837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:44:21,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:44:21,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:44:21,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894683274] [2025-03-08 12:44:21,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:44:21,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:44:21,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:44:21,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:44:21,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:44:21,242 INFO L87 Difference]: Start difference. First operand 86 states and 133 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 12:44:21,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:44:21,296 INFO L93 Difference]: Finished difference Result 235 states and 368 transitions. [2025-03-08 12:44:21,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:44:21,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 190 [2025-03-08 12:44:21,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:44:21,298 INFO L225 Difference]: With dead ends: 235 [2025-03-08 12:44:21,298 INFO L226 Difference]: Without dead ends: 152 [2025-03-08 12:44:21,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:44:21,301 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 52 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:44:21,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 244 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:44:21,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-08 12:44:21,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 143. [2025-03-08 12:44:21,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 80 states have (on average 1.275) internal successors, (102), 80 states have internal predecessors, (102), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 12:44:21,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 222 transitions. [2025-03-08 12:44:21,323 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 222 transitions. Word has length 190 [2025-03-08 12:44:21,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:44:21,325 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 222 transitions. [2025-03-08 12:44:21,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 12:44:21,326 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 222 transitions. [2025-03-08 12:44:21,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 12:44:21,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:44:21,328 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:44:21,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 12:44:21,328 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:44:21,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:44:21,329 INFO L85 PathProgramCache]: Analyzing trace with hash -2094101179, now seen corresponding path program 1 times [2025-03-08 12:44:21,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:44:21,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835024247] [2025-03-08 12:44:21,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:44:21,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:44:21,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 12:44:21,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 12:44:21,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:44:21,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:44:21,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-08 12:44:21,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:44:21,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835024247] [2025-03-08 12:44:21,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835024247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:44:21,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:44:21,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:44:21,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406975010] [2025-03-08 12:44:21,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:44:21,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:44:21,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:44:21,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:44:21,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:44:21,632 INFO L87 Difference]: Start difference. First operand 143 states and 222 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 12:44:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:44:21,687 INFO L93 Difference]: Finished difference Result 238 states and 371 transitions. [2025-03-08 12:44:21,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:44:21,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 191 [2025-03-08 12:44:21,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:44:21,690 INFO L225 Difference]: With dead ends: 238 [2025-03-08 12:44:21,692 INFO L226 Difference]: Without dead ends: 155 [2025-03-08 12:44:21,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:44:21,693 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 54 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:44:21,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 256 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:44:21,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-08 12:44:21,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2025-03-08 12:44:21,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 82 states have internal predecessors, (104), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 12:44:21,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 224 transitions. [2025-03-08 12:44:21,717 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 224 transitions. Word has length 191 [2025-03-08 12:44:21,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:44:21,718 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 224 transitions. [2025-03-08 12:44:21,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 12:44:21,719 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 224 transitions. [2025-03-08 12:44:21,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 12:44:21,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:44:21,721 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:44:21,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 12:44:21,721 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:44:21,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:44:21,722 INFO L85 PathProgramCache]: Analyzing trace with hash 2009841308, now seen corresponding path program 1 times [2025-03-08 12:44:21,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:44:21,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869251195] [2025-03-08 12:44:21,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:44:21,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:44:21,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 12:44:21,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 12:44:21,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:44:21,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:44:22,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-08 12:44:22,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:44:22,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869251195] [2025-03-08 12:44:22,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869251195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:44:22,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:44:22,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 12:44:22,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648346970] [2025-03-08 12:44:22,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:44:22,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:44:22,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:44:22,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:44:22,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:44:22,121 INFO L87 Difference]: Start difference. First operand 145 states and 224 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 12:44:22,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:44:22,389 INFO L93 Difference]: Finished difference Result 342 states and 530 transitions. [2025-03-08 12:44:22,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 12:44:22,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 194 [2025-03-08 12:44:22,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:44:22,392 INFO L225 Difference]: With dead ends: 342 [2025-03-08 12:44:22,392 INFO L226 Difference]: Without dead ends: 259 [2025-03-08 12:44:22,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 12:44:22,394 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 201 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:44:22,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 519 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:44:22,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-08 12:44:22,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 239. [2025-03-08 12:44:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 145 states have (on average 1.3172413793103448) internal successors, (191), 145 states have internal predecessors, (191), 90 states have call successors, (90), 3 states have call predecessors, (90), 3 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-08 12:44:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 371 transitions. [2025-03-08 12:44:22,443 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 371 transitions. Word has length 194 [2025-03-08 12:44:22,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:44:22,443 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 371 transitions. [2025-03-08 12:44:22,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 12:44:22,444 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 371 transitions. [2025-03-08 12:44:22,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 12:44:22,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:44:22,445 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:44:22,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 12:44:22,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:44:22,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:44:22,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1779567363, now seen corresponding path program 1 times [2025-03-08 12:44:22,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:44:22,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448953128] [2025-03-08 12:44:22,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:44:22,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:44:22,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 12:44:22,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 12:44:22,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:44:22,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:44:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-08 12:44:22,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:44:22,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448953128] [2025-03-08 12:44:22,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448953128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:44:22,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:44:22,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:44:22,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987893877] [2025-03-08 12:44:22,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:44:22,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:44:22,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:44:22,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:44:22,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:44:22,974 INFO L87 Difference]: Start difference. First operand 239 states and 371 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 12:44:23,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:44:23,279 INFO L93 Difference]: Finished difference Result 461 states and 718 transitions. [2025-03-08 12:44:23,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:44:23,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 194 [2025-03-08 12:44:23,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:44:23,282 INFO L225 Difference]: With dead ends: 461 [2025-03-08 12:44:23,282 INFO L226 Difference]: Without dead ends: 287 [2025-03-08 12:44:23,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:44:23,283 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 105 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:44:23,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 410 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:44:23,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-08 12:44:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2025-03-08 12:44:23,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 171 states have (on average 1.3391812865497077) internal successors, (229), 171 states have internal predecessors, (229), 90 states have call successors, (90), 3 states have call predecessors, (90), 3 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-08 12:44:23,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 409 transitions. [2025-03-08 12:44:23,328 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 409 transitions. Word has length 194 [2025-03-08 12:44:23,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:44:23,328 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 409 transitions. [2025-03-08 12:44:23,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 12:44:23,329 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 409 transitions. [2025-03-08 12:44:23,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 12:44:23,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:44:23,330 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:44:23,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 12:44:23,330 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:44:23,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:44:23,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1976080868, now seen corresponding path program 1 times [2025-03-08 12:44:23,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:44:23,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693119901] [2025-03-08 12:44:23,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:44:23,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:44:23,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 12:44:23,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 12:44:23,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:44:23,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:44:23,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-08 12:44:23,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:44:23,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693119901] [2025-03-08 12:44:23,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693119901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:44:23,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:44:23,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:44:23,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861543939] [2025-03-08 12:44:23,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:44:23,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:44:23,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:44:23,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:44:23,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:44:23,745 INFO L87 Difference]: Start difference. First operand 265 states and 409 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 12:44:24,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:44:24,060 INFO L93 Difference]: Finished difference Result 360 states and 555 transitions. [2025-03-08 12:44:24,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:44:24,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 194 [2025-03-08 12:44:24,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:44:24,062 INFO L225 Difference]: With dead ends: 360 [2025-03-08 12:44:24,062 INFO L226 Difference]: Without dead ends: 170 [2025-03-08 12:44:24,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:44:24,063 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 92 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:44:24,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 412 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:44:24,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-08 12:44:24,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 158. [2025-03-08 12:44:24,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 95 states have (on average 1.2842105263157895) internal successors, (122), 95 states have internal predecessors, (122), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 12:44:24,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 242 transitions. [2025-03-08 12:44:24,095 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 242 transitions. Word has length 194 [2025-03-08 12:44:24,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:44:24,095 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 242 transitions. [2025-03-08 12:44:24,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 12:44:24,095 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 242 transitions. [2025-03-08 12:44:24,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-08 12:44:24,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:44:24,097 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:44:24,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 12:44:24,097 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:44:24,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:44:24,098 INFO L85 PathProgramCache]: Analyzing trace with hash 367215465, now seen corresponding path program 1 times [2025-03-08 12:44:24,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:44:24,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814007016] [2025-03-08 12:44:24,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:44:24,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:44:24,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 12:44:24,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 12:44:24,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:44:24,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:44:24,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-08 12:44:24,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:44:24,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814007016] [2025-03-08 12:44:24,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814007016] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:44:24,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601785786] [2025-03-08 12:44:24,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:44:24,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:44:24,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:44:24,676 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:44:24,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 12:44:24,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 12:44:24,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 12:44:24,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:44:24,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:44:24,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 12:44:24,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:44:25,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 869 proven. 51 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-03-08 12:44:25,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:44:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-08 12:44:26,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601785786] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:44:26,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:44:26,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25 [2025-03-08 12:44:26,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716760165] [2025-03-08 12:44:26,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:44:26,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 12:44:26,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:44:26,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 12:44:26,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2025-03-08 12:44:26,405 INFO L87 Difference]: Start difference. First operand 158 states and 242 transitions. Second operand has 25 states, 25 states have (on average 5.24) internal successors, (131), 25 states have internal predecessors, (131), 6 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 6 states have call predecessors, (90), 6 states have call successors, (90) [2025-03-08 12:44:28,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:44:28,382 INFO L93 Difference]: Finished difference Result 511 states and 753 transitions. [2025-03-08 12:44:28,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-03-08 12:44:28,382 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.24) internal successors, (131), 25 states have internal predecessors, (131), 6 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 6 states have call predecessors, (90), 6 states have call successors, (90) Word has length 195 [2025-03-08 12:44:28,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:44:28,385 INFO L225 Difference]: With dead ends: 511 [2025-03-08 12:44:28,385 INFO L226 Difference]: Without dead ends: 424 [2025-03-08 12:44:28,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=902, Invalid=3388, Unknown=0, NotChecked=0, Total=4290 [2025-03-08 12:44:28,387 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 952 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 605 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 605 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:44:28,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 1326 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [605 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 12:44:28,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-03-08 12:44:28,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 330. [2025-03-08 12:44:28,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 199 states have (on average 1.2412060301507537) internal successors, (247), 199 states have internal predecessors, (247), 120 states have call successors, (120), 10 states have call predecessors, (120), 10 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-08 12:44:28,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 487 transitions. [2025-03-08 12:44:28,426 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 487 transitions. Word has length 195 [2025-03-08 12:44:28,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:44:28,426 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 487 transitions. [2025-03-08 12:44:28,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.24) internal successors, (131), 25 states have internal predecessors, (131), 6 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 6 states have call predecessors, (90), 6 states have call successors, (90) [2025-03-08 12:44:28,427 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 487 transitions. [2025-03-08 12:44:28,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-08 12:44:28,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:44:28,429 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:44:28,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 12:44:28,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-08 12:44:28,633 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:44:28,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:44:28,634 INFO L85 PathProgramCache]: Analyzing trace with hash 496298184, now seen corresponding path program 1 times [2025-03-08 12:44:28,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:44:28,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681969555] [2025-03-08 12:44:28,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:44:28,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:44:28,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 12:44:28,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 12:44:28,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:44:28,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 12:44:28,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [158469712] [2025-03-08 12:44:28,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:44:28,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:44:28,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:44:28,740 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:44:28,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 12:44:28,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 12:44:29,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 12:44:29,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:44:29,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:44:29,092 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 12:44:29,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 12:44:29,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 12:44:29,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:44:29,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:44:29,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 12:44:29,269 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 12:44:29,270 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 12:44:29,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 12:44:29,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:44:29,475 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:44:29,575 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 12:44:29,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:44:29 BoogieIcfgContainer [2025-03-08 12:44:29,581 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 12:44:29,581 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 12:44:29,582 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 12:44:29,582 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 12:44:29,582 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:44:19" (3/4) ... [2025-03-08 12:44:29,584 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 12:44:29,585 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 12:44:29,586 INFO L158 Benchmark]: Toolchain (without parser) took 10369.92ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 113.8MB in the beginning and 163.9MB in the end (delta: -50.1MB). Peak memory consumption was 152.3MB. Max. memory is 16.1GB. [2025-03-08 12:44:29,586 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory was 126.0MB in the beginning and 125.8MB in the end (delta: 154.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:44:29,587 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.21ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 98.4MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 12:44:29,587 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.97ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 94.2MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:44:29,587 INFO L158 Benchmark]: Boogie Preprocessor took 43.89ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 89.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 12:44:29,587 INFO L158 Benchmark]: IcfgBuilder took 388.89ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 64.2MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 12:44:29,588 INFO L158 Benchmark]: TraceAbstraction took 9631.35ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 63.5MB in the beginning and 164.0MB in the end (delta: -100.5MB). Peak memory consumption was 102.0MB. Max. memory is 16.1GB. [2025-03-08 12:44:29,588 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 343.9MB. Free memory was 164.0MB in the beginning and 163.9MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:44:29,589 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.20ms. Allocated memory is still 201.3MB. Free memory was 126.0MB in the beginning and 125.8MB in the end (delta: 154.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.21ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 98.4MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.97ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 94.2MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.89ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 89.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 388.89ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 64.2MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9631.35ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 63.5MB in the beginning and 164.0MB in the end (delta: -100.5MB). Peak memory consumption was 102.0MB. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 343.9MB. Free memory was 164.0MB in the beginning and 163.9MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 145, overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryFLOATComparisonOperation at line 189, overapproximation of someBinaryFLOATComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 162, overapproximation of someBinaryDOUBLEComparisonOperation at line 189, overapproximation of someBinaryDOUBLEComparisonOperation at line 164, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 155, overapproximation of someBinaryDOUBLEComparisonOperation at line 153. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1000; [L23] unsigned char var_1_5 = 1; [L24] unsigned char var_1_6 = 0; [L25] float var_1_7 = 0.6; [L26] unsigned long int var_1_8 = 32; [L27] unsigned long int var_1_9 = 32; [L28] float var_1_11 = 5.5; [L29] unsigned long int var_1_12 = 128; [L30] unsigned char var_1_13 = 16; [L31] unsigned char var_1_14 = 0; [L32] unsigned long int var_1_15 = 8; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] double var_1_18 = 1.8; [L36] double var_1_19 = 4.5; [L37] double var_1_20 = 15.5; [L38] signed char var_1_21 = -5; [L39] signed char var_1_27 = 4; [L40] float var_1_28 = 8.95; [L41] float var_1_29 = 63.75; [L42] signed short int var_1_30 = -256; [L43] unsigned char var_1_31 = 0; [L44] double var_1_32 = 99999999999.2; [L45] double var_1_33 = 31.2; [L46] unsigned char var_1_35 = 1; [L47] unsigned char var_1_36 = 0; [L48] unsigned char var_1_37 = 0; [L49] unsigned char var_1_38 = 1; [L50] unsigned short int var_1_39 = 4; [L51] unsigned char var_1_40 = 4; [L52] unsigned char var_1_41 = 10; [L53] unsigned long int last_1_var_1_1 = 1000; [L54] unsigned char last_1_var_1_5 = 1; [L55] unsigned long int last_1_var_1_12 = 128; [L56] unsigned char last_1_var_1_13 = 16; [L57] unsigned long int last_1_var_1_15 = 8; VAL [isInitial=0, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L193] isInitial = 1 [L194] FCALL initially() [L195] COND TRUE 1 [L196] CALL updateLastVariables() [L182] last_1_var_1_1 = var_1_1 [L183] last_1_var_1_5 = var_1_5 [L184] last_1_var_1_12 = var_1_12 [L185] last_1_var_1_13 = var_1_13 [L186] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L196] RET updateLastVariables() [L197] CALL updateVariables() [L133] var_1_6 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L134] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L135] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L135] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L136] var_1_8 = __VERIFIER_nondet_ulong() [L137] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L137] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L138] CALL assume_abort_if_not(var_1_8 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L138] RET assume_abort_if_not(var_1_8 <= 4294967295) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L139] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=32] [L139] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=32] [L140] var_1_9 = __VERIFIER_nondet_ulong() [L141] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16] [L141] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16] [L142] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16] [L142] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16] [L143] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L143] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L144] var_1_11 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L145] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L146] var_1_14 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L147] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L148] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L148] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L149] var_1_17 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L150] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L151] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L151] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L152] var_1_19 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L153] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L154] var_1_20 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L155] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L156] var_1_27 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_27 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L157] RET assume_abort_if_not(var_1_27 >= -127) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L158] CALL assume_abort_if_not(var_1_27 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L158] RET assume_abort_if_not(var_1_27 <= 126) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_29=255/4, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L159] var_1_29 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_29 >= -922337.2036854765600e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L160] RET assume_abort_if_not((var_1_29 >= -922337.2036854765600e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_32=499999999996/5, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L161] var_1_32 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L162] RET assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_33=156/5, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L163] var_1_33 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_33 >= 0.0F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L164] RET assume_abort_if_not((var_1_33 >= 0.0F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L165] var_1_35 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_35 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L166] RET assume_abort_if_not(var_1_35 >= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L167] CALL assume_abort_if_not(var_1_35 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L167] RET assume_abort_if_not(var_1_35 <= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L168] var_1_36 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_36 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L169] RET assume_abort_if_not(var_1_36 >= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L170] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L170] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L171] var_1_39 = __VERIFIER_nondet_ushort() [L172] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L172] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L173] CALL assume_abort_if_not(var_1_39 <= 15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L173] RET assume_abort_if_not(var_1_39 <= 15) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L174] var_1_40 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L175] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L176] CALL assume_abort_if_not(var_1_40 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L176] RET assume_abort_if_not(var_1_40 <= 254) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L177] var_1_41 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_41 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L178] RET assume_abort_if_not(var_1_41 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L179] CALL assume_abort_if_not(var_1_41 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L179] RET assume_abort_if_not(var_1_41 <= 63) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L197] RET updateVariables() [L198] CALL step() [L61] signed long int stepLocal_1 = last_1_var_1_13; [L62] signed long int stepLocal_0 = last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_1=16, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L63] COND TRUE stepLocal_1 < ((- last_1_var_1_12) * 64) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L64] COND TRUE \read(last_1_var_1_5) [L65] var_1_1 = ((((last_1_var_1_12) < 0 ) ? -(last_1_var_1_12) : (last_1_var_1_12))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L74] COND TRUE \read(var_1_5) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L75] COND TRUE (var_1_13 - ((((var_1_13) < (var_1_13)) ? (var_1_13) : (var_1_13)))) <= var_1_13 [L76] var_1_21 = var_1_27 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L79] COND TRUE ! var_1_16 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L80] EXPR (var_1_12 + var_1_13) << ((((5) < (var_1_39)) ? (5) : (var_1_39))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L80] COND TRUE (var_1_1 + var_1_13) >= ((var_1_12 + var_1_13) << ((((5) < (var_1_39)) ? (5) : (var_1_39)))) [L81] COND TRUE var_1_5 && (4.166 >= var_1_29) [L82] var_1_38 = (((((((var_1_39) < (var_1_40)) ? (var_1_39) : (var_1_40))) < 0 ) ? -((((var_1_39) < (var_1_40)) ? (var_1_39) : (var_1_40))) : ((((var_1_39) < (var_1_40)) ? (var_1_39) : (var_1_40))))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L94] unsigned long int stepLocal_2 = last_1_var_1_15 + last_1_var_1_1; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_2=1008, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L95] COND TRUE last_1_var_1_13 <= stepLocal_2 [L96] var_1_5 = ((last_1_var_1_15 == last_1_var_1_13) && var_1_6) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L100] unsigned char stepLocal_3 = var_1_5; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_3=0, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L101] COND FALSE !(stepLocal_3 || var_1_17) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L104] var_1_13 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) [L105] var_1_30 = ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))) [L106] var_1_16 = (var_1_6 && var_1_17) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=179/20, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L107] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=179/20, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L110] COND FALSE !((((((var_1_32 - var_1_33)) < (var_1_29)) ? ((var_1_32 - var_1_33)) : (var_1_29))) > (var_1_7 * 31.3)) [L115] var_1_31 = (var_1_35 && ((var_1_13 > var_1_13) && (! var_1_36))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=179/20, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=16, var_1_9=2] [L117] COND FALSE !((var_1_15 + (var_1_15 * var_1_13)) <= ((32u / var_1_8) / var_1_9)) [L122] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=179/20, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=16, var_1_9=2] [L124] var_1_28 = var_1_29 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=16, var_1_9=2] [L125] COND TRUE (var_1_18 / 25.4f) >= ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) [L126] var_1_37 = (! (var_1_36 || var_1_35)) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=16, var_1_9=2] [L128] COND TRUE var_1_7 <= (- (32.8f + var_1_7)) [L129] var_1_12 = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=16, var_1_9=2] [L198] RET step() [L199] CALL, EXPR property() [L189-L190] return ((((((((last_1_var_1_13 < ((- last_1_var_1_12) * 64)) ? (last_1_var_1_5 ? (var_1_1 == ((unsigned long int) ((((last_1_var_1_12) < 0 ) ? -(last_1_var_1_12) : (last_1_var_1_12))))) : ((-10000000 < last_1_var_1_13) ? (var_1_1 == ((unsigned long int) (((((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))) < 0 ) ? -((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))) : ((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))))))) : (var_1_1 == ((unsigned long int) 50u)))) : 1) && ((last_1_var_1_13 <= (last_1_var_1_15 + last_1_var_1_1)) ? (var_1_5 == ((unsigned char) ((last_1_var_1_15 == last_1_var_1_13) && var_1_6))) : (var_1_5 == ((unsigned char) var_1_6)))) && (((var_1_15 + (var_1_15 * var_1_13)) <= ((32u / var_1_8) / var_1_9)) ? ((1.25f < var_1_18) ? (var_1_7 == ((float) 1000000.1f)) : 1) : (var_1_7 == ((float) var_1_11)))) && ((var_1_7 <= (- (32.8f + var_1_7))) ? (var_1_12 == ((unsigned long int) last_1_var_1_12)) : 1)) && (var_1_13 == ((unsigned char) ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) && (var_1_5 ? (var_1_15 == ((unsigned long int) ((((var_1_1) > ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) ? (var_1_1) : ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))))))))) : 1)) && (var_1_16 == ((unsigned char) (var_1_6 && var_1_17)))) && ((var_1_5 || var_1_17) ? (var_1_18 == ((double) ((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) + var_1_20) - 63.6))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=16, var_1_9=2] [L199] RET, EXPR property() [L199] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=16, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=3, var_1_29=3, var_1_30=128, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=16, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 169 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 8, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1497 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1456 mSDsluCounter, 3299 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2412 mSDsCounter, 910 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1682 IncrementalHoareTripleChecker+Invalid, 2592 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 910 mSolverCounterUnsat, 887 mSDtfsCounter, 1682 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 669 GetRequests, 584 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1101 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=330occurred in iteration=7, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 167 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2123 NumberOfCodeBlocks, 2123 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1918 ConstructedInterpolants, 0 QuantifiedInterpolants, 10273 SizeOfPredicates, 9 NumberOfNonLiveVariables, 908 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 17189/17400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 12:44:29,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-85.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 ad5d1ae9c41c5ead7b162591ee3109c786bcb523ca4e884a3cf08883cc71895e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:44:31,535 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:44:31,611 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 12:44:31,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:44:31,617 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:44:31,635 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:44:31,635 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:44:31,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:44:31,636 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:44:31,636 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:44:31,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:44:31,636 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:44:31,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:44:31,636 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:44:31,636 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:44:31,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:44:31,637 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:44:31,637 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:44:31,637 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:44:31,637 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:44:31,637 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:44:31,637 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:44:31,637 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:44:31,637 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 12:44:31,637 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 12:44:31,638 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 12:44:31,638 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:44:31,638 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:44:31,638 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:44:31,638 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:44:31,638 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:44:31,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:44:31,638 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:44:31,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:44:31,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:44:31,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:44:31,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:44:31,639 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:44:31,639 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:44:31,639 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 12:44:31,639 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 12:44:31,639 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:44:31,639 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:44:31,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:44:31,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:44:31,640 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 -> ad5d1ae9c41c5ead7b162591ee3109c786bcb523ca4e884a3cf08883cc71895e [2025-03-08 12:44:31,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:44:31,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:44:31,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:44:31,897 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:44:31,897 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:44:31,899 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-co_file-85.i [2025-03-08 12:44:33,107 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8534cc30b/66cd8f3e11eb43ae914c6d0df8a20ce3/FLAGe5a08b2dd [2025-03-08 12:44:33,352 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:44:33,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-85.i [2025-03-08 12:44:33,367 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8534cc30b/66cd8f3e11eb43ae914c6d0df8a20ce3/FLAGe5a08b2dd [2025-03-08 12:44:33,678 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8534cc30b/66cd8f3e11eb43ae914c6d0df8a20ce3 [2025-03-08 12:44:33,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:44:33,681 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:44:33,682 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:44:33,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:44:33,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:44:33,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:44:33" (1/1) ... [2025-03-08 12:44:33,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2933c6d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:33, skipping insertion in model container [2025-03-08 12:44:33,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:44:33" (1/1) ... [2025-03-08 12:44:33,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:44:33,805 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-co_file-85.i[919,932] [2025-03-08 12:44:33,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:44:33,872 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:44:33,881 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-co_file-85.i[919,932] [2025-03-08 12:44:33,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:44:33,945 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:44:33,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:33 WrapperNode [2025-03-08 12:44:33,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:44:33,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:44:33,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:44:33,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:44:33,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:33" (1/1) ... [2025-03-08 12:44:33,960 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:33" (1/1) ... [2025-03-08 12:44:33,979 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2025-03-08 12:44:33,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:44:33,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:44:33,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:44:33,981 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:44:33,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:33" (1/1) ... [2025-03-08 12:44:33,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:33" (1/1) ... [2025-03-08 12:44:33,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:33" (1/1) ... [2025-03-08 12:44:34,000 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 12:44:34,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:33" (1/1) ... [2025-03-08 12:44:34,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:33" (1/1) ... [2025-03-08 12:44:34,008 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:33" (1/1) ... [2025-03-08 12:44:34,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:33" (1/1) ... [2025-03-08 12:44:34,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:33" (1/1) ... [2025-03-08 12:44:34,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:33" (1/1) ... [2025-03-08 12:44:34,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:44:34,019 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:44:34,019 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:44:34,019 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:44:34,023 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:33" (1/1) ... [2025-03-08 12:44:34,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:44:34,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:44:34,049 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 12:44:34,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 12:44:34,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:44:34,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 12:44:34,076 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:44:34,076 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:44:34,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:44:34,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:44:34,170 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:44:34,172 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:44:51,344 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 12:44:51,345 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:44:51,354 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:44:51,354 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:44:51,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:44:51 BoogieIcfgContainer [2025-03-08 12:44:51,355 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:44:51,357 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:44:51,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:44:51,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:44:51,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:44:33" (1/3) ... [2025-03-08 12:44:51,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e09fe65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:44:51, skipping insertion in model container [2025-03-08 12:44:51,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:44:33" (2/3) ... [2025-03-08 12:44:51,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e09fe65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:44:51, skipping insertion in model container [2025-03-08 12:44:51,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:44:51" (3/3) ... [2025-03-08 12:44:51,362 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-85.i [2025-03-08 12:44:51,372 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:44:51,374 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-85.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:44:51,415 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:44:51,422 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;@77e5d964, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:44:51,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:44:51,425 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 12:44:51,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 12:44:51,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:44:51,435 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:44:51,435 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:44:51,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:44:51,439 INFO L85 PathProgramCache]: Analyzing trace with hash -870590850, now seen corresponding path program 1 times [2025-03-08 12:44:51,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:44:51,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392700228] [2025-03-08 12:44:51,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:44:51,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:44:51,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:44:51,449 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:44:51,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 12:44:51,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 12:44:52,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 12:44:52,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:44:52,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:44:52,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:44:52,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:44:52,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 730 proven. 0 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2025-03-08 12:44:52,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:44:52,732 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:44:52,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392700228] [2025-03-08 12:44:52,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392700228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:44:52,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:44:52,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 12:44:52,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435856448] [2025-03-08 12:44:52,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:44:52,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:44:52,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:44:52,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:44:52,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:44:52,750 INFO L87 Difference]: Start difference. First operand has 87 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-08 12:44:52,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:44:52,768 INFO L93 Difference]: Finished difference Result 168 states and 297 transitions. [2025-03-08 12:44:52,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:44:52,769 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 190 [2025-03-08 12:44:52,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:44:52,773 INFO L225 Difference]: With dead ends: 168 [2025-03-08 12:44:52,774 INFO L226 Difference]: Without dead ends: 84 [2025-03-08 12:44:52,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:44:52,778 INFO L435 NwaCegarLoop]: 130 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, 130 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:44:52,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:44:52,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-08 12:44:52,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-08 12:44:52,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 12:44:52,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 130 transitions. [2025-03-08 12:44:52,818 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 130 transitions. Word has length 190 [2025-03-08 12:44:52,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:44:52,818 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 130 transitions. [2025-03-08 12:44:52,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-08 12:44:52,819 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 130 transitions. [2025-03-08 12:44:52,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 12:44:52,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:44:52,824 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:44:52,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-08 12:44:53,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:44:53,026 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:44:53,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:44:53,027 INFO L85 PathProgramCache]: Analyzing trace with hash 25557756, now seen corresponding path program 1 times [2025-03-08 12:44:53,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:44:53,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052808269] [2025-03-08 12:44:53,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:44:53,027 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:44:53,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:44:53,029 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:44:53,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 12:44:53,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 12:44:54,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 12:44:54,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:44:54,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:44:54,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 12:44:54,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:44:56,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-08 12:44:56,074 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:44:56,074 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:44:56,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052808269] [2025-03-08 12:44:56,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052808269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:44:56,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:44:56,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:44:56,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149317916] [2025-03-08 12:44:56,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:44:56,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:44:56,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:44:56,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:44:56,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:44:56,078 INFO L87 Difference]: Start difference. First operand 84 states and 130 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 12:44:58,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:44:59,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:44:59,027 INFO L93 Difference]: Finished difference Result 165 states and 257 transitions. [2025-03-08 12:44:59,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:44:59,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 190 [2025-03-08 12:44:59,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:44:59,051 INFO L225 Difference]: With dead ends: 165 [2025-03-08 12:44:59,051 INFO L226 Difference]: Without dead ends: 84 [2025-03-08 12:44:59,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:44:59,052 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 111 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 12:44:59,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 178 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 12:44:59,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-08 12:44:59,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-08 12:44:59,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 states have internal predecessors, (69), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 12:44:59,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 129 transitions. [2025-03-08 12:44:59,062 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 129 transitions. Word has length 190 [2025-03-08 12:44:59,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:44:59,065 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 129 transitions. [2025-03-08 12:44:59,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 12:44:59,065 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 129 transitions. [2025-03-08 12:44:59,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 12:44:59,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:44:59,069 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:44:59,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 12:44:59,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:44:59,269 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:44:59,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:44:59,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2147268037, now seen corresponding path program 1 times [2025-03-08 12:44:59,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:44:59,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633615460] [2025-03-08 12:44:59,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:44:59,271 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:44:59,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:44:59,273 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:44:59,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 12:44:59,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 12:45:00,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 12:45:00,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:45:00,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:45:00,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 12:45:00,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:45:02,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-08 12:45:02,100 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:45:02,100 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:45:02,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633615460] [2025-03-08 12:45:02,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633615460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:45:02,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:45:02,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 12:45:02,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278468947] [2025-03-08 12:45:02,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:45:02,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:45:02,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:45:02,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:45:02,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:45:02,102 INFO L87 Difference]: Start difference. First operand 84 states and 129 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 12:45:04,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:45:04,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:45:04,456 INFO L93 Difference]: Finished difference Result 229 states and 356 transitions. [2025-03-08 12:45:04,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:45:04,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 191 [2025-03-08 12:45:04,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:45:04,461 INFO L225 Difference]: With dead ends: 229 [2025-03-08 12:45:04,461 INFO L226 Difference]: Without dead ends: 148 [2025-03-08 12:45:04,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:45:04,462 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 14 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:45:04,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 238 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 12:45:04,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-08 12:45:04,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 141. [2025-03-08 12:45:04,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 78 states have internal predecessors, (97), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 12:45:04,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 217 transitions. [2025-03-08 12:45:04,494 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 217 transitions. Word has length 191 [2025-03-08 12:45:04,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:45:04,496 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 217 transitions. [2025-03-08 12:45:04,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 12:45:04,496 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 217 transitions. [2025-03-08 12:45:04,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 12:45:04,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:45:04,500 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:45:04,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 12:45:04,700 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-08 12:45:04,701 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:45:04,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:45:04,702 INFO L85 PathProgramCache]: Analyzing trace with hash 585521052, now seen corresponding path program 1 times [2025-03-08 12:45:04,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:45:04,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641831590] [2025-03-08 12:45:04,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:45:04,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:45:04,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:45:04,705 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-08 12:45:04,707 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-08 12:45:04,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 12:45:05,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 12:45:05,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:45:05,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:45:05,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 12:45:05,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:45:07,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-08 12:45:07,465 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:45:07,465 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:45:07,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641831590] [2025-03-08 12:45:07,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641831590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:45:07,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:45:07,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 12:45:07,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866164759] [2025-03-08 12:45:07,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:45:07,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:45:07,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:45:07,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:45:07,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:45:07,467 INFO L87 Difference]: Start difference. First operand 141 states and 217 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 12:45:08,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:45:08,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:45:08,745 INFO L93 Difference]: Finished difference Result 229 states and 353 transitions. [2025-03-08 12:45:08,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:45:08,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 192 [2025-03-08 12:45:08,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:45:08,747 INFO L225 Difference]: With dead ends: 229 [2025-03-08 12:45:08,747 INFO L226 Difference]: Without dead ends: 148 [2025-03-08 12:45:08,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:45:08,749 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 16 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:45:08,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 244 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 12:45:08,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-08 12:45:08,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2025-03-08 12:45:08,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 80 states have (on average 1.2375) internal successors, (99), 80 states have internal predecessors, (99), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 12:45:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 219 transitions. [2025-03-08 12:45:08,772 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 219 transitions. Word has length 192 [2025-03-08 12:45:08,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:45:08,773 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 219 transitions. [2025-03-08 12:45:08,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 12:45:08,773 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 219 transitions. [2025-03-08 12:45:08,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 12:45:08,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:45:08,775 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:45:08,812 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 (5)] Ended with exit code 0 [2025-03-08 12:45:08,976 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-08 12:45:08,976 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:45:08,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:45:08,976 INFO L85 PathProgramCache]: Analyzing trace with hash 128806721, now seen corresponding path program 1 times [2025-03-08 12:45:08,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:45:08,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352467478] [2025-03-08 12:45:08,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:45:08,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:45:08,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:45:08,979 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:45:08,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 12:45:09,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 12:45:10,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 12:45:10,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:45:10,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:45:10,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 12:45:10,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:45:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-08 12:45:13,310 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:45:13,310 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:45:13,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352467478] [2025-03-08 12:45:13,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352467478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:45:13,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:45:13,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:45:13,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385900603] [2025-03-08 12:45:13,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:45:13,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:45:13,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:45:13,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:45:13,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:45:13,313 INFO L87 Difference]: Start difference. First operand 143 states and 219 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 12:45:16,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:45:16,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:45:16,294 INFO L93 Difference]: Finished difference Result 247 states and 380 transitions. [2025-03-08 12:45:16,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:45:16,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 194 [2025-03-08 12:45:16,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:45:16,324 INFO L225 Difference]: With dead ends: 247 [2025-03-08 12:45:16,325 INFO L226 Difference]: Without dead ends: 166 [2025-03-08 12:45:16,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:45:16,326 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 60 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-08 12:45:16,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 482 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-08 12:45:16,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-08 12:45:16,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 148. [2025-03-08 12:45:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 85 states have internal predecessors, (107), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 12:45:16,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 227 transitions. [2025-03-08 12:45:16,355 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 227 transitions. Word has length 194 [2025-03-08 12:45:16,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:45:16,358 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 227 transitions. [2025-03-08 12:45:16,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 12:45:16,358 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 227 transitions. [2025-03-08 12:45:16,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 12:45:16,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:45:16,359 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:45:16,396 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-08 12:45:16,560 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-08 12:45:16,560 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:45:16,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:45:16,560 INFO L85 PathProgramCache]: Analyzing trace with hash 634365346, now seen corresponding path program 1 times [2025-03-08 12:45:16,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:45:16,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011690811] [2025-03-08 12:45:16,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:45:16,561 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:45:16,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:45:16,563 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-08 12:45:16,564 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-08 12:45:16,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 12:45:17,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 12:45:17,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:45:17,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:45:17,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 12:45:17,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:45:22,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 869 proven. 51 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-03-08 12:45:22,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:45:24,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-08 12:45:24,483 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:45:24,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011690811] [2025-03-08 12:45:24,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011690811] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:45:24,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 12:45:24,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2025-03-08 12:45:24,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401107928] [2025-03-08 12:45:24,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 12:45:24,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 12:45:24,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:45:24,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 12:45:24,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-08 12:45:24,485 INFO L87 Difference]: Start difference. First operand 148 states and 227 transitions. Second operand has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2025-03-08 12:45:31,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:45:35,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:45:36,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:45:39,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:45:43,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:45:47,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:45:49,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:45:49,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:45:49,567 INFO L93 Difference]: Finished difference Result 278 states and 419 transitions. [2025-03-08 12:45:49,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 12:45:49,568 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) Word has length 194 [2025-03-08 12:45:49,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:45:49,569 INFO L225 Difference]: With dead ends: 278 [2025-03-08 12:45:49,569 INFO L226 Difference]: Without dead ends: 197 [2025-03-08 12:45:49,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 375 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2025-03-08 12:45:49,570 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 336 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 219 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:45:49,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 545 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 601 Invalid, 4 Unknown, 0 Unchecked, 24.1s Time] [2025-03-08 12:45:49,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-08 12:45:49,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2025-03-08 12:45:49,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 112 states have (on average 1.25) internal successors, (140), 113 states have internal predecessors, (140), 71 states have call successors, (71), 4 states have call predecessors, (71), 4 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2025-03-08 12:45:49,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 282 transitions. [2025-03-08 12:45:49,592 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 282 transitions. Word has length 194 [2025-03-08 12:45:49,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:45:49,592 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 282 transitions. [2025-03-08 12:45:49,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2025-03-08 12:45:49,592 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 282 transitions. [2025-03-08 12:45:49,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 12:45:49,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:45:49,594 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:45:49,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 (7)] Ended with exit code 0 [2025-03-08 12:45:49,794 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 [2025-03-08 12:45:49,794 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:45:49,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:45:49,795 INFO L85 PathProgramCache]: Analyzing trace with hash 566934560, now seen corresponding path program 1 times [2025-03-08 12:45:49,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:45:49,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603916360] [2025-03-08 12:45:49,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:45:49,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:45:49,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:45:49,797 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:45:49,798 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 (8)] Waiting until timeout for monitored process [2025-03-08 12:45:49,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 12:45:51,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 12:45:51,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:45:51,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:45:51,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 12:45:51,078 INFO L279 TraceCheckSpWp]: Computing forward predicates...