./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_fillercodesize_ps-cn-25_file-42.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5f62dbdf30439c22b90c0714165751cfb1215bac5efc8ba17b86c401a925f47d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:16:34,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:16:34,904 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:16:34,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:16:34,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:16:34,952 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:16:34,952 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:16:34,953 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:16:34,953 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:16:34,953 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:16:34,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:16:34,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:16:34,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:16:34,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:16:34,954 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:16:34,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:16:34,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:16:34,954 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:16:34,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:16:34,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:16:34,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:16:34,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:16:34,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:16:34,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:16:34,955 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:16:34,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:16:34,955 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:16:34,955 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:16:34,955 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:16:34,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:16:34,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:16:34,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:16:34,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:16:34,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:16:34,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:16:34,956 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:16:34,956 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:16:34,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:16:34,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:16:34,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:16:34,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:16:34,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:16:34,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:16:34,957 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 -> 5f62dbdf30439c22b90c0714165751cfb1215bac5efc8ba17b86c401a925f47d [2025-03-17 00:16:35,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:16:35,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:16:35,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:16:35,193 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:16:35,193 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:16:35,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2025-03-17 00:16:36,357 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e48b723a/fc1c00ac6c6f41dcb63b4e148ad92508/FLAGe3e464b49 [2025-03-17 00:16:36,617 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:16:36,622 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2025-03-17 00:16:36,632 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e48b723a/fc1c00ac6c6f41dcb63b4e148ad92508/FLAGe3e464b49 [2025-03-17 00:16:36,932 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e48b723a/fc1c00ac6c6f41dcb63b4e148ad92508 [2025-03-17 00:16:36,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:16:36,935 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:16:36,936 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:16:36,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:16:36,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:16:36,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:16:36" (1/1) ... [2025-03-17 00:16:36,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14756c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:36, skipping insertion in model container [2025-03-17 00:16:36,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:16:36" (1/1) ... [2025-03-17 00:16:36,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:16:37,053 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_fillercodesize_ps-cn-25_file-42.i[915,928] [2025-03-17 00:16:37,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:16:37,105 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:16:37,112 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_fillercodesize_ps-cn-25_file-42.i[915,928] [2025-03-17 00:16:37,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:16:37,170 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:16:37,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:37 WrapperNode [2025-03-17 00:16:37,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:16:37,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:16:37,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:16:37,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:16:37,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:37" (1/1) ... [2025-03-17 00:16:37,184 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:37" (1/1) ... [2025-03-17 00:16:37,206 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 222 [2025-03-17 00:16:37,207 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:16:37,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:16:37,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:16:37,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:16:37,213 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:37" (1/1) ... [2025-03-17 00:16:37,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:37" (1/1) ... [2025-03-17 00:16:37,215 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:37" (1/1) ... [2025-03-17 00:16:37,227 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-17 00:16:37,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:37" (1/1) ... [2025-03-17 00:16:37,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:37" (1/1) ... [2025-03-17 00:16:37,243 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:37" (1/1) ... [2025-03-17 00:16:37,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:37" (1/1) ... [2025-03-17 00:16:37,250 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:37" (1/1) ... [2025-03-17 00:16:37,251 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:37" (1/1) ... [2025-03-17 00:16:37,254 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:16:37,257 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:16:37,257 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:16:37,258 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:16:37,258 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:37" (1/1) ... [2025-03-17 00:16:37,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:16:37,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:16:37,288 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-17 00:16:37,294 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-17 00:16:37,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:16:37,310 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:16:37,310 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:16:37,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:16:37,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:16:37,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:16:37,384 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:16:37,386 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:16:37,763 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-17 00:16:37,763 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:16:37,777 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:16:37,779 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:16:37,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:16:37 BoogieIcfgContainer [2025-03-17 00:16:37,779 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:16:37,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:16:37,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:16:37,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:16:37,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:16:36" (1/3) ... [2025-03-17 00:16:37,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c898b5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:16:37, skipping insertion in model container [2025-03-17 00:16:37,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:37" (2/3) ... [2025-03-17 00:16:37,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c898b5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:16:37, skipping insertion in model container [2025-03-17 00:16:37,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:16:37" (3/3) ... [2025-03-17 00:16:37,786 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2025-03-17 00:16:37,794 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:16:37,796 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-42.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:16:37,833 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:16:37,840 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;@728d889e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:16:37,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:16:37,842 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 00:16:37,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-17 00:16:37,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:16:37,856 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:16:37,856 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:16:37,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:16:37,860 INFO L85 PathProgramCache]: Analyzing trace with hash -847231238, now seen corresponding path program 1 times [2025-03-17 00:16:37,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:16:37,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62384005] [2025-03-17 00:16:37,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:16:37,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:16:37,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-17 00:16:37,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-17 00:16:37,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:16:37,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:16:38,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-17 00:16:38,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:16:38,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62384005] [2025-03-17 00:16:38,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62384005] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:16:38,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861317152] [2025-03-17 00:16:38,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:16:38,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:16:38,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:16:38,190 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-17 00:16:38,192 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-17 00:16:38,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-17 00:16:38,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-17 00:16:38,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:16:38,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:16:38,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:16:38,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:16:38,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-17 00:16:38,421 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:16:38,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861317152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:16:38,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:16:38,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:16:38,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348804237] [2025-03-17 00:16:38,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:16:38,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:16:38,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:16:38,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:16:38,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:16:38,447 INFO L87 Difference]: Start difference. First operand has 89 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) 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, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 00:16:38,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:16:38,480 INFO L93 Difference]: Finished difference Result 175 states and 309 transitions. [2025-03-17 00:16:38,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:16:38,483 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, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 197 [2025-03-17 00:16:38,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:16:38,490 INFO L225 Difference]: With dead ends: 175 [2025-03-17 00:16:38,490 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 00:16:38,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 198 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-17 00:16:38,498 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:16:38,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:16:38,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 00:16:38,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-17 00:16:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 00:16:38,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 136 transitions. [2025-03-17 00:16:38,534 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 136 transitions. Word has length 197 [2025-03-17 00:16:38,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:16:38,534 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 136 transitions. [2025-03-17 00:16:38,534 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, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 00:16:38,534 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 136 transitions. [2025-03-17 00:16:38,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-17 00:16:38,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:16:38,537 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:16:38,543 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-17 00:16:38,738 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-17 00:16:38,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:16:38,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:16:38,740 INFO L85 PathProgramCache]: Analyzing trace with hash -34159465, now seen corresponding path program 1 times [2025-03-17 00:16:38,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:16:38,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074461368] [2025-03-17 00:16:38,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:16:38,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:16:38,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-17 00:16:38,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-17 00:16:38,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:16:38,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:16:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 00:16:39,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:16:39,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074461368] [2025-03-17 00:16:39,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074461368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:16:39,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:16:39,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:16:39,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548825980] [2025-03-17 00:16:39,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:16:39,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:16:39,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:16:39,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:16:39,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:16:39,190 INFO L87 Difference]: Start difference. First operand 87 states and 136 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:16:39,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:16:39,357 INFO L93 Difference]: Finished difference Result 260 states and 407 transitions. [2025-03-17 00:16:39,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:16:39,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2025-03-17 00:16:39,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:16:39,360 INFO L225 Difference]: With dead ends: 260 [2025-03-17 00:16:39,360 INFO L226 Difference]: Without dead ends: 174 [2025-03-17 00:16:39,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:16:39,361 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 109 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:16:39,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 388 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:16:39,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-17 00:16:39,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 154. [2025-03-17 00:16:39,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 89 states have internal predecessors, (117), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 00:16:39,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 241 transitions. [2025-03-17 00:16:39,397 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 241 transitions. Word has length 197 [2025-03-17 00:16:39,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:16:39,397 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 241 transitions. [2025-03-17 00:16:39,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:16:39,398 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 241 transitions. [2025-03-17 00:16:39,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-17 00:16:39,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:16:39,404 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:16:39,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:16:39,404 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:16:39,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:16:39,405 INFO L85 PathProgramCache]: Analyzing trace with hash 799775567, now seen corresponding path program 1 times [2025-03-17 00:16:39,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:16:39,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185441861] [2025-03-17 00:16:39,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:16:39,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:16:39,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-17 00:16:39,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-17 00:16:39,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:16:39,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:16:39,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 00:16:39,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:16:39,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185441861] [2025-03-17 00:16:39,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185441861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:16:39,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:16:39,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:16:39,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128831134] [2025-03-17 00:16:39,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:16:39,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:16:39,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:16:39,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:16:39,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:16:39,833 INFO L87 Difference]: Start difference. First operand 154 states and 241 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:16:40,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:16:40,199 INFO L93 Difference]: Finished difference Result 369 states and 577 transitions. [2025-03-17 00:16:40,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 00:16:40,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 198 [2025-03-17 00:16:40,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:16:40,202 INFO L225 Difference]: With dead ends: 369 [2025-03-17 00:16:40,202 INFO L226 Difference]: Without dead ends: 283 [2025-03-17 00:16:40,203 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-17 00:16:40,204 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 138 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:16:40,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 509 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:16:40,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-17 00:16:40,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 238. [2025-03-17 00:16:40,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 141 states have (on average 1.3333333333333333) internal successors, (188), 141 states have internal predecessors, (188), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-17 00:16:40,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 374 transitions. [2025-03-17 00:16:40,239 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 374 transitions. Word has length 198 [2025-03-17 00:16:40,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:16:40,239 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 374 transitions. [2025-03-17 00:16:40,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:16:40,240 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 374 transitions. [2025-03-17 00:16:40,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-17 00:16:40,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:16:40,241 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:16:40,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:16:40,242 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:16:40,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:16:40,242 INFO L85 PathProgramCache]: Analyzing trace with hash 294216942, now seen corresponding path program 1 times [2025-03-17 00:16:40,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:16:40,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679630294] [2025-03-17 00:16:40,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:16:40,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:16:40,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-17 00:16:40,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-17 00:16:40,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:16:40,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:16:40,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 00:16:40,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:16:40,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679630294] [2025-03-17 00:16:40,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679630294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:16:40,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:16:40,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:16:40,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925517670] [2025-03-17 00:16:40,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:16:40,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:16:40,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:16:40,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:16:40,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:16:40,413 INFO L87 Difference]: Start difference. First operand 238 states and 374 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:16:40,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:16:40,476 INFO L93 Difference]: Finished difference Result 408 states and 642 transitions. [2025-03-17 00:16:40,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:16:40,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 198 [2025-03-17 00:16:40,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:16:40,480 INFO L225 Difference]: With dead ends: 408 [2025-03-17 00:16:40,481 INFO L226 Difference]: Without dead ends: 238 [2025-03-17 00:16:40,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:16:40,485 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:16:40,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 252 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:16:40,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-17 00:16:40,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2025-03-17 00:16:40,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 141 states have (on average 1.3191489361702127) internal successors, (186), 141 states have internal predecessors, (186), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-17 00:16:40,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 372 transitions. [2025-03-17 00:16:40,526 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 372 transitions. Word has length 198 [2025-03-17 00:16:40,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:16:40,527 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 372 transitions. [2025-03-17 00:16:40,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:16:40,527 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 372 transitions. [2025-03-17 00:16:40,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-17 00:16:40,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:16:40,529 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:16:40,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:16:40,529 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:16:40,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:16:40,530 INFO L85 PathProgramCache]: Analyzing trace with hash 2037027277, now seen corresponding path program 1 times [2025-03-17 00:16:40,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:16:40,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227849804] [2025-03-17 00:16:40,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:16:40,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:16:40,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-17 00:16:40,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-17 00:16:40,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:16:40,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:16:40,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 00:16:40,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:16:40,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227849804] [2025-03-17 00:16:40,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227849804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:16:40,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:16:40,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:16:40,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742520042] [2025-03-17 00:16:40,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:16:40,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:16:40,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:16:40,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:16:40,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:16:40,724 INFO L87 Difference]: Start difference. First operand 238 states and 372 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:16:40,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:16:40,801 INFO L93 Difference]: Finished difference Result 548 states and 851 transitions. [2025-03-17 00:16:40,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:16:40,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 198 [2025-03-17 00:16:40,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:16:40,805 INFO L225 Difference]: With dead ends: 548 [2025-03-17 00:16:40,805 INFO L226 Difference]: Without dead ends: 376 [2025-03-17 00:16:40,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:16:40,806 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 99 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:16:40,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 250 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:16:40,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-17 00:16:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 372. [2025-03-17 00:16:40,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 222 states have (on average 1.3108108108108107) internal successors, (291), 224 states have internal predecessors, (291), 143 states have call successors, (143), 6 states have call predecessors, (143), 6 states have return successors, (143), 141 states have call predecessors, (143), 143 states have call successors, (143) [2025-03-17 00:16:40,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 577 transitions. [2025-03-17 00:16:40,872 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 577 transitions. Word has length 198 [2025-03-17 00:16:40,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:16:40,874 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 577 transitions. [2025-03-17 00:16:40,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:16:40,875 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 577 transitions. [2025-03-17 00:16:40,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-17 00:16:40,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:16:40,879 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:16:40,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:16:40,879 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:16:40,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:16:40,880 INFO L85 PathProgramCache]: Analyzing trace with hash -904630322, now seen corresponding path program 1 times [2025-03-17 00:16:40,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:16:40,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123762320] [2025-03-17 00:16:40,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:16:40,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:16:40,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-17 00:16:40,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-17 00:16:40,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:16:40,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:16:41,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 51 proven. 123 refuted. 0 times theorem prover too weak. 1686 trivial. 0 not checked. [2025-03-17 00:16:41,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:16:41,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123762320] [2025-03-17 00:16:41,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123762320] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:16:41,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023395411] [2025-03-17 00:16:41,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:16:41,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:16:41,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:16:41,459 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-17 00:16:41,461 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-17 00:16:41,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-17 00:16:41,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-17 00:16:41,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:16:41,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:16:41,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 00:16:41,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:16:42,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 947 proven. 123 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2025-03-17 00:16:42,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:16:42,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 51 proven. 126 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2025-03-17 00:16:42,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023395411] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:16:42,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:16:42,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-03-17 00:16:42,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449270765] [2025-03-17 00:16:42,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:16:42,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 00:16:42,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:16:42,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 00:16:42,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-17 00:16:42,755 INFO L87 Difference]: Start difference. First operand 372 states and 577 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-03-17 00:16:43,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:16:43,758 INFO L93 Difference]: Finished difference Result 1138 states and 1664 transitions. [2025-03-17 00:16:43,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-17 00:16:43,758 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) Word has length 198 [2025-03-17 00:16:43,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:16:43,764 INFO L225 Difference]: With dead ends: 1138 [2025-03-17 00:16:43,764 INFO L226 Difference]: Without dead ends: 989 [2025-03-17 00:16:43,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 392 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2025-03-17 00:16:43,767 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 443 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:16:43,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 675 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 00:16:43,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2025-03-17 00:16:43,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 593. [2025-03-17 00:16:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 371 states have (on average 1.280323450134771) internal successors, (475), 374 states have internal predecessors, (475), 199 states have call successors, (199), 22 states have call predecessors, (199), 22 states have return successors, (199), 196 states have call predecessors, (199), 199 states have call successors, (199) [2025-03-17 00:16:43,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 873 transitions. [2025-03-17 00:16:43,842 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 873 transitions. Word has length 198 [2025-03-17 00:16:43,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:16:43,842 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 873 transitions. [2025-03-17 00:16:43,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-03-17 00:16:43,843 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 873 transitions. [2025-03-17 00:16:43,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-17 00:16:43,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:16:43,844 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:16:43,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 00:16:44,045 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,SelfDestructingSolverStorable5 [2025-03-17 00:16:44,045 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:16:44,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:16:44,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1198033329, now seen corresponding path program 1 times [2025-03-17 00:16:44,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:16:44,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651364560] [2025-03-17 00:16:44,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:16:44,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:16:44,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-17 00:16:44,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-17 00:16:44,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:16:44,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 00:16:44,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1519476500] [2025-03-17 00:16:44,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:16:44,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:16:44,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:16:44,145 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-17 00:16:44,146 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-17 00:16:44,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-17 00:16:44,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-17 00:16:44,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:16:44,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:16:44,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 00:16:44,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:16:44,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 258 proven. 84 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2025-03-17 00:16:44,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:16:45,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:16:45,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651364560] [2025-03-17 00:16:45,400 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 00:16:45,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519476500] [2025-03-17 00:16:45,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519476500] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:16:45,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:16:45,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-17 00:16:45,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118904922] [2025-03-17 00:16:45,401 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 00:16:45,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:16:45,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:16:45,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:16:45,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-17 00:16:45,401 INFO L87 Difference]: Start difference. First operand 593 states and 873 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 00:16:46,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:16:46,077 INFO L93 Difference]: Finished difference Result 1694 states and 2425 transitions. [2025-03-17 00:16:46,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 00:16:46,077 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 198 [2025-03-17 00:16:46,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:16:46,086 INFO L225 Difference]: With dead ends: 1694 [2025-03-17 00:16:46,086 INFO L226 Difference]: Without dead ends: 1368 [2025-03-17 00:16:46,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2025-03-17 00:16:46,091 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 158 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:16:46,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 803 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:16:46,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2025-03-17 00:16:46,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1198. [2025-03-17 00:16:46,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 771 states have (on average 1.2736705577172502) internal successors, (982), 781 states have internal predecessors, (982), 375 states have call successors, (375), 51 states have call predecessors, (375), 51 states have return successors, (375), 365 states have call predecessors, (375), 375 states have call successors, (375) [2025-03-17 00:16:46,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1732 transitions. [2025-03-17 00:16:46,204 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1732 transitions. Word has length 198 [2025-03-17 00:16:46,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:16:46,206 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1732 transitions. [2025-03-17 00:16:46,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 00:16:46,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1732 transitions. [2025-03-17 00:16:46,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-17 00:16:46,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:16:46,210 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:16:46,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 00:16:46,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:16:46,412 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:16:46,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:16:46,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1068950610, now seen corresponding path program 1 times [2025-03-17 00:16:46,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:16:46,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142756425] [2025-03-17 00:16:46,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:16:46,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:16:46,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-17 00:16:46,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-17 00:16:46,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:16:46,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 00:16:46,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1370915223] [2025-03-17 00:16:46,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:16:46,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:16:46,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:16:46,500 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:16:46,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 00:16:46,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-17 00:16:46,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-17 00:16:46,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:16:46,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:16:46,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 00:16:46,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:16:47,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 258 proven. 84 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2025-03-17 00:16:47,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:16:47,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:16:47,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142756425] [2025-03-17 00:16:47,298 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 00:16:47,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370915223] [2025-03-17 00:16:47,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370915223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:16:47,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:16:47,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-17 00:16:47,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774592614] [2025-03-17 00:16:47,299 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 00:16:47,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 00:16:47,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:16:47,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 00:16:47,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:16:47,300 INFO L87 Difference]: Start difference. First operand 1198 states and 1732 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 00:16:47,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:16:47,874 INFO L93 Difference]: Finished difference Result 1811 states and 2603 transitions. [2025-03-17 00:16:47,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 00:16:47,875 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 198 [2025-03-17 00:16:47,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:16:47,881 INFO L225 Difference]: With dead ends: 1811 [2025-03-17 00:16:47,882 INFO L226 Difference]: Without dead ends: 1314 [2025-03-17 00:16:47,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-17 00:16:47,884 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 110 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:16:47,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 690 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:16:47,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2025-03-17 00:16:47,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1198. [2025-03-17 00:16:47,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 771 states have (on average 1.2632944228274967) internal successors, (974), 781 states have internal predecessors, (974), 375 states have call successors, (375), 51 states have call predecessors, (375), 51 states have return successors, (375), 365 states have call predecessors, (375), 375 states have call successors, (375) [2025-03-17 00:16:47,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1724 transitions. [2025-03-17 00:16:47,988 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1724 transitions. Word has length 198 [2025-03-17 00:16:47,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:16:47,989 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1724 transitions. [2025-03-17 00:16:47,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 00:16:47,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1724 transitions. [2025-03-17 00:16:47,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-17 00:16:47,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:16:47,992 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:16:47,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 00:16:48,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:16:48,193 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:16:48,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:16:48,193 INFO L85 PathProgramCache]: Analyzing trace with hash 485988758, now seen corresponding path program 1 times [2025-03-17 00:16:48,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:16:48,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867120192] [2025-03-17 00:16:48,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:16:48,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:16:48,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-17 00:16:48,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-17 00:16:48,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:16:48,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 00:16:48,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2127012205] [2025-03-17 00:16:48,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:16:48,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:16:48,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:16:48,271 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:16:48,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 00:16:48,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-17 00:16:48,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-17 00:16:48,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:16:48,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 00:16:48,397 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 00:16:48,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-17 00:16:48,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-17 00:16:48,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:16:48,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 00:16:48,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 00:16:48,558 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 00:16:48,559 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 00:16:48,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 00:16:48,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:16:48,763 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:16:48,856 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 00:16:48,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 12:16:48 BoogieIcfgContainer [2025-03-17 00:16:48,858 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 00:16:48,859 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 00:16:48,859 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 00:16:48,859 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 00:16:48,859 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:16:37" (3/4) ... [2025-03-17 00:16:48,862 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 00:16:48,862 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 00:16:48,863 INFO L158 Benchmark]: Toolchain (without parser) took 11927.87ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 124.2MB in the beginning and 264.9MB in the end (delta: -140.7MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2025-03-17 00:16:48,863 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:16:48,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.50ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 108.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 00:16:48,864 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.78ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 105.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:16:48,864 INFO L158 Benchmark]: Boogie Preprocessor took 49.68ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 100.3MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 00:16:48,865 INFO L158 Benchmark]: IcfgBuilder took 521.72ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 73.1MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 00:16:48,865 INFO L158 Benchmark]: TraceAbstraction took 11077.86ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 72.1MB in the beginning and 265.0MB in the end (delta: -192.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:16:48,865 INFO L158 Benchmark]: Witness Printer took 3.53ms. Allocated memory is still 352.3MB. Free memory was 265.0MB in the beginning and 264.9MB in the end (delta: 72.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:16:48,866 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.19ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.50ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 108.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.78ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 105.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.68ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 100.3MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 521.72ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 73.1MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11077.86ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 72.1MB in the beginning and 265.0MB in the end (delta: -192.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.53ms. Allocated memory is still 352.3MB. Free memory was 265.0MB in the beginning and 264.9MB in the end (delta: 72.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 118, overapproximation of someBinaryFLOATComparisonOperation at line 142, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryFLOATComparisonOperation at line 144, overapproximation of someBinaryFLOATComparisonOperation at line 186, overapproximation of someBinaryFLOATComparisonOperation at line 173, overapproximation of someBinaryFLOATComparisonOperation at line 177, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 171, overapproximation of someBinaryFLOATComparisonOperation at line 175, overapproximation of someUnaryDOUBLEoperation at line 30, overapproximation of someBinaryArithmeticFLOAToperation at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] unsigned char var_1_21 = 0; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 1; [L39] signed short int var_1_24 = -32; [L40] unsigned char var_1_25 = 1; [L41] float var_1_26 = 500.65; [L42] signed long int var_1_27 = -8; [L43] unsigned long int var_1_28 = 10; [L44] signed short int var_1_29 = -256; [L45] signed char var_1_30 = 1; [L46] float var_1_31 = 7.8; [L47] float var_1_32 = 63.25; [L48] float var_1_33 = 0.4; [L49] float var_1_34 = 64.875; [L50] float var_1_35 = 1.3; [L51] unsigned short int var_1_36 = 100; [L52] signed short int last_1_var_1_1 = 16; [L53] unsigned char last_1_var_1_6 = 10; [L54] unsigned char last_1_var_1_8 = 1; [L55] signed short int last_1_var_1_13 = 200; [L190] isInitial = 1 [L191] FCALL initially() [L192] COND TRUE 1 [L193] CALL updateLastVariables() [L180] last_1_var_1_1 = var_1_1 [L181] last_1_var_1_6 = var_1_6 [L182] last_1_var_1_8 = var_1_8 [L183] last_1_var_1_13 = var_1_13 [L193] RET updateLastVariables() [L194] CALL updateVariables() [L129] var_1_5 = __VERIFIER_nondet_char() [L130] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=128, var_1_8=1] [L130] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=128, var_1_8=1] [L131] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=128, var_1_8=1] [L131] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=128, var_1_8=1] [L132] var_1_7 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L133] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L134] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L134] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L135] var_1_11 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L136] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L137] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L137] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L138] var_1_12 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L139] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L140] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L140] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L141] var_1_15 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L142] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L143] var_1_16 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L144] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L145] var_1_20 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L146] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L147] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L147] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L148] var_1_22 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L149] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L150] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L150] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L151] var_1_23 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L152] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L153] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L153] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L154] var_1_24 = __VERIFIER_nondet_short() [L155] CALL assume_abort_if_not(var_1_24 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L155] RET assume_abort_if_not(var_1_24 >= -32768) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L156] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L156] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L157] var_1_25 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_25 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L158] RET assume_abort_if_not(var_1_25 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L159] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L159] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L160] var_1_27 = __VERIFIER_nondet_long() [L161] CALL assume_abort_if_not(var_1_27 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L161] RET assume_abort_if_not(var_1_27 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L162] CALL assume_abort_if_not(var_1_27 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L162] RET assume_abort_if_not(var_1_27 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L163] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L163] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L164] var_1_29 = __VERIFIER_nondet_short() [L165] CALL assume_abort_if_not(var_1_29 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L165] RET assume_abort_if_not(var_1_29 >= -32768) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L166] CALL assume_abort_if_not(var_1_29 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L166] RET assume_abort_if_not(var_1_29 <= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L167] var_1_30 = __VERIFIER_nondet_char() [L168] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L168] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L169] CALL assume_abort_if_not(var_1_30 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L169] RET assume_abort_if_not(var_1_30 <= 16) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L170] var_1_32 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L171] RET assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L172] var_1_33 = __VERIFIER_nondet_float() [L173] CALL assume_abort_if_not((var_1_33 >= -461168.6018427382800e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 4611686.018427382800e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L173] RET assume_abort_if_not((var_1_33 >= -461168.6018427382800e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 4611686.018427382800e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L174] var_1_34 = __VERIFIER_nondet_float() [L175] CALL assume_abort_if_not((var_1_34 >= -461168.6018427382800e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 4611686.018427382800e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L175] RET assume_abort_if_not((var_1_34 >= -461168.6018427382800e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 4611686.018427382800e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_35=13/10, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L176] var_1_35 = __VERIFIER_nondet_float() [L177] CALL assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L177] RET assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L194] RET updateVariables() [L195] CALL step() [L59] COND TRUE var_1_22 || var_1_23 [L60] var_1_21 = ((var_1_24 > -4) || var_1_25) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L62] COND TRUE ((var_1_24 + 25) % var_1_27) < 2 [L63] var_1_26 = 8.5f VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L65] EXPR var_1_29 >> var_1_30 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L65] EXPR ((var_1_27) > ((var_1_29 >> var_1_30))) ? (var_1_27) : ((var_1_29 >> var_1_30)) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=10, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L65] COND TRUE var_1_24 > ((((var_1_27) > ((var_1_29 >> var_1_30))) ? (var_1_27) : ((var_1_29 >> var_1_30)))) [L66] var_1_28 = var_1_30 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=39/5, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L68] COND TRUE var_1_27 > var_1_28 [L69] var_1_31 = (((((var_1_32 + ((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))))) > (var_1_35)) ? ((var_1_32 + ((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))))) : (var_1_35))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L73] COND FALSE !(((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) < var_1_30) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L76] signed long int stepLocal_6 = last_1_var_1_1; [L77] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L78] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L79] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L82] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L87] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=126, var_1_6=10, var_1_7=739, var_1_8=1] [L90] COND TRUE var_1_5 >= -2 [L91] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=126, var_1_6=127, var_1_7=739, var_1_8=1] [L93] unsigned char stepLocal_4 = var_1_6; [L94] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=127, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=126, var_1_6=127, var_1_7=739, var_1_8=1] [L95] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=127, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=126, var_1_6=127, var_1_7=739, var_1_8=1] [L96] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L97] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=126, var_1_6=127, var_1_7=739, var_1_8=1] [L104] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=127, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=126, var_1_6=127, var_1_7=739, var_1_8=1] [L105] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=126, var_1_6=127, var_1_7=739, var_1_8=1] [L108] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=127, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=126, var_1_6=127, var_1_7=739, var_1_8=1] [L109] COND TRUE \read(var_1_19) [L110] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=127, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=127, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=126, var_1_6=127, var_1_7=739, var_1_8=1] [L116] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L117] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=127, stepLocal_1=739, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=127, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=126, var_1_6=127, var_1_7=739, var_1_8=1] [L118] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L125] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=127, stepLocal_1=739, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=127, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=126, var_1_6=127, var_1_7=739, var_1_8=0] [L195] RET step() [L196] CALL, EXPR property() [L186-L187] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; [L196] RET, EXPR property() [L196] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=127, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=126, var_1_6=127, var_1_7=739, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=127, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=126, var_1_6=127, var_1_7=739, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 171 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 9, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1090 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1057 mSDsluCounter, 3701 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2598 mSDsCounter, 566 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1695 IncrementalHoareTripleChecker+Invalid, 2261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 566 mSolverCounterUnsat, 1103 mSDtfsCounter, 1695 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1281 GetRequests, 1185 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1198occurred in iteration=7, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 751 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 2771 NumberOfCodeBlocks, 2771 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2164 ConstructedInterpolants, 2 QuantifiedInterpolants, 8208 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1872 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 19860/20460 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-17 00:16:48,893 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_fillercodesize_ps-cn-25_file-42.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5f62dbdf30439c22b90c0714165751cfb1215bac5efc8ba17b86c401a925f47d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:16:50,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:16:50,880 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 00:16:50,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:16:50,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:16:50,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:16:50,916 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:16:50,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:16:50,917 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:16:50,917 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:16:50,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:16:50,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:16:50,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:16:50,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:16:50,917 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:16:50,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:16:50,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:16:50,918 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:16:50,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:16:50,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:16:50,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:16:50,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:16:50,918 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:16:50,918 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 00:16:50,918 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 00:16:50,918 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 00:16:50,918 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:16:50,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:16:50,918 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:16:50,918 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:16:50,918 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:16:50,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:16:50,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:16:50,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:16:50,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:16:50,919 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:16:50,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:16:50,919 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:16:50,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:16:50,919 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 00:16:50,919 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 00:16:50,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:16:50,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:16:50,919 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:16:50,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:16:50,919 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 -> 5f62dbdf30439c22b90c0714165751cfb1215bac5efc8ba17b86c401a925f47d [2025-03-17 00:16:51,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:16:51,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:16:51,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:16:51,348 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:16:51,350 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:16:51,351 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2025-03-17 00:16:52,557 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/079a19535/c5cd1aa7f2b34e7c9ff07ac7c87997de/FLAG2527bddfd [2025-03-17 00:16:52,731 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:16:52,732 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2025-03-17 00:16:52,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/079a19535/c5cd1aa7f2b34e7c9ff07ac7c87997de/FLAG2527bddfd [2025-03-17 00:16:53,108 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/079a19535/c5cd1aa7f2b34e7c9ff07ac7c87997de [2025-03-17 00:16:53,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:16:53,111 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:16:53,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:16:53,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:16:53,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:16:53,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:16:53" (1/1) ... [2025-03-17 00:16:53,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f1bb135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:53, skipping insertion in model container [2025-03-17 00:16:53,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:16:53" (1/1) ... [2025-03-17 00:16:53,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:16:53,237 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_fillercodesize_ps-cn-25_file-42.i[915,928] [2025-03-17 00:16:53,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:16:53,333 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:16:53,340 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_fillercodesize_ps-cn-25_file-42.i[915,928] [2025-03-17 00:16:53,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:16:53,377 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:16:53,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:53 WrapperNode [2025-03-17 00:16:53,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:16:53,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:16:53,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:16:53,379 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:16:53,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:53" (1/1) ... [2025-03-17 00:16:53,397 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:53" (1/1) ... [2025-03-17 00:16:53,427 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2025-03-17 00:16:53,431 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:16:53,431 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:16:53,434 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:16:53,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:16:53,443 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:53" (1/1) ... [2025-03-17 00:16:53,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:53" (1/1) ... [2025-03-17 00:16:53,449 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:53" (1/1) ... [2025-03-17 00:16:53,470 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-17 00:16:53,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:53" (1/1) ... [2025-03-17 00:16:53,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:53" (1/1) ... [2025-03-17 00:16:53,483 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:53" (1/1) ... [2025-03-17 00:16:53,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:53" (1/1) ... [2025-03-17 00:16:53,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:53" (1/1) ... [2025-03-17 00:16:53,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:53" (1/1) ... [2025-03-17 00:16:53,493 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:16:53,497 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:16:53,497 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:16:53,497 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:16:53,498 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:53" (1/1) ... [2025-03-17 00:16:53,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:16:53,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:16:53,526 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-17 00:16:53,529 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-17 00:16:53,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:16:53,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 00:16:53,549 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:16:53,549 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:16:53,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:16:53,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:16:53,615 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:16:53,617 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:16:54,085 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-17 00:16:54,085 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:16:54,095 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:16:54,096 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:16:54,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:16:54 BoogieIcfgContainer [2025-03-17 00:16:54,096 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:16:54,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:16:54,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:16:54,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:16:54,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:16:53" (1/3) ... [2025-03-17 00:16:54,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6e8779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:16:54, skipping insertion in model container [2025-03-17 00:16:54,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:16:53" (2/3) ... [2025-03-17 00:16:54,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6e8779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:16:54, skipping insertion in model container [2025-03-17 00:16:54,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:16:54" (3/3) ... [2025-03-17 00:16:54,105 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2025-03-17 00:16:54,116 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:16:54,117 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-42.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:16:54,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:16:54,166 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;@238424e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:16:54,167 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:16:54,170 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 00:16:54,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-17 00:16:54,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:16:54,179 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:16:54,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:16:54,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:16:54,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1319247978, now seen corresponding path program 1 times [2025-03-17 00:16:54,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:16:54,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697981737] [2025-03-17 00:16:54,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:16:54,191 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-17 00:16:54,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:16:54,193 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-17 00:16:54,194 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-17 00:16:54,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-17 00:16:54,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-17 00:16:54,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:16:54,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:16:54,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:16:54,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:16:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 896 proven. 0 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2025-03-17 00:16:54,642 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:16:54,642 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:16:54,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697981737] [2025-03-17 00:16:54,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697981737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:16:54,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:16:54,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 00:16:54,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425863228] [2025-03-17 00:16:54,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:16:54,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:16:54,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:16:54,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:16:54,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:16:54,668 INFO L87 Difference]: Start difference. First operand has 83 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) 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, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 00:16:54,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:16:54,688 INFO L93 Difference]: Finished difference Result 163 states and 291 transitions. [2025-03-17 00:16:54,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:16:54,690 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, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 195 [2025-03-17 00:16:54,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:16:54,695 INFO L225 Difference]: With dead ends: 163 [2025-03-17 00:16:54,695 INFO L226 Difference]: Without dead ends: 81 [2025-03-17 00:16:54,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 194 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-17 00:16:54,703 INFO L435 NwaCegarLoop]: 127 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, 127 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-17 00:16:54,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:16:54,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-17 00:16:54,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-17 00:16:54,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 00:16:54,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 127 transitions. [2025-03-17 00:16:54,741 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 127 transitions. Word has length 195 [2025-03-17 00:16:54,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:16:54,741 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 127 transitions. [2025-03-17 00:16:54,741 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, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 00:16:54,745 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 127 transitions. [2025-03-17 00:16:54,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-17 00:16:54,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:16:54,747 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:16:54,761 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-17 00:16:54,948 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-17 00:16:54,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:16:54,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:16:54,950 INFO L85 PathProgramCache]: Analyzing trace with hash -442425229, now seen corresponding path program 1 times [2025-03-17 00:16:54,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:16:54,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720266011] [2025-03-17 00:16:54,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:16:54,951 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-17 00:16:54,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:16:54,955 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-17 00:16:54,956 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-17 00:16:55,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-17 00:16:55,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-17 00:16:55,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:16:55,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:16:55,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 00:16:55,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:16:55,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 587 proven. 24 refuted. 0 times theorem prover too weak. 1249 trivial. 0 not checked. [2025-03-17 00:16:55,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:16:55,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 00:16:55,716 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:16:55,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720266011] [2025-03-17 00:16:55,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [720266011] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 00:16:55,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:16:55,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-17 00:16:55,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134257149] [2025-03-17 00:16:55,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:16:55,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:16:55,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:16:55,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:16:55,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:16:55,720 INFO L87 Difference]: Start difference. First operand 81 states and 127 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:16:55,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:16:55,883 INFO L93 Difference]: Finished difference Result 227 states and 356 transitions. [2025-03-17 00:16:55,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:16:55,886 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 195 [2025-03-17 00:16:55,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:16:55,888 INFO L225 Difference]: With dead ends: 227 [2025-03-17 00:16:55,890 INFO L226 Difference]: Without dead ends: 147 [2025-03-17 00:16:55,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:16:55,891 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 100 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:16:55,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 241 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:16:55,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-17 00:16:55,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2025-03-17 00:16:55,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 86 states have internal predecessors, (115), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 00:16:55,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 227 transitions. [2025-03-17 00:16:55,909 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 227 transitions. Word has length 195 [2025-03-17 00:16:55,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:16:55,912 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 227 transitions. [2025-03-17 00:16:55,912 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:16:55,912 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 227 transitions. [2025-03-17 00:16:55,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-17 00:16:55,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:16:55,914 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:16:55,926 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-17 00:16:56,114 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-17 00:16:56,115 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:16:56,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:16:56,115 INFO L85 PathProgramCache]: Analyzing trace with hash -952959406, now seen corresponding path program 1 times [2025-03-17 00:16:56,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:16:56,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548993765] [2025-03-17 00:16:56,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:16:56,116 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-17 00:16:56,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:16:56,118 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-17 00:16:56,118 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-17 00:16:56,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-17 00:16:56,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-17 00:16:56,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:16:56,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:16:56,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 00:16:56,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:16:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 00:16:56,677 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:16:56,677 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:16:56,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548993765] [2025-03-17 00:16:56,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548993765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:16:56,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:16:56,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:16:56,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530196782] [2025-03-17 00:16:56,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:16:56,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:16:56,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:16:56,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:16:56,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:16:56,678 INFO L87 Difference]: Start difference. First operand 144 states and 227 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:16:56,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:16:56,979 INFO L93 Difference]: Finished difference Result 394 states and 618 transitions. [2025-03-17 00:16:56,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:16:56,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 195 [2025-03-17 00:16:56,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:16:56,986 INFO L225 Difference]: With dead ends: 394 [2025-03-17 00:16:56,986 INFO L226 Difference]: Without dead ends: 251 [2025-03-17 00:16:56,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:16:56,987 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 90 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:16:56,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 367 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:16:56,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-17 00:16:57,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 213. [2025-03-17 00:16:57,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 122 states have internal predecessors, (157), 87 states have call successors, (87), 4 states have call predecessors, (87), 4 states have return successors, (87), 86 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-17 00:16:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 331 transitions. [2025-03-17 00:16:57,029 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 331 transitions. Word has length 195 [2025-03-17 00:16:57,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:16:57,030 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 331 transitions. [2025-03-17 00:16:57,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:16:57,030 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 331 transitions. [2025-03-17 00:16:57,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-17 00:16:57,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:16:57,034 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:16:57,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-17 00:16:57,235 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-17 00:16:57,235 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:16:57,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:16:57,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1913218828, now seen corresponding path program 1 times [2025-03-17 00:16:57,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:16:57,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196984819] [2025-03-17 00:16:57,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:16:57,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:16:57,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:16:57,238 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-17 00:16:57,239 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-17 00:16:57,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-17 00:16:57,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-17 00:16:57,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:16:57,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:16:57,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 00:16:57,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:16:58,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 00:16:58,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:16:58,195 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:16:58,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196984819] [2025-03-17 00:16:58,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196984819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:16:58,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:16:58,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:16:58,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238515179] [2025-03-17 00:16:58,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:16:58,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:16:58,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:16:58,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:16:58,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:16:58,197 INFO L87 Difference]: Start difference. First operand 213 states and 331 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:16:58,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:16:58,799 INFO L93 Difference]: Finished difference Result 583 states and 914 transitions. [2025-03-17 00:16:58,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 00:16:58,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2025-03-17 00:16:58,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:16:58,807 INFO L225 Difference]: With dead ends: 583 [2025-03-17 00:16:58,807 INFO L226 Difference]: Without dead ends: 440 [2025-03-17 00:16:58,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:16:58,808 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:16:58,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 481 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:16:58,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-03-17 00:16:58,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 354. [2025-03-17 00:16:58,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 204 states have (on average 1.3137254901960784) internal successors, (268), 206 states have internal predecessors, (268), 143 states have call successors, (143), 6 states have call predecessors, (143), 6 states have return successors, (143), 141 states have call predecessors, (143), 143 states have call successors, (143) [2025-03-17 00:16:58,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 554 transitions. [2025-03-17 00:16:58,857 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 554 transitions. Word has length 196 [2025-03-17 00:16:58,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:16:58,858 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 554 transitions. [2025-03-17 00:16:58,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:16:58,858 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 554 transitions. [2025-03-17 00:16:58,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-17 00:16:58,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:16:58,859 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:16:58,873 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-17 00:16:59,060 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-17 00:16:59,060 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:16:59,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:16:59,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1876189843, now seen corresponding path program 1 times [2025-03-17 00:16:59,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:16:59,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411776127] [2025-03-17 00:16:59,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:16:59,061 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-17 00:16:59,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:16:59,063 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-17 00:16:59,065 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-17 00:16:59,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-17 00:16:59,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-17 00:16:59,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:16:59,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:16:59,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 00:16:59,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:16:59,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 00:16:59,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:16:59,369 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:16:59,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411776127] [2025-03-17 00:16:59,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411776127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:16:59,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:16:59,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:16:59,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902798119] [2025-03-17 00:16:59,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:16:59,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:16:59,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:16:59,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:16:59,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:16:59,371 INFO L87 Difference]: Start difference. First operand 354 states and 554 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:16:59,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:16:59,516 INFO L93 Difference]: Finished difference Result 638 states and 1003 transitions. [2025-03-17 00:16:59,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:16:59,523 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2025-03-17 00:16:59,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:16:59,526 INFO L225 Difference]: With dead ends: 638 [2025-03-17 00:16:59,526 INFO L226 Difference]: Without dead ends: 354 [2025-03-17 00:16:59,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 194 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-17 00:16:59,527 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:16:59,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:16:59,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-17 00:16:59,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-03-17 00:16:59,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 204 states have (on average 1.2941176470588236) internal successors, (264), 206 states have internal predecessors, (264), 143 states have call successors, (143), 6 states have call predecessors, (143), 6 states have return successors, (143), 141 states have call predecessors, (143), 143 states have call successors, (143) [2025-03-17 00:16:59,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 550 transitions. [2025-03-17 00:16:59,566 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 550 transitions. Word has length 196 [2025-03-17 00:16:59,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:16:59,567 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 550 transitions. [2025-03-17 00:16:59,567 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:16:59,567 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 550 transitions. [2025-03-17 00:16:59,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-17 00:16:59,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:16:59,569 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:16:59,582 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-17 00:16:59,769 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-17 00:16:59,770 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:16:59,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:16:59,770 INFO L85 PathProgramCache]: Analyzing trace with hash -675967118, now seen corresponding path program 1 times [2025-03-17 00:16:59,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:16:59,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246386353] [2025-03-17 00:16:59,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:16:59,771 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-17 00:16:59,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:16:59,773 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-17 00:16:59,774 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-17 00:16:59,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-17 00:17:00,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-17 00:17:00,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:17:00,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:17:00,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 00:17:00,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:17:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 947 proven. 123 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2025-03-17 00:17:00,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:17:00,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 51 proven. 126 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2025-03-17 00:17:00,825 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:17:00,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246386353] [2025-03-17 00:17:00,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246386353] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:17:00,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 00:17:00,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2025-03-17 00:17:00,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425161681] [2025-03-17 00:17:00,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 00:17:00,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 00:17:00,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:17:00,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 00:17:00,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-17 00:17:00,826 INFO L87 Difference]: Start difference. First operand 354 states and 550 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2025-03-17 00:17:01,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:17:01,759 INFO L93 Difference]: Finished difference Result 756 states and 1108 transitions. [2025-03-17 00:17:01,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 00:17:01,760 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 196 [2025-03-17 00:17:01,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:17:01,764 INFO L225 Difference]: With dead ends: 756 [2025-03-17 00:17:01,764 INFO L226 Difference]: Without dead ends: 613 [2025-03-17 00:17:01,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 380 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 00:17:01,767 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 170 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:17:01,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 450 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 00:17:01,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-03-17 00:17:01,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 569. [2025-03-17 00:17:01,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 347 states have (on average 1.2651296829971181) internal successors, (439), 350 states have internal predecessors, (439), 199 states have call successors, (199), 22 states have call predecessors, (199), 22 states have return successors, (199), 196 states have call predecessors, (199), 199 states have call successors, (199) [2025-03-17 00:17:01,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 837 transitions. [2025-03-17 00:17:01,817 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 837 transitions. Word has length 196 [2025-03-17 00:17:01,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:17:01,818 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 837 transitions. [2025-03-17 00:17:01,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2025-03-17 00:17:01,818 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 837 transitions. [2025-03-17 00:17:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-17 00:17:01,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:17:01,819 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:17:01,831 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 (7)] Forceful destruction successful, exit code 0 [2025-03-17 00:17:02,020 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-17 00:17:02,020 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:17:02,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:17:02,021 INFO L85 PathProgramCache]: Analyzing trace with hash -969370125, now seen corresponding path program 1 times [2025-03-17 00:17:02,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:17:02,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654313682] [2025-03-17 00:17:02,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:17:02,021 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-17 00:17:02,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:17:02,024 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-17 00:17:02,025 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-17 00:17:02,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-17 00:17:02,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-17 00:17:02,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:17:02,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:17:02,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 00:17:02,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:17:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 258 proven. 84 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2025-03-17 00:17:02,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:17:03,289 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:17:03,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654313682] [2025-03-17 00:17:03,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654313682] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:17:03,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [917292629] [2025-03-17 00:17:03,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:17:03,290 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 00:17:03,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 00:17:03,291 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 00:17:03,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-03-17 00:17:03,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-17 00:17:04,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-17 00:17:04,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:17:04,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:17:04,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 00:17:04,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:17:04,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 00:17:04,604 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:17:04,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [917292629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:17:04,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:17:04,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-17 00:17:04,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595463914] [2025-03-17 00:17:04,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:17:04,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 00:17:04,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:17:04,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 00:17:04,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 00:17:04,607 INFO L87 Difference]: Start difference. First operand 569 states and 837 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:17:06,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:17:06,213 INFO L93 Difference]: Finished difference Result 1570 states and 2281 transitions. [2025-03-17 00:17:06,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 00:17:06,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2025-03-17 00:17:06,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:17:06,228 INFO L225 Difference]: With dead ends: 1570 [2025-03-17 00:17:06,228 INFO L226 Difference]: Without dead ends: 1256 [2025-03-17 00:17:06,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-17 00:17:06,230 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 134 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:17:06,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 534 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 00:17:06,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2025-03-17 00:17:06,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1128. [2025-03-17 00:17:06,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 708 states have (on average 1.268361581920904) internal successors, (898), 718 states have internal predecessors, (898), 375 states have call successors, (375), 44 states have call predecessors, (375), 44 states have return successors, (375), 365 states have call predecessors, (375), 375 states have call successors, (375) [2025-03-17 00:17:06,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1648 transitions. [2025-03-17 00:17:06,345 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1648 transitions. Word has length 196 [2025-03-17 00:17:06,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:17:06,346 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1648 transitions. [2025-03-17 00:17:06,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:17:06,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1648 transitions. [2025-03-17 00:17:06,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-17 00:17:06,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:17:06,348 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:17:06,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2025-03-17 00:17:06,562 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 (8)] Forceful destruction successful, exit code 0 [2025-03-17 00:17:06,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /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-17 00:17:06,749 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:17:06,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:17:06,750 INFO L85 PathProgramCache]: Analyzing trace with hash -840287406, now seen corresponding path program 1 times [2025-03-17 00:17:06,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:17:06,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332311658] [2025-03-17 00:17:06,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:17:06,750 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-17 00:17:06,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:17:06,753 INFO L229 MonitoredProcess]: Starting monitored process 10 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-17 00:17:06,754 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 (10)] Waiting until timeout for monitored process [2025-03-17 00:17:06,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-17 00:17:07,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-17 00:17:07,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:17:07,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:17:07,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 00:17:07,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:17:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 258 proven. 84 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2025-03-17 00:17:07,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:17:08,025 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:17:08,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332311658] [2025-03-17 00:17:08,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332311658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:17:08,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [964792239] [2025-03-17 00:17:08,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:17:08,025 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 00:17:08,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 00:17:08,027 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 00:17:08,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2025-03-17 00:17:08,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-17 00:17:08,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-17 00:17:08,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:17:08,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:17:08,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 00:17:08,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:17:09,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 00:17:09,523 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:17:09,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [964792239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:17:09,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:17:09,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-03-17 00:17:09,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018106] [2025-03-17 00:17:09,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:17:09,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:17:09,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:17:09,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:17:09,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-17 00:17:09,524 INFO L87 Difference]: Start difference. First operand 1128 states and 1648 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:17:11,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:17:11,279 INFO L93 Difference]: Finished difference Result 1993 states and 2914 transitions. [2025-03-17 00:17:11,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:17:11,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2025-03-17 00:17:11,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:17:11,289 INFO L225 Difference]: With dead ends: 1993 [2025-03-17 00:17:11,289 INFO L226 Difference]: Without dead ends: 1514 [2025-03-17 00:17:11,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-17 00:17:11,292 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 88 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:17:11,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 463 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 00:17:11,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2025-03-17 00:17:11,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1440. [2025-03-17 00:17:11,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 896 states have (on average 1.2611607142857142) internal successors, (1130), 908 states have internal predecessors, (1130), 487 states have call successors, (487), 56 states have call predecessors, (487), 56 states have return successors, (487), 475 states have call predecessors, (487), 487 states have call successors, (487) [2025-03-17 00:17:11,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 2104 transitions. [2025-03-17 00:17:11,418 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 2104 transitions. Word has length 196 [2025-03-17 00:17:11,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:17:11,418 INFO L471 AbstractCegarLoop]: Abstraction has 1440 states and 2104 transitions. [2025-03-17 00:17:11,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:17:11,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 2104 transitions. [2025-03-17 00:17:11,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-17 00:17:11,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:17:11,422 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:17:11,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2025-03-17 00:17:11,634 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 (10)] Ended with exit code 0 [2025-03-17 00:17:11,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /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-17 00:17:11,823 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:17:11,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:17:11,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1015386510, now seen corresponding path program 1 times [2025-03-17 00:17:11,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:17:11,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804823900] [2025-03-17 00:17:11,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:17:11,824 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-17 00:17:11,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:17:11,826 INFO L229 MonitoredProcess]: Starting monitored process 12 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-17 00:17:11,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-03-17 00:17:11,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-17 00:17:12,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-17 00:17:12,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:17:12,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:17:12,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 00:17:12,184 INFO L279 TraceCheckSpWp]: Computing forward predicates...