./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-53.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_fillercodestructure_filler-pr-co_file-53.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 18a28dd9fabec49f402c0f8b2e2f11d6a9036437fc512405ace7df9d63b865bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:47:04,932 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:47:04,984 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:47:04,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:47:04,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:47:05,018 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:47:05,019 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:47:05,019 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:47:05,020 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:47:05,020 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:47:05,020 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:47:05,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:47:05,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:47:05,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:47:05,021 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:47:05,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:47:05,021 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:47:05,022 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:47:05,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:47:05,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:47:05,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:47:05,022 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:47:05,022 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:47:05,022 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:47:05,022 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:47:05,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:47:05,022 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:47:05,022 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:47:05,022 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:47:05,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:47:05,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:47:05,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:47:05,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:47:05,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:47:05,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:47:05,024 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:47:05,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:47:05,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:47:05,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:47:05,024 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:47:05,024 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:47:05,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:47:05,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:47:05,024 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 -> 18a28dd9fabec49f402c0f8b2e2f11d6a9036437fc512405ace7df9d63b865bf [2025-03-17 01:47:05,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:47:05,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:47:05,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:47:05,250 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:47:05,250 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:47:05,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i [2025-03-17 01:47:06,407 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d47dbbd57/b336b2aabb8d44708fc55ffbf4184907/FLAGc670bf7a9 [2025-03-17 01:47:06,634 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:47:06,634 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i [2025-03-17 01:47:06,641 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d47dbbd57/b336b2aabb8d44708fc55ffbf4184907/FLAGc670bf7a9 [2025-03-17 01:47:06,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d47dbbd57/b336b2aabb8d44708fc55ffbf4184907 [2025-03-17 01:47:06,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:47:06,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:47:06,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:47:06,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:47:06,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:47:06,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:06,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d373726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06, skipping insertion in model container [2025-03-17 01:47:06,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:06,676 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:47:06,801 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i[919,932] [2025-03-17 01:47:06,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:47:06,877 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:47:06,886 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i[919,932] [2025-03-17 01:47:06,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:47:06,946 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:47:06,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06 WrapperNode [2025-03-17 01:47:06,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:47:06,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:47:06,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:47:06,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:47:06,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:06,960 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:06,988 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 256 [2025-03-17 01:47:06,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:47:06,989 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:47:06,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:47:06,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:47:07,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:07,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:07,008 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:07,025 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 01:47:07,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:07,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:07,036 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:07,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:07,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:07,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:07,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:47:07,050 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:47:07,051 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:47:07,051 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:47:07,052 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (1/1) ... [2025-03-17 01:47:07,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:47:07,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:47:07,078 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 01:47:07,084 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 01:47:07,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:47:07,100 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:47:07,101 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:47:07,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:47:07,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:47:07,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:47:07,181 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:47:07,182 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:47:07,566 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L203: havoc property_#t~ite24#1;havoc property_#t~bitwise23#1;havoc property_#t~short25#1;havoc property_#t~bitwise26#1;havoc property_#t~short27#1; [2025-03-17 01:47:07,602 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-17 01:47:07,602 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:47:07,617 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:47:07,617 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 01:47:07,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:47:07 BoogieIcfgContainer [2025-03-17 01:47:07,618 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:47:07,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:47:07,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:47:07,624 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:47:07,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:47:06" (1/3) ... [2025-03-17 01:47:07,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e30003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:47:07, skipping insertion in model container [2025-03-17 01:47:07,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:06" (2/3) ... [2025-03-17 01:47:07,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e30003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:47:07, skipping insertion in model container [2025-03-17 01:47:07,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:47:07" (3/3) ... [2025-03-17 01:47:07,626 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i [2025-03-17 01:47:07,637 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:47:07,639 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i that has 2 procedures, 106 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:47:07,680 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:47:07,688 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;@346df4eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:47:07,689 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:47:07,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 72 states have (on average 1.4722222222222223) internal successors, (106), 73 states have internal predecessors, (106), 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 01:47:07,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-17 01:47:07,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:07,701 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, 1, 1] [2025-03-17 01:47:07,701 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:07,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:07,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1233804774, now seen corresponding path program 1 times [2025-03-17 01:47:07,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:07,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839719132] [2025-03-17 01:47:07,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:07,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:07,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 01:47:07,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 01:47:07,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:07,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:08,014 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 01:47:08,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:08,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839719132] [2025-03-17 01:47:08,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839719132] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:47:08,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373489182] [2025-03-17 01:47:08,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:08,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:47:08,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:47:08,017 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 01:47:08,019 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 01:47:08,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 01:47:08,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 01:47:08,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:08,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:08,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:47:08,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:47:08,217 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 01:47:08,220 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:47:08,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373489182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:08,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:47:08,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:47:08,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084424712] [2025-03-17 01:47:08,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:08,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:47:08,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:08,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:47:08,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:47:08,249 INFO L87 Difference]: Start difference. First operand has 106 states, 72 states have (on average 1.4722222222222223) internal successors, (106), 73 states have internal predecessors, (106), 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 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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 01:47:08,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:08,281 INFO L93 Difference]: Finished difference Result 209 states and 365 transitions. [2025-03-17 01:47:08,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:47:08,283 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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 201 [2025-03-17 01:47:08,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:08,291 INFO L225 Difference]: With dead ends: 209 [2025-03-17 01:47:08,291 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 01:47:08,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 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 01:47:08,295 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:08,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:47:08,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 01:47:08,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-17 01:47:08,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 71 states have (on average 1.4225352112676057) internal successors, (101), 71 states have internal predecessors, (101), 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 01:47:08,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 163 transitions. [2025-03-17 01:47:08,340 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 163 transitions. Word has length 201 [2025-03-17 01:47:08,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:08,340 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 163 transitions. [2025-03-17 01:47:08,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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 01:47:08,340 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 163 transitions. [2025-03-17 01:47:08,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-17 01:47:08,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:08,343 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, 1, 1, 1] [2025-03-17 01:47:08,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 01:47:08,547 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 01:47:08,547 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:08,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:08,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1398413233, now seen corresponding path program 1 times [2025-03-17 01:47:08,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:08,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186205352] [2025-03-17 01:47:08,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:08,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:08,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 01:47:08,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 01:47:08,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:08,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:08,799 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 01:47:08,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:08,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186205352] [2025-03-17 01:47:08,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186205352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:08,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:08,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:47:08,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915493300] [2025-03-17 01:47:08,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:08,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:47:08,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:08,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:47:08,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:47:08,801 INFO L87 Difference]: Start difference. First operand 104 states and 163 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 01:47:08,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:08,892 INFO L93 Difference]: Finished difference Result 299 states and 468 transitions. [2025-03-17 01:47:08,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:47:08,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 202 [2025-03-17 01:47:08,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:08,896 INFO L225 Difference]: With dead ends: 299 [2025-03-17 01:47:08,897 INFO L226 Difference]: Without dead ends: 196 [2025-03-17 01:47:08,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:47:08,900 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 144 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:08,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 281 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:47:08,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-17 01:47:08,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2025-03-17 01:47:08,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 129 states have (on average 1.3643410852713178) internal successors, (176), 129 states have internal predecessors, (176), 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 01:47:08,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 300 transitions. [2025-03-17 01:47:08,935 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 300 transitions. Word has length 202 [2025-03-17 01:47:08,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:08,935 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 300 transitions. [2025-03-17 01:47:08,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 01:47:08,936 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 300 transitions. [2025-03-17 01:47:08,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-17 01:47:08,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:08,938 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, 1, 1, 1, 1, 1] [2025-03-17 01:47:08,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:47:08,938 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:08,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:08,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1641168747, now seen corresponding path program 1 times [2025-03-17 01:47:08,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:08,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933344139] [2025-03-17 01:47:08,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:08,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:08,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-17 01:47:08,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-17 01:47:08,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:08,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:09,155 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 01:47:09,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:09,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933344139] [2025-03-17 01:47:09,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933344139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:09,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:09,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:47:09,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33867418] [2025-03-17 01:47:09,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:09,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:47:09,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:09,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:47:09,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:47:09,162 INFO L87 Difference]: Start difference. First operand 194 states and 300 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 01:47:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:09,285 INFO L93 Difference]: Finished difference Result 507 states and 784 transitions. [2025-03-17 01:47:09,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:47:09,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 204 [2025-03-17 01:47:09,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:09,290 INFO L225 Difference]: With dead ends: 507 [2025-03-17 01:47:09,292 INFO L226 Difference]: Without dead ends: 314 [2025-03-17 01:47:09,292 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 01:47:09,293 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 154 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:09,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 415 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:47:09,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-17 01:47:09,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 197. [2025-03-17 01:47:09,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 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 01:47:09,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 304 transitions. [2025-03-17 01:47:09,326 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 304 transitions. Word has length 204 [2025-03-17 01:47:09,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:09,327 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 304 transitions. [2025-03-17 01:47:09,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 01:47:09,327 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 304 transitions. [2025-03-17 01:47:09,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-17 01:47:09,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:09,331 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, 1, 1, 1, 1, 1] [2025-03-17 01:47:09,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:47:09,331 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:09,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:09,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1934571754, now seen corresponding path program 1 times [2025-03-17 01:47:09,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:09,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439193287] [2025-03-17 01:47:09,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:09,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:09,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-17 01:47:09,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-17 01:47:09,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:09,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:09,564 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 01:47:09,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:09,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439193287] [2025-03-17 01:47:09,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439193287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:09,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:09,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:47:09,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675913152] [2025-03-17 01:47:09,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:09,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:47:09,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:09,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:47:09,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:47:09,567 INFO L87 Difference]: Start difference. First operand 197 states and 304 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (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 01:47:09,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:09,789 INFO L93 Difference]: Finished difference Result 669 states and 1029 transitions. [2025-03-17 01:47:09,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:47:09,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (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 204 [2025-03-17 01:47:09,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:09,793 INFO L225 Difference]: With dead ends: 669 [2025-03-17 01:47:09,793 INFO L226 Difference]: Without dead ends: 473 [2025-03-17 01:47:09,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 01:47:09,794 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 175 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:09,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 486 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:47:09,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-03-17 01:47:09,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 455. [2025-03-17 01:47:09,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 326 states have (on average 1.392638036809816) internal successors, (454), 326 states have internal predecessors, (454), 124 states have call successors, (124), 4 states have call predecessors, (124), 4 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-17 01:47:09,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 702 transitions. [2025-03-17 01:47:09,838 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 702 transitions. Word has length 204 [2025-03-17 01:47:09,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:09,839 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 702 transitions. [2025-03-17 01:47:09,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (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 01:47:09,839 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 702 transitions. [2025-03-17 01:47:09,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-17 01:47:09,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:09,841 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, 1, 1, 1, 1, 1, 1] [2025-03-17 01:47:09,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 01:47:09,841 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:09,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:09,841 INFO L85 PathProgramCache]: Analyzing trace with hash 666843745, now seen corresponding path program 1 times [2025-03-17 01:47:09,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:09,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781472380] [2025-03-17 01:47:09,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:09,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:09,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 01:47:09,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 01:47:09,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:09,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:10,198 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 01:47:10,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:10,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781472380] [2025-03-17 01:47:10,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781472380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:10,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:10,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 01:47:10,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805947309] [2025-03-17 01:47:10,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:10,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 01:47:10,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:10,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 01:47:10,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 01:47:10,201 INFO L87 Difference]: Start difference. First operand 455 states and 702 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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 01:47:11,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:11,150 INFO L93 Difference]: Finished difference Result 1460 states and 2202 transitions. [2025-03-17 01:47:11,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 01:47:11,150 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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 205 [2025-03-17 01:47:11,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:11,155 INFO L225 Difference]: With dead ends: 1460 [2025-03-17 01:47:11,156 INFO L226 Difference]: Without dead ends: 1006 [2025-03-17 01:47:11,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:47:11,159 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 611 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:11,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 1084 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 01:47:11,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2025-03-17 01:47:11,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 471. [2025-03-17 01:47:11,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 338 states have (on average 1.378698224852071) internal successors, (466), 338 states have internal predecessors, (466), 124 states have call successors, (124), 8 states have call predecessors, (124), 8 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-17 01:47:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 714 transitions. [2025-03-17 01:47:11,230 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 714 transitions. Word has length 205 [2025-03-17 01:47:11,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:11,230 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 714 transitions. [2025-03-17 01:47:11,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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 01:47:11,230 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 714 transitions. [2025-03-17 01:47:11,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-17 01:47:11,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:11,233 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, 1, 1, 1, 1, 1, 1] [2025-03-17 01:47:11,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 01:47:11,235 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:11,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:11,235 INFO L85 PathProgramCache]: Analyzing trace with hash 795926464, now seen corresponding path program 1 times [2025-03-17 01:47:11,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:11,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297472996] [2025-03-17 01:47:11,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:11,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:11,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 01:47:11,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 01:47:11,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:11,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:11,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-17 01:47:11,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:11,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297472996] [2025-03-17 01:47:11,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297472996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:47:11,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603906555] [2025-03-17 01:47:11,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:11,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:47:11,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:47:11,635 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 01:47:11,636 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 01:47:11,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 01:47:11,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 01:47:11,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:11,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:11,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 01:47:11,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:47:12,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 960 proven. 45 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2025-03-17 01:47:12,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:47:12,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-17 01:47:12,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603906555] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:47:12,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 01:47:12,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 20 [2025-03-17 01:47:12,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160111139] [2025-03-17 01:47:12,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 01:47:12,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 01:47:12,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:12,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 01:47:12,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-03-17 01:47:12,687 INFO L87 Difference]: Start difference. First operand 471 states and 714 transitions. Second operand has 20 states, 20 states have (on average 5.5) internal successors, (110), 20 states have internal predecessors, (110), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) [2025-03-17 01:47:14,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:14,887 INFO L93 Difference]: Finished difference Result 1407 states and 2076 transitions. [2025-03-17 01:47:14,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-17 01:47:14,888 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 20 states have internal predecessors, (110), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) Word has length 205 [2025-03-17 01:47:14,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:14,892 INFO L225 Difference]: With dead ends: 1407 [2025-03-17 01:47:14,893 INFO L226 Difference]: Without dead ends: 937 [2025-03-17 01:47:14,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 401 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=739, Invalid=2683, Unknown=0, NotChecked=0, Total=3422 [2025-03-17 01:47:14,896 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 772 mSDsluCounter, 2126 mSDsCounter, 0 mSdLazyCounter, 2300 mSolverCounterSat, 554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 2499 SdHoareTripleChecker+Invalid, 2854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 554 IncrementalHoareTripleChecker+Valid, 2300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:14,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 2499 Invalid, 2854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [554 Valid, 2300 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 01:47:14,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2025-03-17 01:47:14,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 478. [2025-03-17 01:47:14,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 341 states have (on average 1.3577712609970674) internal successors, (463), 341 states have internal predecessors, (463), 124 states have call successors, (124), 12 states have call predecessors, (124), 12 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-17 01:47:14,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 711 transitions. [2025-03-17 01:47:14,980 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 711 transitions. Word has length 205 [2025-03-17 01:47:14,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:14,981 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 711 transitions. [2025-03-17 01:47:14,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 20 states have internal predecessors, (110), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) [2025-03-17 01:47:14,981 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 711 transitions. [2025-03-17 01:47:14,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-17 01:47:14,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:14,985 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:47:14,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 01:47:15,185 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 01:47:15,186 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:15,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:15,187 INFO L85 PathProgramCache]: Analyzing trace with hash -874651438, now seen corresponding path program 1 times [2025-03-17 01:47:15,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:15,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932187690] [2025-03-17 01:47:15,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:15,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:15,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 01:47:15,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 01:47:15,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:15,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:15,267 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 01:47:15,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:15,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932187690] [2025-03-17 01:47:15,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932187690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:15,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:15,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:47:15,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089747270] [2025-03-17 01:47:15,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:15,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:47:15,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:15,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:47:15,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:47:15,270 INFO L87 Difference]: Start difference. First operand 478 states and 711 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 01:47:15,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:15,342 INFO L93 Difference]: Finished difference Result 974 states and 1448 transitions. [2025-03-17 01:47:15,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:47:15,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 206 [2025-03-17 01:47:15,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:15,346 INFO L225 Difference]: With dead ends: 974 [2025-03-17 01:47:15,347 INFO L226 Difference]: Without dead ends: 497 [2025-03-17 01:47:15,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:47:15,350 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 127 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:15,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 416 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:47:15,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-03-17 01:47:15,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 495. [2025-03-17 01:47:15,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 358 states have (on average 1.3156424581005586) internal successors, (471), 358 states have internal predecessors, (471), 124 states have call successors, (124), 12 states have call predecessors, (124), 12 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-17 01:47:15,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 719 transitions. [2025-03-17 01:47:15,420 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 719 transitions. Word has length 206 [2025-03-17 01:47:15,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:15,420 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 719 transitions. [2025-03-17 01:47:15,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 01:47:15,420 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 719 transitions. [2025-03-17 01:47:15,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-17 01:47:15,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:15,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:47:15,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 01:47:15,423 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:15,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:15,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1526512210, now seen corresponding path program 1 times [2025-03-17 01:47:15,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:15,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929873745] [2025-03-17 01:47:15,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:15,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:15,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 01:47:15,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 01:47:15,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:15,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:15,791 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 01:47:15,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:47:15,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929873745] [2025-03-17 01:47:15,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929873745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:15,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:15,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 01:47:15,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313289803] [2025-03-17 01:47:15,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:15,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:47:15,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:47:15,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:47:15,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:47:15,793 INFO L87 Difference]: Start difference. First operand 495 states and 719 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 01:47:17,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:17,042 INFO L93 Difference]: Finished difference Result 2186 states and 3159 transitions. [2025-03-17 01:47:17,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 01:47:17,042 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 206 [2025-03-17 01:47:17,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:17,051 INFO L225 Difference]: With dead ends: 2186 [2025-03-17 01:47:17,051 INFO L226 Difference]: Without dead ends: 1692 [2025-03-17 01:47:17,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=429, Unknown=0, NotChecked=0, Total=600 [2025-03-17 01:47:17,053 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 805 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:17,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 951 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 01:47:17,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2025-03-17 01:47:17,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 934. [2025-03-17 01:47:17,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 661 states have (on average 1.291981845688351) internal successors, (854), 661 states have internal predecessors, (854), 248 states have call successors, (248), 24 states have call predecessors, (248), 24 states have return successors, (248), 248 states have call predecessors, (248), 248 states have call successors, (248) [2025-03-17 01:47:17,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1350 transitions. [2025-03-17 01:47:17,170 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1350 transitions. Word has length 206 [2025-03-17 01:47:17,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:17,172 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1350 transitions. [2025-03-17 01:47:17,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 01:47:17,173 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1350 transitions. [2025-03-17 01:47:17,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-17 01:47:17,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:17,176 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:47:17,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 01:47:17,176 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:17,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:17,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1329998705, now seen corresponding path program 1 times [2025-03-17 01:47:17,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:47:17,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423988618] [2025-03-17 01:47:17,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:17,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:47:17,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 01:47:17,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 01:47:17,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:17,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 01:47:17,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [93935814] [2025-03-17 01:47:17,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:17,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:47:17,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:47:17,293 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 01:47:17,295 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 01:47:17,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 01:47:17,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 01:47:17,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:17,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 01:47:17,399 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 01:47:17,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 01:47:17,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 01:47:17,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:17,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 01:47:17,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 01:47:17,562 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 01:47:17,563 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 01:47:17,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 01:47:17,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:47:17,768 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:47:17,892 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 01:47:17,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 01:47:17 BoogieIcfgContainer [2025-03-17 01:47:17,898 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 01:47:17,899 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 01:47:17,899 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 01:47:17,899 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 01:47:17,900 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:47:07" (3/4) ... [2025-03-17 01:47:17,901 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 01:47:17,902 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 01:47:17,903 INFO L158 Benchmark]: Toolchain (without parser) took 11248.63ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 113.1MB in the beginning and 171.6MB in the end (delta: -58.5MB). Peak memory consumption was 68.4MB. Max. memory is 16.1GB. [2025-03-17 01:47:17,903 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:47:17,903 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.03ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 97.0MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 01:47:17,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.48ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 92.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:47:17,904 INFO L158 Benchmark]: Boogie Preprocessor took 61.02ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 87.7MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 01:47:17,904 INFO L158 Benchmark]: IcfgBuilder took 567.62ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 56.4MB in the end (delta: 31.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 01:47:17,904 INFO L158 Benchmark]: TraceAbstraction took 10277.59ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 56.0MB in the beginning and 171.6MB in the end (delta: -115.6MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2025-03-17 01:47:17,904 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 268.4MB. Free memory was 171.6MB in the beginning and 171.6MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:47:17,905 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.65ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.03ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 97.0MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.48ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 92.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.02ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 87.7MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 567.62ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 56.4MB in the end (delta: 31.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10277.59ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 56.0MB in the beginning and 171.6MB in the end (delta: -115.6MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 268.4MB. Free memory was 171.6MB in the beginning and 171.6MB in the end (delta: 42.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 shiftLeft at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 184, overapproximation of someBinaryFLOATComparisonOperation at line 203, overapproximation of someBinaryFLOATComparisonOperation at line 154, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 150, overapproximation of someBinaryFLOATComparisonOperation at line 180, overapproximation of someBinaryFLOATComparisonOperation at line 203, overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of someBinaryFLOATComparisonOperation at line 141, overapproximation of someBinaryFLOATComparisonOperation at line 152, overapproximation of someBinaryArithmeticFLOAToperation at line 77, overapproximation of someBinaryArithmeticFLOAToperation at line 132, overapproximation of someUnaryFLOAToperation at line 77. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_8 = 0; [L24] unsigned long int var_1_9 = 10; [L25] float var_1_10 = 99.5; [L26] float var_1_11 = 5.6; [L27] float var_1_12 = 255.5; [L28] float var_1_13 = 31.25; [L29] signed short int var_1_14 = 32; [L30] unsigned long int var_1_15 = 16; [L31] unsigned char var_1_16 = 1; [L32] unsigned char var_1_17 = 5; [L33] unsigned char var_1_18 = 50; [L34] unsigned char var_1_19 = 50; [L35] signed char var_1_20 = 1; [L36] signed char var_1_21 = -10; [L37] float var_1_22 = 0.5; [L38] signed char var_1_23 = 100; [L39] signed short int var_1_24 = 2; [L40] unsigned short int var_1_31 = 8; [L41] unsigned char var_1_32 = 64; [L42] unsigned char var_1_33 = 1; [L43] unsigned char var_1_34 = 0; [L44] float var_1_35 = 32.4; [L45] float var_1_36 = 8.5; [L46] float var_1_37 = 7.5; [L47] float var_1_38 = 3.2; [L48] unsigned char var_1_39 = 16; [L49] unsigned char var_1_40 = 5; [L50] signed short int var_1_41 = -2; [L51] unsigned char var_1_42 = 10; [L52] unsigned char var_1_43 = 4; [L53] unsigned char var_1_44 = 64; [L54] signed long int var_1_45 = -25; [L55] unsigned char last_1_var_1_1 = 0; [L56] unsigned long int last_1_var_1_9 = 10; [L57] signed short int last_1_var_1_14 = 32; [L58] unsigned char last_1_var_1_16 = 1; [L59] signed char last_1_var_1_20 = 1; [L207] isInitial = 1 [L208] FCALL initially() [L209] COND TRUE 1 [L210] CALL updateLastVariables() [L196] last_1_var_1_1 = var_1_1 [L197] last_1_var_1_9 = var_1_9 [L198] last_1_var_1_14 = var_1_14 [L199] last_1_var_1_16 = var_1_16 [L200] last_1_var_1_20 = var_1_20 [L210] RET updateLastVariables() [L211] CALL updateVariables() [L146] var_1_8 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L147] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L148] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L148] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L149] var_1_11 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L150] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L151] var_1_12 = __VERIFIER_nondet_float() [L152] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L152] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L153] var_1_13 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L154] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L155] var_1_15 = __VERIFIER_nondet_ulong() [L156] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L156] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L157] CALL assume_abort_if_not(var_1_15 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L157] RET assume_abort_if_not(var_1_15 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L158] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L158] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L159] var_1_17 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L160] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L161] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L161] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L162] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L162] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L163] var_1_18 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L164] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L165] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L165] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L166] var_1_19 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L167] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L168] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L168] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L169] var_1_21 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L170] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L171] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L171] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L172] var_1_32 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L173] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L174] CALL assume_abort_if_not(var_1_32 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L174] RET assume_abort_if_not(var_1_32 <= 255) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L175] CALL assume_abort_if_not(var_1_32 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L175] RET assume_abort_if_not(var_1_32 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L176] var_1_34 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_34 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L177] RET assume_abort_if_not(var_1_34 >= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L178] CALL assume_abort_if_not(var_1_34 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L178] RET assume_abort_if_not(var_1_34 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L179] var_1_36 = __VERIFIER_nondet_float() [L180] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 4611686.018427382800e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L180] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 4611686.018427382800e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L181] var_1_37 = __VERIFIER_nondet_float() [L182] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L182] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L183] var_1_38 = __VERIFIER_nondet_float() [L184] CALL assume_abort_if_not((var_1_38 >= -461168.6018427382800e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 4611686.018427382800e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L184] RET assume_abort_if_not((var_1_38 >= -461168.6018427382800e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 4611686.018427382800e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L185] var_1_40 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L186] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L187] CALL assume_abort_if_not(var_1_40 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L187] RET assume_abort_if_not(var_1_40 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L188] var_1_43 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L189] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L190] CALL assume_abort_if_not(var_1_43 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L190] RET assume_abort_if_not(var_1_43 <= 127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L191] var_1_44 = __VERIFIER_nondet_uchar() [L192] CALL assume_abort_if_not(var_1_44 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L192] RET assume_abort_if_not(var_1_44 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L193] CALL assume_abort_if_not(var_1_44 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L193] RET assume_abort_if_not(var_1_44 <= 127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L211] RET updateVariables() [L212] CALL step() [L63] unsigned char stepLocal_1 = last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16); [L64] signed long int stepLocal_0 = last_1_var_1_20 * last_1_var_1_20; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L65] COND FALSE !(stepLocal_0 == last_1_var_1_14) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L70] unsigned long int stepLocal_6 = ((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=0, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L71] EXPR 256u << last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=0, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L71] COND TRUE stepLocal_6 <= (256u << last_1_var_1_16) [L72] var_1_16 = ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L74] unsigned char stepLocal_5 = var_1_16 != var_1_16; [L75] unsigned char stepLocal_4 = var_1_8; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_4=1, stepLocal_5=0, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L76] COND TRUE (! var_1_1) || stepLocal_4 [L77] var_1_10 = (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=-4294967286, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L85] COND FALSE !(\read(var_1_1)) [L92] var_1_24 = var_1_23 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=-4294967286, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=100, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L94] var_1_20 = var_1_21 [L95] var_1_22 = var_1_12 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=-4294967286, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=100, var_1_24=100, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L96] COND TRUE var_1_23 >= var_1_23 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=-4294967286, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=100, var_1_24=100, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L97] COND TRUE (4 % var_1_32) > var_1_20 [L98] var_1_31 = ((((((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))) + 256) < 0 ) ? -(((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))) + 256) : (((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))) + 256))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=-4294967286, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=100, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L103] COND TRUE \read(var_1_34) [L104] var_1_41 = ((((var_1_40) < 0 ) ? -(var_1_40) : (var_1_40))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=-4294967286, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=100, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L108] var_1_23 = var_1_21 [L109] var_1_33 = var_1_34 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=-4294967286, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L110] COND FALSE !(var_1_1 || var_1_1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=-4294967286, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L113] COND TRUE (var_1_14 / var_1_32) >= var_1_23 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=-4294967286, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L114] COND TRUE \read(var_1_34) [L115] var_1_45 = (((((var_1_14) < (var_1_43)) ? (var_1_14) : (var_1_43))) - var_1_44) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=-4294967286, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L122] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=-4294967286, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L125] EXPR (var_1_16 / var_1_15) & var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=-4294967286, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L125] COND TRUE ((var_1_16 / var_1_15) & var_1_16) >= var_1_20 [L126] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=-4294967286, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L131] COND TRUE var_1_23 >= var_1_16 [L132] var_1_35 = ((var_1_36 - var_1_37) + var_1_38) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=-4294967286, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L134] unsigned char stepLocal_3 = var_1_20 != var_1_14; [L135] signed long int stepLocal_2 = (((var_1_16) < (0)) ? (var_1_16) : (0)); VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=-4294967286, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L136] COND TRUE (var_1_1 || (var_1_16 <= var_1_14)) || stepLocal_3 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=-4294967286, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L137] COND FALSE !(stepLocal_2 <= (-5 + var_1_16)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=-4294967286, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L141] COND FALSE !(var_1_22 <= ((((var_1_38) < 0 ) ? -(var_1_38) : (var_1_38)))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=-4294967286, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L212] RET step() [L213] CALL, EXPR property() [L203] EXPR (((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128)))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=-4294967286, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L203] EXPR ((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=-4294967286, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L203-L204] return (((((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1)) && (var_1_20 == ((signed char) var_1_21))) && (var_1_22 == ((float) var_1_12))) && (var_1_23 == ((signed char) var_1_21)) ; [L213] RET, EXPR property() [L213] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=-4294967286, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=-4294967286, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 199 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 9, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2790 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2788 mSDsluCounter, 6291 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4218 mSDsCounter, 1510 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3958 IncrementalHoareTripleChecker+Invalid, 5468 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1510 mSolverCounterUnsat, 2073 mSDtfsCounter, 3958 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 734 GetRequests, 633 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=934occurred in iteration=8, InterpolantAutomatonStates: 88, 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, 1891 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2451 NumberOfCodeBlocks, 2451 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2233 ConstructedInterpolants, 0 QuantifiedInterpolants, 4240 SizeOfPredicates, 5 NumberOfNonLiveVariables, 965 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 20265/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 01:47:17,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-53.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 18a28dd9fabec49f402c0f8b2e2f11d6a9036437fc512405ace7df9d63b865bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:47:19,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:47:19,846 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 01:47:19,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:47:19,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:47:19,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:47:19,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:47:19,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:47:19,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:47:19,881 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:47:19,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:47:19,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:47:19,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:47:19,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:47:19,883 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:47:19,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:47:19,884 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:47:19,884 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:47:19,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:47:19,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:47:19,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:47:19,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:47:19,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:47:19,885 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 01:47:19,885 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 01:47:19,885 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 01:47:19,885 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:47:19,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:47:19,885 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:47:19,885 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:47:19,885 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:47:19,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:47:19,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:47:19,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:47:19,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:47:19,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:47:19,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:47:19,885 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:47:19,885 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:47:19,885 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 01:47:19,886 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 01:47:19,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:47:19,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:47:19,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:47:19,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:47:19,886 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 -> 18a28dd9fabec49f402c0f8b2e2f11d6a9036437fc512405ace7df9d63b865bf [2025-03-17 01:47:20,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:47:20,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:47:20,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:47:20,126 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:47:20,127 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:47:20,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i [2025-03-17 01:47:21,282 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc6f2d36c/e91a2b8ddec44d10a301f71da51b8e4b/FLAGe30299859 [2025-03-17 01:47:21,475 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:47:21,476 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i [2025-03-17 01:47:21,482 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc6f2d36c/e91a2b8ddec44d10a301f71da51b8e4b/FLAGe30299859 [2025-03-17 01:47:21,854 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc6f2d36c/e91a2b8ddec44d10a301f71da51b8e4b [2025-03-17 01:47:21,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:47:21,857 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:47:21,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:47:21,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:47:21,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:47:21,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:47:21" (1/1) ... [2025-03-17 01:47:21,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eef33c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:21, skipping insertion in model container [2025-03-17 01:47:21,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:47:21" (1/1) ... [2025-03-17 01:47:21,874 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:47:21,962 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i[919,932] [2025-03-17 01:47:22,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:47:22,031 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:47:22,039 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i[919,932] [2025-03-17 01:47:22,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:47:22,083 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:47:22,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:22 WrapperNode [2025-03-17 01:47:22,084 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:47:22,085 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:47:22,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:47:22,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:47:22,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:22" (1/1) ... [2025-03-17 01:47:22,104 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:22" (1/1) ... [2025-03-17 01:47:22,126 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2025-03-17 01:47:22,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:47:22,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:47:22,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:47:22,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:47:22,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:22" (1/1) ... [2025-03-17 01:47:22,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:22" (1/1) ... [2025-03-17 01:47:22,141 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:22" (1/1) ... [2025-03-17 01:47:22,152 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 01:47:22,152 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:22" (1/1) ... [2025-03-17 01:47:22,152 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:22" (1/1) ... [2025-03-17 01:47:22,162 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:22" (1/1) ... [2025-03-17 01:47:22,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:22" (1/1) ... [2025-03-17 01:47:22,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:22" (1/1) ... [2025-03-17 01:47:22,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:22" (1/1) ... [2025-03-17 01:47:22,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:47:22,181 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:47:22,181 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:47:22,181 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:47:22,182 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:22" (1/1) ... [2025-03-17 01:47:22,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:47:22,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:47:22,208 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 01:47:22,212 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 01:47:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:47:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 01:47:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:47:22,232 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:47:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:47:22,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:47:22,315 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:47:22,317 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:47:23,328 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-17 01:47:23,330 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:47:23,341 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:47:23,341 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:47:23,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:47:23 BoogieIcfgContainer [2025-03-17 01:47:23,341 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:47:23,343 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:47:23,343 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:47:23,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:47:23,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:47:21" (1/3) ... [2025-03-17 01:47:23,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123b8ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:47:23, skipping insertion in model container [2025-03-17 01:47:23,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:22" (2/3) ... [2025-03-17 01:47:23,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123b8ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:47:23, skipping insertion in model container [2025-03-17 01:47:23,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:47:23" (3/3) ... [2025-03-17 01:47:23,349 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i [2025-03-17 01:47:23,359 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:47:23,360 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:47:23,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:47:23,406 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;@6e40ae79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:47:23,406 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:47:23,409 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 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 01:47:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-17 01:47:23,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:23,421 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 01:47:23,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:23,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:23,425 INFO L85 PathProgramCache]: Analyzing trace with hash 921800874, now seen corresponding path program 1 times [2025-03-17 01:47:23,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:47:23,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824737588] [2025-03-17 01:47:23,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:23,433 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 01:47:23,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:47:23,435 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 01:47:23,436 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 01:47:23,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-17 01:47:23,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-17 01:47:23,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:23,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:23,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:47:23,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:47:23,864 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 01:47:23,864 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:47:23,865 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:47:23,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824737588] [2025-03-17 01:47:23,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824737588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:23,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:23,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 01:47:23,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94911727] [2025-03-17 01:47:23,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:23,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:47:23,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:47:23,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:47:23,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:47:23,883 INFO L87 Difference]: Start difference. First operand has 87 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 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), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 01:47:23,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:23,901 INFO L93 Difference]: Finished difference Result 171 states and 309 transitions. [2025-03-17 01:47:23,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:47:23,902 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 01:47:23,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:23,907 INFO L225 Difference]: With dead ends: 171 [2025-03-17 01:47:23,907 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 01:47:23,909 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 01:47:23,911 INFO L435 NwaCegarLoop]: 135 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, 135 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 01:47:23,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:47:23,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 01:47:23,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-17 01:47:23,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 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 01:47:23,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 135 transitions. [2025-03-17 01:47:23,939 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 135 transitions. Word has length 195 [2025-03-17 01:47:23,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:23,940 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 135 transitions. [2025-03-17 01:47:23,940 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 01:47:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 135 transitions. [2025-03-17 01:47:23,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-17 01:47:23,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:23,945 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 01:47:23,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 01:47:24,146 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 01:47:24,146 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:24,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:24,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1932593824, now seen corresponding path program 1 times [2025-03-17 01:47:24,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:47:24,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031150623] [2025-03-17 01:47:24,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:24,147 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 01:47:24,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:47:24,151 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 01:47:24,152 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 01:47:24,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-17 01:47:24,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-17 01:47:24,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:24,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:24,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 01:47:24,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:47:24,912 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 01:47:24,912 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:47:24,913 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:47:24,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031150623] [2025-03-17 01:47:24,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031150623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:24,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:24,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 01:47:24,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822741970] [2025-03-17 01:47:24,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:24,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:47:24,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:47:24,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:47:24,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:47:24,915 INFO L87 Difference]: Start difference. First operand 85 states and 135 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (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 01:47:25,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:25,183 INFO L93 Difference]: Finished difference Result 249 states and 395 transitions. [2025-03-17 01:47:25,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:47:25,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (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 01:47:25,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:25,188 INFO L225 Difference]: With dead ends: 249 [2025-03-17 01:47:25,190 INFO L226 Difference]: Without dead ends: 165 [2025-03-17 01:47:25,190 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 01:47:25,191 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 27 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:25,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 244 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:47:25,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-17 01:47:25,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2025-03-17 01:47:25,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 98 states have (on average 1.346938775510204) internal successors, (132), 98 states have internal predecessors, (132), 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 01:47:25,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 256 transitions. [2025-03-17 01:47:25,228 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 256 transitions. Word has length 196 [2025-03-17 01:47:25,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:25,229 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 256 transitions. [2025-03-17 01:47:25,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (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 01:47:25,229 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 256 transitions. [2025-03-17 01:47:25,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-17 01:47:25,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:25,231 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 01:47:25,244 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 01:47:25,431 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 01:47:25,432 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:25,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:25,432 INFO L85 PathProgramCache]: Analyzing trace with hash 636798919, now seen corresponding path program 1 times [2025-03-17 01:47:25,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:47:25,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823241247] [2025-03-17 01:47:25,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:25,433 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 01:47:25,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:47:25,435 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 01:47:25,436 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 01:47:25,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-17 01:47:25,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-17 01:47:25,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:25,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:25,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 01:47:25,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:47:26,130 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 01:47:26,131 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:47:26,131 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:47:26,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823241247] [2025-03-17 01:47:26,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823241247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:26,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:26,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:47:26,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022058043] [2025-03-17 01:47:26,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:26,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:47:26,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:47:26,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:47:26,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:47:26,133 INFO L87 Difference]: Start difference. First operand 163 states and 256 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 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 01:47:27,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:27,155 INFO L93 Difference]: Finished difference Result 586 states and 921 transitions. [2025-03-17 01:47:27,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:47:27,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 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 01:47:27,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:27,159 INFO L225 Difference]: With dead ends: 586 [2025-03-17 01:47:27,159 INFO L226 Difference]: Without dead ends: 424 [2025-03-17 01:47:27,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:47:27,161 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 161 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:27,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 415 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 01:47:27,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-03-17 01:47:27,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 326. [2025-03-17 01:47:27,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 197 states have (on average 1.350253807106599) internal successors, (266), 197 states have internal predecessors, (266), 124 states have call successors, (124), 4 states have call predecessors, (124), 4 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-17 01:47:27,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 514 transitions. [2025-03-17 01:47:27,214 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 514 transitions. Word has length 197 [2025-03-17 01:47:27,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:27,215 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 514 transitions. [2025-03-17 01:47:27,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 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 01:47:27,216 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 514 transitions. [2025-03-17 01:47:27,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-17 01:47:27,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:27,218 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 01:47:27,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 01:47:27,418 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 01:47:27,418 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:27,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:27,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1915358042, now seen corresponding path program 1 times [2025-03-17 01:47:27,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:47:27,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117964928] [2025-03-17 01:47:27,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:27,420 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 01:47:27,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:47:27,423 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 01:47:27,426 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 01:47:27,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-17 01:47:27,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-17 01:47:27,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:27,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:27,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 01:47:27,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:47:27,886 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 01:47:27,886 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:47:27,886 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:47:27,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117964928] [2025-03-17 01:47:27,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [117964928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:27,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:27,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 01:47:27,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279666657] [2025-03-17 01:47:27,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:27,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 01:47:27,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:47:27,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 01:47:27,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:47:27,889 INFO L87 Difference]: Start difference. First operand 326 states and 514 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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 01:47:29,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:29,735 INFO L93 Difference]: Finished difference Result 1075 states and 1657 transitions. [2025-03-17 01:47:29,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 01:47:29,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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 01:47:29,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:29,745 INFO L225 Difference]: With dead ends: 1075 [2025-03-17 01:47:29,745 INFO L226 Difference]: Without dead ends: 750 [2025-03-17 01:47:29,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-17 01:47:29,748 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 349 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:29,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1110 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 01:47:29,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2025-03-17 01:47:29,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 397. [2025-03-17 01:47:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 232 states have (on average 1.3017241379310345) internal successors, (302), 233 states have internal predecessors, (302), 155 states have call successors, (155), 9 states have call predecessors, (155), 9 states have return successors, (155), 154 states have call predecessors, (155), 155 states have call successors, (155) [2025-03-17 01:47:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 612 transitions. [2025-03-17 01:47:29,807 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 612 transitions. Word has length 197 [2025-03-17 01:47:29,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:29,808 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 612 transitions. [2025-03-17 01:47:29,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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 01:47:29,808 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 612 transitions. [2025-03-17 01:47:29,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-17 01:47:29,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:29,810 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 01:47:29,823 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 01:47:30,010 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 01:47:30,011 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:30,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:30,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1027854361, now seen corresponding path program 1 times [2025-03-17 01:47:30,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:47:30,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325344632] [2025-03-17 01:47:30,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:30,012 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 01:47:30,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:47:30,015 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 01:47:30,016 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 01:47:30,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-17 01:47:30,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-17 01:47:30,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:30,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:30,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 01:47:30,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:47:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 960 proven. 45 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2025-03-17 01:47:30,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:47:30,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-17 01:47:30,844 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:47:30,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325344632] [2025-03-17 01:47:30,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325344632] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:47:30,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:47:30,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2025-03-17 01:47:30,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907569901] [2025-03-17 01:47:30,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 01:47:30,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 01:47:30,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:47:30,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 01:47:30,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 01:47:30,846 INFO L87 Difference]: Start difference. First operand 397 states and 612 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-17 01:47:32,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:32,605 INFO L93 Difference]: Finished difference Result 1026 states and 1541 transitions. [2025-03-17 01:47:32,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 01:47:32,609 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 197 [2025-03-17 01:47:32,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:32,614 INFO L225 Difference]: With dead ends: 1026 [2025-03-17 01:47:32,614 INFO L226 Difference]: Without dead ends: 682 [2025-03-17 01:47:32,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 384 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=724, Unknown=0, NotChecked=0, Total=992 [2025-03-17 01:47:32,616 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 296 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:32,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 704 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 01:47:32,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-03-17 01:47:32,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 414. [2025-03-17 01:47:32,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 244 states have (on average 1.278688524590164) internal successors, (312), 245 states have internal predecessors, (312), 155 states have call successors, (155), 14 states have call predecessors, (155), 14 states have return successors, (155), 154 states have call predecessors, (155), 155 states have call successors, (155) [2025-03-17 01:47:32,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 622 transitions. [2025-03-17 01:47:32,669 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 622 transitions. Word has length 197 [2025-03-17 01:47:32,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:32,669 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 622 transitions. [2025-03-17 01:47:32,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-17 01:47:32,669 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 622 transitions. [2025-03-17 01:47:32,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-17 01:47:32,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:32,671 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 01:47:32,683 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 01:47:32,871 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 01:47:32,872 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:32,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:32,872 INFO L85 PathProgramCache]: Analyzing trace with hash 425448006, now seen corresponding path program 1 times [2025-03-17 01:47:32,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:47:32,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206507195] [2025-03-17 01:47:32,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:32,873 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 01:47:32,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:47:32,875 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 01:47:32,876 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 01:47:32,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-17 01:47:33,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-17 01:47:33,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:33,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:33,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 01:47:33,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:47:33,194 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 01:47:33,194 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:47:33,194 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:47:33,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206507195] [2025-03-17 01:47:33,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206507195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:33,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:33,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:47:33,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966257980] [2025-03-17 01:47:33,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:33,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:47:33,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:47:33,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:47:33,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:47:33,196 INFO L87 Difference]: Start difference. First operand 414 states and 622 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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 01:47:34,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:34,066 INFO L93 Difference]: Finished difference Result 804 states and 1208 transitions. [2025-03-17 01:47:34,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:47:34,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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 01:47:34,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:34,071 INFO L225 Difference]: With dead ends: 804 [2025-03-17 01:47:34,071 INFO L226 Difference]: Without dead ends: 623 [2025-03-17 01:47:34,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 195 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 01:47:34,072 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 127 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:34,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 357 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 01:47:34,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-03-17 01:47:34,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 235. [2025-03-17 01:47:34,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 133 states have (on average 1.2481203007518797) internal successors, (166), 134 states have internal predecessors, (166), 93 states have call successors, (93), 8 states have call predecessors, (93), 8 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-17 01:47:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 352 transitions. [2025-03-17 01:47:34,105 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 352 transitions. Word has length 197 [2025-03-17 01:47:34,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:34,105 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 352 transitions. [2025-03-17 01:47:34,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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 01:47:34,105 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 352 transitions. [2025-03-17 01:47:34,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-17 01:47:34,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:34,107 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 01:47:34,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-17 01:47:34,307 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 01:47:34,308 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:34,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:34,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1760820353, now seen corresponding path program 1 times [2025-03-17 01:47:34,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:47:34,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765282828] [2025-03-17 01:47:34,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:34,309 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 01:47:34,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:47:34,311 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 01:47:34,313 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 01:47:34,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-17 01:47:34,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-17 01:47:34,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:34,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:34,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 01:47:34,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:47:34,848 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 01:47:34,848 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:47:34,848 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:47:34,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765282828] [2025-03-17 01:47:34,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765282828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:47:34,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:47:34,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:47:34,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132699146] [2025-03-17 01:47:34,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:47:34,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:47:34,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:47:34,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:47:34,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:47:34,849 INFO L87 Difference]: Start difference. First operand 235 states and 352 transitions. Second operand has 4 states, 4 states have (on average 11.5) 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 01:47:36,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:47:36,090 INFO L93 Difference]: Finished difference Result 593 states and 887 transitions. [2025-03-17 01:47:36,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:47:36,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) 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 01:47:36,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:47:36,095 INFO L225 Difference]: With dead ends: 593 [2025-03-17 01:47:36,095 INFO L226 Difference]: Without dead ends: 415 [2025-03-17 01:47:36,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:47:36,096 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 32 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:47:36,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 302 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 01:47:36,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-17 01:47:36,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 411. [2025-03-17 01:47:36,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 241 states have (on average 1.2655601659751037) internal successors, (305), 242 states have internal predecessors, (305), 155 states have call successors, (155), 14 states have call predecessors, (155), 14 states have return successors, (155), 154 states have call predecessors, (155), 155 states have call successors, (155) [2025-03-17 01:47:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 615 transitions. [2025-03-17 01:47:36,133 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 615 transitions. Word has length 198 [2025-03-17 01:47:36,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:47:36,134 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 615 transitions. [2025-03-17 01:47:36,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) 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 01:47:36,134 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 615 transitions. [2025-03-17 01:47:36,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-17 01:47:36,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:47:36,135 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 01:47:36,151 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 (8)] Ended with exit code 0 [2025-03-17 01:47:36,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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 01:47:36,336 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:47:36,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:47:36,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1759896832, now seen corresponding path program 1 times [2025-03-17 01:47:36,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:47:36,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078797506] [2025-03-17 01:47:36,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:47:36,337 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 01:47:36,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:47:36,340 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:47:36,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-17 01:47:36,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-17 01:47:36,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-17 01:47:36,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:47:36,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:47:36,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 01:47:36,678 INFO L279 TraceCheckSpWp]: Computing forward predicates...