./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-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 8077ea0a7b69b238ec123c66b3e265976e596d9fa67f90c1cfc30532a2641db9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:04:58,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:04:58,816 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 12:04:58,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:04:58,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:04:58,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:04:58,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:04:58,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:04:58,870 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:04:58,877 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:04:58,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:04:58,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:04:58,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:04:58,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:04:58,878 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:04:58,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:04:58,878 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:04:58,878 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:04:58,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 12:04:58,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:04:58,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:04:58,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:04:58,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:04:58,879 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:04:58,879 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:04:58,879 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:04:58,879 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:04:58,879 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:04:58,879 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:04:58,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:04:58,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:04:58,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:04:58,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:04:58,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:04:58,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:04:58,880 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:04:58,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:04:58,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 12:04:58,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 12:04:58,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:04:58,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:04:58,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:04:58,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:04:58,880 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 -> 8077ea0a7b69b238ec123c66b3e265976e596d9fa67f90c1cfc30532a2641db9 [2025-03-08 12:04:59,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:04:59,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:04:59,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:04:59,229 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:04:59,230 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:04:59,231 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-pe-co_file-53.i [2025-03-08 12:05:01,669 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f65fafe8/5fd75a9f1b784446b3da333cb9681ecf/FLAG9ed74b7d9 [2025-03-08 12:05:02,075 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:05:02,075 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-53.i [2025-03-08 12:05:02,095 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f65fafe8/5fd75a9f1b784446b3da333cb9681ecf/FLAG9ed74b7d9 [2025-03-08 12:05:02,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f65fafe8/5fd75a9f1b784446b3da333cb9681ecf [2025-03-08 12:05:02,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:05:02,121 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:05:02,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:05:02,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:05:02,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:05:02,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:05:02" (1/1) ... [2025-03-08 12:05:02,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@443a955f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:02, skipping insertion in model container [2025-03-08 12:05:02,133 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:05:02" (1/1) ... [2025-03-08 12:05:02,154 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:05:02,343 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-53.i[919,932] [2025-03-08 12:05:02,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:05:02,480 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:05:02,501 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-pe-co_file-53.i[919,932] [2025-03-08 12:05:02,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:05:02,569 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:05:02,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:02 WrapperNode [2025-03-08 12:05:02,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:05:02,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:05:02,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:05:02,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:05:02,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:02" (1/1) ... [2025-03-08 12:05:02,595 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:02" (1/1) ... [2025-03-08 12:05:02,646 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 256 [2025-03-08 12:05:02,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:05:02,650 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:05:02,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:05:02,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:05:02,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:02" (1/1) ... [2025-03-08 12:05:02,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:02" (1/1) ... [2025-03-08 12:05:02,666 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:02" (1/1) ... [2025-03-08 12:05:02,697 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 12:05:02,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:02" (1/1) ... [2025-03-08 12:05:02,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:02" (1/1) ... [2025-03-08 12:05:02,717 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:02" (1/1) ... [2025-03-08 12:05:02,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:02" (1/1) ... [2025-03-08 12:05:02,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:02" (1/1) ... [2025-03-08 12:05:02,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:02" (1/1) ... [2025-03-08 12:05:02,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:05:02,737 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:05:02,737 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:05:02,737 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:05:02,738 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:02" (1/1) ... [2025-03-08 12:05:02,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:05:02,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:05:02,794 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 12:05:02,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 12:05:02,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:05:02,844 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:05:02,844 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:05:02,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 12:05:02,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:05:02,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:05:02,963 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:05:02,969 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:05:03,591 INFO L1307 $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-08 12:05:03,662 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-08 12:05:03,663 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:05:03,698 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:05:03,700 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-08 12:05:03,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:05:03 BoogieIcfgContainer [2025-03-08 12:05:03,701 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:05:03,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:05:03,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:05:03,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:05:03,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:05:02" (1/3) ... [2025-03-08 12:05:03,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f1bfc4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:05:03, skipping insertion in model container [2025-03-08 12:05:03,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:02" (2/3) ... [2025-03-08 12:05:03,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f1bfc4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:05:03, skipping insertion in model container [2025-03-08 12:05:03,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:05:03" (3/3) ... [2025-03-08 12:05:03,717 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-53.i [2025-03-08 12:05:03,744 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:05:03,747 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-53.i that has 2 procedures, 110 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:05:03,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:05:03,872 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;@1ef07974, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:05:03,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:05:03,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 77 states have internal predecessors, (110), 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-08 12:05:03,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 12:05:03,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:05:03,904 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-08 12:05:03,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:05:03,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:05:03,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1644875018, now seen corresponding path program 1 times [2025-03-08 12:05:03,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:05:03,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755924068] [2025-03-08 12:05:03,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:05:03,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:05:04,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 12:05:04,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 12:05:04,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:05:04,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:05:04,454 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-08 12:05:04,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:05:04,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755924068] [2025-03-08 12:05:04,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755924068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:05:04,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080809293] [2025-03-08 12:05:04,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:05:04,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:05:04,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:05:04,463 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:05:04,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 12:05:04,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 12:05:04,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 12:05:04,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:05:04,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:05:04,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:05:04,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:05:04,841 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-08 12:05:04,841 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:05:04,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080809293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:05:04,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:05:04,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 12:05:04,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955388872] [2025-03-08 12:05:04,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:05:04,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:05:04,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:05:04,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:05:04,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:05:04,905 INFO L87 Difference]: Start difference. First operand has 110 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 77 states have internal predecessors, (110), 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 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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-08 12:05:04,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:05:04,973 INFO L93 Difference]: Finished difference Result 214 states and 370 transitions. [2025-03-08 12:05:04,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:05:04,980 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (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 204 [2025-03-08 12:05:04,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:05:04,989 INFO L225 Difference]: With dead ends: 214 [2025-03-08 12:05:04,995 INFO L226 Difference]: Without dead ends: 107 [2025-03-08 12:05:04,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:05:05,005 INFO L435 NwaCegarLoop]: 163 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, 163 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-08 12:05:05,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:05:05,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-08 12:05:05,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-08 12:05:05,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 74 states have (on average 1.4189189189189189) internal successors, (105), 74 states have internal predecessors, (105), 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-08 12:05:05,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 167 transitions. [2025-03-08 12:05:05,092 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 167 transitions. Word has length 204 [2025-03-08 12:05:05,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:05:05,098 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 167 transitions. [2025-03-08 12:05:05,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (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-08 12:05:05,098 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 167 transitions. [2025-03-08 12:05:05,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 12:05:05,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:05:05,106 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-08 12:05:05,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 12:05:05,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 12:05:05,309 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:05:05,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:05:05,311 INFO L85 PathProgramCache]: Analyzing trace with hash -802431901, now seen corresponding path program 1 times [2025-03-08 12:05:05,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:05:05,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578924084] [2025-03-08 12:05:05,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:05:05,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:05:05,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 12:05:05,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 12:05:05,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:05:05,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:05:05,784 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-08 12:05:05,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:05:05,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578924084] [2025-03-08 12:05:05,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578924084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:05:05,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:05:05,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:05:05,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696904392] [2025-03-08 12:05:05,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:05:05,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:05:05,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:05:05,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:05:05,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:05:05,803 INFO L87 Difference]: Start difference. First operand 107 states and 167 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-08 12:05:05,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:05:05,989 INFO L93 Difference]: Finished difference Result 304 states and 476 transitions. [2025-03-08 12:05:05,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:05:05,989 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-08 12:05:05,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:05:05,992 INFO L225 Difference]: With dead ends: 304 [2025-03-08 12:05:05,992 INFO L226 Difference]: Without dead ends: 200 [2025-03-08 12:05:05,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:05:05,999 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 140 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:05:05,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 399 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:05:06,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-08 12:05:06,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2025-03-08 12:05:06,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.3609022556390977) internal successors, (181), 133 states have internal predecessors, (181), 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-08 12:05:06,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 305 transitions. [2025-03-08 12:05:06,074 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 305 transitions. Word has length 204 [2025-03-08 12:05:06,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:05:06,082 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 305 transitions. [2025-03-08 12:05:06,082 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-08 12:05:06,082 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 305 transitions. [2025-03-08 12:05:06,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 12:05:06,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:05:06,085 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-08 12:05:06,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 12:05:06,086 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:05:06,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:05:06,086 INFO L85 PathProgramCache]: Analyzing trace with hash -283482084, now seen corresponding path program 1 times [2025-03-08 12:05:06,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:05:06,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960414721] [2025-03-08 12:05:06,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:05:06,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:05:06,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 12:05:06,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 12:05:06,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:05:06,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:05:06,586 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-08 12:05:06,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:05:06,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960414721] [2025-03-08 12:05:06,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960414721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:05:06,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:05:06,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:05:06,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188832225] [2025-03-08 12:05:06,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:05:06,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:05:06,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:05:06,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:05:06,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:05:06,591 INFO L87 Difference]: Start difference. First operand 198 states and 305 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-08 12:05:06,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:05:06,810 INFO L93 Difference]: Finished difference Result 584 states and 904 transitions. [2025-03-08 12:05:06,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:05:06,811 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-08 12:05:06,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:05:06,820 INFO L225 Difference]: With dead ends: 584 [2025-03-08 12:05:06,824 INFO L226 Difference]: Without dead ends: 389 [2025-03-08 12:05:06,825 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-08 12:05:06,825 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 157 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:05:06,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 428 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:05:06,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-08 12:05:06,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 200. [2025-03-08 12:05:06,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 135 states have (on average 1.3555555555555556) internal successors, (183), 135 states have internal predecessors, (183), 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-08 12:05:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 307 transitions. [2025-03-08 12:05:06,904 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 307 transitions. Word has length 206 [2025-03-08 12:05:06,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:05:06,907 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 307 transitions. [2025-03-08 12:05:06,909 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-08 12:05:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 307 transitions. [2025-03-08 12:05:06,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 12:05:06,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:05:06,918 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-08 12:05:06,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 12:05:06,918 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:05:06,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:05:06,919 INFO L85 PathProgramCache]: Analyzing trace with hash -692306309, now seen corresponding path program 1 times [2025-03-08 12:05:06,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:05:06,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415724251] [2025-03-08 12:05:06,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:05:06,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:05:06,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 12:05:07,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 12:05:07,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:05:07,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:05:07,161 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-08 12:05:07,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:05:07,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415724251] [2025-03-08 12:05:07,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415724251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:05:07,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:05:07,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:05:07,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626602220] [2025-03-08 12:05:07,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:05:07,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:05:07,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:05:07,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:05:07,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:05:07,167 INFO L87 Difference]: Start difference. First operand 200 states and 307 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-08 12:05:07,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:05:07,294 INFO L93 Difference]: Finished difference Result 407 states and 624 transitions. [2025-03-08 12:05:07,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:05:07,297 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-08 12:05:07,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:05:07,299 INFO L225 Difference]: With dead ends: 407 [2025-03-08 12:05:07,299 INFO L226 Difference]: Without dead ends: 210 [2025-03-08 12:05:07,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:05:07,300 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 145 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:05:07,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 290 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:05:07,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-08 12:05:07,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2025-03-08 12:05:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 143 states have (on average 1.3286713286713288) internal successors, (190), 143 states have internal predecessors, (190), 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-08 12:05:07,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 314 transitions. [2025-03-08 12:05:07,357 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 314 transitions. Word has length 206 [2025-03-08 12:05:07,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:05:07,361 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 314 transitions. [2025-03-08 12:05:07,361 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-08 12:05:07,361 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 314 transitions. [2025-03-08 12:05:07,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 12:05:07,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:05:07,363 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-08 12:05:07,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 12:05:07,365 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:05:07,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:05:07,367 INFO L85 PathProgramCache]: Analyzing trace with hash -985709316, now seen corresponding path program 1 times [2025-03-08 12:05:07,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:05:07,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71705900] [2025-03-08 12:05:07,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:05:07,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:05:07,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 12:05:07,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 12:05:07,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:05:07,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:05:07,535 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-08 12:05:07,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:05:07,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71705900] [2025-03-08 12:05:07,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71705900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:05:07,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:05:07,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:05:07,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044508110] [2025-03-08 12:05:07,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:05:07,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:05:07,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:05:07,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:05:07,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:05:07,538 INFO L87 Difference]: Start difference. First operand 208 states and 314 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-08 12:05:07,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:05:07,593 INFO L93 Difference]: Finished difference Result 413 states and 625 transitions. [2025-03-08 12:05:07,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:05:07,594 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-08 12:05:07,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:05:07,597 INFO L225 Difference]: With dead ends: 413 [2025-03-08 12:05:07,597 INFO L226 Difference]: Without dead ends: 208 [2025-03-08 12:05:07,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:05:07,599 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 157 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:05:07,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 143 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:05:07,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-08 12:05:07,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-03-08 12:05:07,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 143 states have (on average 1.3146853146853146) internal successors, (188), 143 states have internal predecessors, (188), 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-08 12:05:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 312 transitions. [2025-03-08 12:05:07,640 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 312 transitions. Word has length 206 [2025-03-08 12:05:07,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:05:07,640 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 312 transitions. [2025-03-08 12:05:07,640 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-08 12:05:07,640 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 312 transitions. [2025-03-08 12:05:07,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-08 12:05:07,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:05:07,664 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, 1] [2025-03-08 12:05:07,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 12:05:07,665 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:05:07,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:05:07,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1477100952, now seen corresponding path program 1 times [2025-03-08 12:05:07,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:05:07,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432901365] [2025-03-08 12:05:07,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:05:07,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:05:07,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 12:05:07,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 12:05:07,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:05:07,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:05:08,119 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-08 12:05:08,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:05:08,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432901365] [2025-03-08 12:05:08,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432901365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:05:08,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:05:08,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:05:08,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774226305] [2025-03-08 12:05:08,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:05:08,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:05:08,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:05:08,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:05:08,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:05:08,125 INFO L87 Difference]: Start difference. First operand 208 states and 312 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-08 12:05:08,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:05:08,491 INFO L93 Difference]: Finished difference Result 701 states and 1047 transitions. [2025-03-08 12:05:08,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:05:08,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 207 [2025-03-08 12:05:08,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:05:08,495 INFO L225 Difference]: With dead ends: 701 [2025-03-08 12:05:08,496 INFO L226 Difference]: Without dead ends: 496 [2025-03-08 12:05:08,496 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-08 12:05:08,499 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 176 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 487 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:05:08,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 487 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 12:05:08,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-08 12:05:08,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 478. [2025-03-08 12:05:08,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 349 states have (on average 1.332378223495702) internal successors, (465), 349 states have internal predecessors, (465), 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-08 12:05:08,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 713 transitions. [2025-03-08 12:05:08,576 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 713 transitions. Word has length 207 [2025-03-08 12:05:08,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:05:08,582 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 713 transitions. [2025-03-08 12:05:08,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-08 12:05:08,583 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 713 transitions. [2025-03-08 12:05:08,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-08 12:05:08,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:05:08,585 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, 1, 1] [2025-03-08 12:05:08,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 12:05:08,585 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:05:08,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:05:08,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1780999329, now seen corresponding path program 1 times [2025-03-08 12:05:08,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:05:08,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697199121] [2025-03-08 12:05:08,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:05:08,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:05:08,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 12:05:08,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 12:05:08,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:05:08,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:05:09,433 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-08 12:05:09,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:05:09,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697199121] [2025-03-08 12:05:09,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697199121] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:05:09,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560199071] [2025-03-08 12:05:09,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:05:09,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:05:09,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:05:09,436 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:05:09,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 12:05:09,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 12:05:09,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 12:05:09,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:05:09,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:05:09,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 12:05:09,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:05:10,770 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-08 12:05:10,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:05:11,537 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-08 12:05:11,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560199071] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:05:11,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:05:11,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 21 [2025-03-08 12:05:11,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418830970] [2025-03-08 12:05:11,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:05:11,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 12:05:11,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:05:11,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 12:05:11,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-03-08 12:05:11,545 INFO L87 Difference]: Start difference. First operand 478 states and 713 transitions. Second operand has 21 states, 21 states have (on average 5.571428571428571) internal successors, (117), 21 states have internal predecessors, (117), 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-08 12:05:15,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:05:15,538 INFO L93 Difference]: Finished difference Result 1360 states and 1986 transitions. [2025-03-08 12:05:15,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-08 12:05:15,540 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.571428571428571) internal successors, (117), 21 states have internal predecessors, (117), 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 208 [2025-03-08 12:05:15,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:05:15,551 INFO L225 Difference]: With dead ends: 1360 [2025-03-08 12:05:15,551 INFO L226 Difference]: Without dead ends: 885 [2025-03-08 12:05:15,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 405 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=741, Invalid=2681, Unknown=0, NotChecked=0, Total=3422 [2025-03-08 12:05:15,559 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 1211 mSDsluCounter, 2044 mSDsCounter, 0 mSdLazyCounter, 2019 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 2397 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 2019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 12:05:15,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 2397 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 2019 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 12:05:15,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-03-08 12:05:15,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 488. [2025-03-08 12:05:15,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 355 states have (on average 1.3183098591549296) internal successors, (468), 355 states have internal predecessors, (468), 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-08 12:05:15,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 716 transitions. [2025-03-08 12:05:15,708 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 716 transitions. Word has length 208 [2025-03-08 12:05:15,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:05:15,708 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 716 transitions. [2025-03-08 12:05:15,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.571428571428571) internal successors, (117), 21 states have internal predecessors, (117), 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-08 12:05:15,709 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 716 transitions. [2025-03-08 12:05:15,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-08 12:05:15,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:05:15,715 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, 1, 1, 1] [2025-03-08 12:05:15,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 12:05:15,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-08 12:05:15,916 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:05:15,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:05:15,917 INFO L85 PathProgramCache]: Analyzing trace with hash 181154772, now seen corresponding path program 1 times [2025-03-08 12:05:15,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:05:15,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76319320] [2025-03-08 12:05:15,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:05:15,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:05:15,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 12:05:16,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 12:05:16,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:05:16,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 12:05:16,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1021412864] [2025-03-08 12:05:16,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:05:16,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:05:16,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:05:16,128 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:05:16,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 12:05:16,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 12:05:16,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 12:05:16,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:05:16,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:05:16,353 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 12:05:16,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 12:05:17,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 12:05:17,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:05:17,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:05:17,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 12:05:17,346 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 12:05:17,347 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 12:05:17,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 12:05:17,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:05:17,559 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:05:17,777 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 12:05:17,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:05:17 BoogieIcfgContainer [2025-03-08 12:05:17,784 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 12:05:17,785 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 12:05:17,785 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 12:05:17,785 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 12:05:17,786 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:05:03" (3/4) ... [2025-03-08 12:05:17,787 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 12:05:17,789 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 12:05:17,790 INFO L158 Benchmark]: Toolchain (without parser) took 15668.38ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 113.4MB in the beginning and 164.1MB in the end (delta: -50.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2025-03-08 12:05:17,790 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:05:17,790 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.05ms. 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-08 12:05:17,791 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.00ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 92.7MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:05:17,791 INFO L158 Benchmark]: Boogie Preprocessor took 80.17ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 87.9MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 12:05:17,791 INFO L158 Benchmark]: IcfgBuilder took 964.33ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 56.2MB in the end (delta: 31.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 12:05:17,792 INFO L158 Benchmark]: TraceAbstraction took 14076.08ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 55.6MB in the beginning and 164.1MB in the end (delta: -108.5MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2025-03-08 12:05:17,792 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 218.1MB. Free memory was 164.1MB in the beginning and 164.1MB in the end (delta: 27.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 12:05:17,793 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 449.05ms. 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 78.00ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 92.7MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 80.17ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 87.9MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 964.33ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 56.2MB in the end (delta: 31.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14076.08ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 55.6MB in the beginning and 164.1MB in the end (delta: -108.5MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 218.1MB. Free memory was 164.1MB in the beginning and 164.1MB in the end (delta: 27.4kB). Peak memory consumption was 8.4MB. 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 150, overapproximation of someBinaryFLOATComparisonOperation at line 154, overapproximation of someBinaryFLOATComparisonOperation at line 203, overapproximation of someBinaryFLOATComparisonOperation at line 180, overapproximation of someBinaryFLOATComparisonOperation at line 152, overapproximation of someBinaryFLOATComparisonOperation at line 203, overapproximation of someBinaryFLOATComparisonOperation at line 132, overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of someBinaryFLOATComparisonOperation at line 184, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryArithmeticFLOAToperation at line 122, overapproximation of someBinaryArithmeticFLOAToperation at line 77, 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; VAL [isInitial=0, 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=0, var_1_9=10] [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 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=0, var_1_9=10] [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=6, 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=6, 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=6, 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=6, 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=6, 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=6, 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=6, 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=6, 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=6, 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=6, var_1_16=1, var_1_17=257, 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=6, var_1_16=1, var_1_17=257, 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=6, var_1_16=1, var_1_17=257, 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=6, var_1_16=1, var_1_17=257, 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=6, var_1_16=1, var_1_17=257, 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=6, var_1_16=1, var_1_17=257, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=2, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=2, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=2, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=2, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=2, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=2, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=2, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=2, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=2, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=2, 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=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=2, 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=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=2, 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=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=2, 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=6, var_1_16=5, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=2, 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=6, var_1_16=5, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=2, 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=6, var_1_16=5, var_1_17=257, var_1_18=4, var_1_19=-251, 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=6, 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=2, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L85] var_1_20 = var_1_21 [L86] var_1_22 = var_1_12 [L87] var_1_23 = var_1_21 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=6, var_1_16=5, var_1_17=257, var_1_18=4, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=2, var_1_31=8, var_1_32=6, 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=2, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L88] 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=6, var_1_16=5, var_1_17=257, var_1_18=4, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=2, var_1_31=8, var_1_32=6, 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=2, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L91] 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=6, var_1_16=5, var_1_17=257, var_1_18=4, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=2, var_1_31=8, var_1_32=6, 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=2, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L91] COND TRUE ((var_1_16 / var_1_15) & var_1_16) >= var_1_20 [L92] 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=5, var_1_15=6, var_1_16=5, var_1_17=257, var_1_18=4, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=2, var_1_31=8, var_1_32=6, 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=2, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L97] unsigned char stepLocal_3 = var_1_20 != var_1_14; [L98] 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=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=5, var_1_15=6, var_1_16=5, var_1_17=257, var_1_18=4, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=2, var_1_31=8, var_1_32=6, 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=2, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L99] 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=5, var_1_15=6, var_1_16=5, var_1_17=257, var_1_18=4, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=2, var_1_31=8, var_1_32=6, 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=2, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L100] COND TRUE stepLocal_2 <= (-5 + var_1_16) [L101] var_1_9 = 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=5, var_1_15=6, var_1_16=5, var_1_17=257, var_1_18=4, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=2, var_1_31=8, var_1_32=6, 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=2, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=5] [L104] COND FALSE !(\read(var_1_1)) [L111] var_1_24 = 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_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=5, var_1_15=6, var_1_16=5, var_1_17=257, var_1_18=4, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=8, var_1_32=6, 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=2, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=5] [L113] COND TRUE var_1_23 >= 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_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=5, var_1_15=6, var_1_16=5, var_1_17=257, var_1_18=4, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=8, var_1_32=6, 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=2, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=5] [L114] COND TRUE (4 % var_1_32) > var_1_23 [L115] 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=5, var_1_15=6, var_1_16=5, var_1_17=257, var_1_18=4, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=262, var_1_32=6, 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=2, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=5] [L120] 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=5, var_1_15=6, var_1_16=5, var_1_17=257, var_1_18=4, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=262, var_1_32=6, 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=2, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=5] [L121] COND TRUE var_1_16 >= var_1_23 [L122] 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=5, var_1_15=6, var_1_16=5, var_1_17=257, var_1_18=4, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=262, var_1_32=6, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=2, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=5] [L124] 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=5, var_1_15=6, var_1_16=5, var_1_17=257, var_1_18=4, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=262, var_1_32=6, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=2, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=5] [L127] COND TRUE \read(var_1_34) [L128] 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=5, var_1_15=6, var_1_16=5, var_1_17=257, var_1_18=4, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=262, var_1_32=6, 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=2, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=5] [L132] COND TRUE var_1_10 <= ((((var_1_38) < 0 ) ? -(var_1_38) : (var_1_38))) [L133] var_1_42 = (((((((var_1_43 + var_1_44) < 0 ) ? -(var_1_43 + var_1_44) : (var_1_43 + var_1_44))) < 0 ) ? -((((var_1_43 + var_1_44) < 0 ) ? -(var_1_43 + var_1_44) : (var_1_43 + var_1_44))) : ((((var_1_43 + var_1_44) < 0 ) ? -(var_1_43 + var_1_44) : (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=5, var_1_15=6, var_1_16=5, var_1_17=257, var_1_18=4, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=262, var_1_32=6, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=2, var_1_43=2, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=5] [L135] 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=5, var_1_15=6, var_1_16=5, var_1_17=257, var_1_18=4, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=262, var_1_32=6, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=2, var_1_43=2, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=5] [L136] COND TRUE \read(var_1_34) [L137] 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=5, var_1_15=6, var_1_16=5, var_1_17=257, var_1_18=4, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=262, var_1_32=6, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=2, var_1_43=2, var_1_44=0, var_1_45=2, var_1_8=1, var_1_9=5] [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=5, var_1_15=6, var_1_16=5, var_1_17=257, var_1_18=4, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=262, var_1_32=6, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=2, var_1_43=2, var_1_44=0, var_1_45=2, var_1_8=1, var_1_9=5] [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=5, var_1_15=6, var_1_16=5, var_1_17=257, var_1_18=4, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=262, var_1_32=6, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=2, var_1_43=2, var_1_44=0, var_1_45=2, var_1_8=1, var_1_9=5] [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=5, var_1_15=6, var_1_16=5, var_1_17=257, var_1_18=4, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=262, var_1_32=6, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=2, var_1_43=2, var_1_44=0, var_1_45=2, var_1_8=1, var_1_9=5] [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=5, var_1_15=6, var_1_16=5, var_1_17=257, var_1_18=4, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=262, var_1_32=6, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=2, var_1_43=2, var_1_44=0, var_1_45=2, var_1_8=1, var_1_9=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 203 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.7s, OverallIterations: 8, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2018 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1986 mSDsluCounter, 4307 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2737 mSDsCounter, 821 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2239 IncrementalHoareTripleChecker+Invalid, 3060 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 821 mSolverCounterUnsat, 1570 mSDtfsCounter, 2239 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 688 GetRequests, 622 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=488occurred in iteration=7, InterpolantAutomatonStates: 61, 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, 7 MinimizatonAttempts, 608 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2271 NumberOfCodeBlocks, 2271 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2051 ConstructedInterpolants, 0 QuantifiedInterpolants, 3709 SizeOfPredicates, 5 NumberOfNonLiveVariables, 977 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 18405/18600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 12:05:17,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-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 8077ea0a7b69b238ec123c66b3e265976e596d9fa67f90c1cfc30532a2641db9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:05:21,252 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:05:21,411 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 12:05:21,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:05:21,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:05:21,457 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:05:21,458 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:05:21,458 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:05:21,458 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:05:21,459 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:05:21,459 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:05:21,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:05:21,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:05:21,460 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:05:21,460 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:05:21,460 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:05:21,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:05:21,460 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:05:21,460 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:05:21,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:05:21,460 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:05:21,461 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:05:21,461 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:05:21,461 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 12:05:21,461 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 12:05:21,461 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 12:05:21,461 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:05:21,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:05:21,461 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:05:21,462 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:05:21,462 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:05:21,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:05:21,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:05:21,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:05:21,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:05:21,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:05:21,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:05:21,463 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:05:21,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:05:21,463 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 12:05:21,463 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 12:05:21,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:05:21,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:05:21,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:05:21,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:05:21,463 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 -> 8077ea0a7b69b238ec123c66b3e265976e596d9fa67f90c1cfc30532a2641db9 [2025-03-08 12:05:21,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:05:21,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:05:21,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:05:21,993 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:05:21,994 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:05:21,995 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-pe-co_file-53.i [2025-03-08 12:05:23,795 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/486a31646/e6c10f749cd5406d9a54d473db0f465f/FLAGc2cbe0d60 [2025-03-08 12:05:24,167 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:05:24,171 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-53.i [2025-03-08 12:05:24,181 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/486a31646/e6c10f749cd5406d9a54d473db0f465f/FLAGc2cbe0d60 [2025-03-08 12:05:24,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/486a31646/e6c10f749cd5406d9a54d473db0f465f [2025-03-08 12:05:24,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:05:24,203 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:05:24,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:05:24,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:05:24,209 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:05:24,210 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:05:24" (1/1) ... [2025-03-08 12:05:24,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@751d78d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:24, skipping insertion in model container [2025-03-08 12:05:24,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:05:24" (1/1) ... [2025-03-08 12:05:24,234 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:05:24,351 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-pe-co_file-53.i[919,932] [2025-03-08 12:05:24,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:05:24,453 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:05:24,462 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-pe-co_file-53.i[919,932] [2025-03-08 12:05:24,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:05:24,534 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:05:24,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:24 WrapperNode [2025-03-08 12:05:24,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:05:24,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:05:24,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:05:24,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:05:24,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:24" (1/1) ... [2025-03-08 12:05:24,553 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:24" (1/1) ... [2025-03-08 12:05:24,587 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2025-03-08 12:05:24,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:05:24,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:05:24,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:05:24,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:05:24,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:24" (1/1) ... [2025-03-08 12:05:24,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:24" (1/1) ... [2025-03-08 12:05:24,601 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:24" (1/1) ... [2025-03-08 12:05:24,628 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 12:05:24,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:24" (1/1) ... [2025-03-08 12:05:24,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:24" (1/1) ... [2025-03-08 12:05:24,646 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:24" (1/1) ... [2025-03-08 12:05:24,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:24" (1/1) ... [2025-03-08 12:05:24,649 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:24" (1/1) ... [2025-03-08 12:05:24,650 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:24" (1/1) ... [2025-03-08 12:05:24,656 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:05:24,660 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:05:24,660 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:05:24,660 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:05:24,666 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:24" (1/1) ... [2025-03-08 12:05:24,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:05:24,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:05:24,742 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 12:05:24,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 12:05:24,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:05:24,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 12:05:24,823 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:05:24,823 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:05:24,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:05:24,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:05:24,937 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:05:24,939 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:05:26,863 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-08 12:05:26,866 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:05:26,881 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:05:26,881 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:05:26,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:05:26 BoogieIcfgContainer [2025-03-08 12:05:26,881 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:05:26,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:05:26,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:05:26,892 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:05:26,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:05:24" (1/3) ... [2025-03-08 12:05:26,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5708077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:05:26, skipping insertion in model container [2025-03-08 12:05:26,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:05:24" (2/3) ... [2025-03-08 12:05:26,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5708077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:05:26, skipping insertion in model container [2025-03-08 12:05:26,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:05:26" (3/3) ... [2025-03-08 12:05:26,898 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-53.i [2025-03-08 12:05:26,922 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:05:26,929 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-53.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:05:26,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:05:26,996 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;@36a7296e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:05:27,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:05:27,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 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-08 12:05:27,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-08 12:05:27,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:05:27,034 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:05:27,035 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:05:27,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:05:27,043 INFO L85 PathProgramCache]: Analyzing trace with hash -641221449, now seen corresponding path program 1 times [2025-03-08 12:05:27,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:05:27,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868688753] [2025-03-08 12:05:27,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:05:27,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:05:27,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:05:27,077 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:05:27,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 12:05:27,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-08 12:05:27,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-08 12:05:27,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:05:27,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:05:27,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:05:27,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:05:27,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 476 proven. 0 refuted. 0 times theorem prover too weak. 1384 trivial. 0 not checked. [2025-03-08 12:05:27,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:05:27,811 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:05:27,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868688753] [2025-03-08 12:05:27,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868688753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:05:27,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:05:27,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 12:05:27,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513646474] [2025-03-08 12:05:27,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:05:27,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:05:27,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:05:27,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:05:27,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:05:27,836 INFO L87 Difference]: Start difference. First operand has 92 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 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), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 12:05:27,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:05:27,885 INFO L93 Difference]: Finished difference Result 178 states and 316 transitions. [2025-03-08 12:05:27,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:05:27,889 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), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 199 [2025-03-08 12:05:27,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:05:27,898 INFO L225 Difference]: With dead ends: 178 [2025-03-08 12:05:27,904 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 12:05:27,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:05:27,917 INFO L435 NwaCegarLoop]: 140 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, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:05:27,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:05:27,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 12:05:27,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-08 12:05:27,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 12:05:28,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 140 transitions. [2025-03-08 12:05:28,010 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 140 transitions. Word has length 199 [2025-03-08 12:05:28,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:05:28,010 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 140 transitions. [2025-03-08 12:05:28,010 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), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 12:05:28,011 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 140 transitions. [2025-03-08 12:05:28,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-08 12:05:28,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:05:28,018 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:05:28,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-08 12:05:28,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:05:28,225 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:05:28,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:05:28,226 INFO L85 PathProgramCache]: Analyzing trace with hash 158251454, now seen corresponding path program 1 times [2025-03-08 12:05:28,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:05:28,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192844436] [2025-03-08 12:05:28,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:05:28,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:05:28,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:05:28,235 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:05:28,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 12:05:28,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-08 12:05:28,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-08 12:05:28,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:05:28,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:05:28,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 12:05:28,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:05:29,605 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-08 12:05:29,609 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:05:29,613 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:05:29,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192844436] [2025-03-08 12:05:29,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192844436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:05:29,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:05:29,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 12:05:29,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546188690] [2025-03-08 12:05:29,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:05:29,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:05:29,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:05:29,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:05:29,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:05:29,615 INFO L87 Difference]: Start difference. First operand 89 states and 140 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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-08 12:05:30,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:05:30,212 INFO L93 Difference]: Finished difference Result 257 states and 406 transitions. [2025-03-08 12:05:30,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:05:30,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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 199 [2025-03-08 12:05:30,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:05:30,221 INFO L225 Difference]: With dead ends: 257 [2025-03-08 12:05:30,224 INFO L226 Difference]: Without dead ends: 171 [2025-03-08 12:05:30,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:05:30,227 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 35 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 257 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.6s IncrementalHoareTripleChecker+Time [2025-03-08 12:05:30,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 257 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 12:05:30,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-08 12:05:30,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2025-03-08 12:05:30,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 104 states have (on average 1.3461538461538463) internal successors, (140), 104 states have internal predecessors, (140), 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-08 12:05:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 264 transitions. [2025-03-08 12:05:30,282 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 264 transitions. Word has length 199 [2025-03-08 12:05:30,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:05:30,282 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 264 transitions. [2025-03-08 12:05:30,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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-08 12:05:30,283 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 264 transitions. [2025-03-08 12:05:30,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-08 12:05:30,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:05:30,285 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] [2025-03-08 12:05:30,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-08 12:05:30,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:05:30,497 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:05:30,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:05:30,498 INFO L85 PathProgramCache]: Analyzing trace with hash 455475081, now seen corresponding path program 1 times [2025-03-08 12:05:30,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:05:30,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409849281] [2025-03-08 12:05:30,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:05:30,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:05:30,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:05:30,508 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:05:30,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 12:05:30,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 12:05:30,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 12:05:30,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:05:30,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:05:30,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 12:05:30,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:05:32,387 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-08 12:05:32,387 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:05:32,387 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:05:32,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409849281] [2025-03-08 12:05:32,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409849281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:05:32,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:05:32,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:05:32,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756093726] [2025-03-08 12:05:32,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:05:32,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:05:32,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:05:32,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:05:32,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:05:32,389 INFO L87 Difference]: Start difference. First operand 169 states and 264 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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-08 12:05:33,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:05:33,361 INFO L93 Difference]: Finished difference Result 418 states and 651 transitions. [2025-03-08 12:05:33,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:05:33,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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 200 [2025-03-08 12:05:33,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:05:33,374 INFO L225 Difference]: With dead ends: 418 [2025-03-08 12:05:33,377 INFO L226 Difference]: Without dead ends: 252 [2025-03-08 12:05:33,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:05:33,379 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 71 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 12:05:33,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 461 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 12:05:33,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-08 12:05:33,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 224. [2025-03-08 12:05:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 127 states have (on average 1.2834645669291338) internal successors, (163), 127 states have internal predecessors, (163), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 12:05:33,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 349 transitions. [2025-03-08 12:05:33,454 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 349 transitions. Word has length 200 [2025-03-08 12:05:33,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:05:33,455 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 349 transitions. [2025-03-08 12:05:33,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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-08 12:05:33,456 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 349 transitions. [2025-03-08 12:05:33,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-08 12:05:33,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:05:33,459 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] [2025-03-08 12:05:33,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 12:05:33,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:05:33,660 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:05:33,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:05:33,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1940566917, now seen corresponding path program 1 times [2025-03-08 12:05:33,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:05:33,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735741243] [2025-03-08 12:05:33,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:05:33,665 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:05:33,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:05:33,667 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:05:33,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 12:05:33,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 12:05:34,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 12:05:34,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:05:34,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:05:34,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 12:05:34,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:05:34,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-08 12:05:34,156 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:05:34,156 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:05:34,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735741243] [2025-03-08 12:05:34,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735741243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:05:34,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:05:34,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:05:34,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199181652] [2025-03-08 12:05:34,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:05:34,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:05:34,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:05:34,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:05:34,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:05:34,160 INFO L87 Difference]: Start difference. First operand 224 states and 349 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-08 12:05:35,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:05:35,380 INFO L93 Difference]: Finished difference Result 480 states and 748 transitions. [2025-03-08 12:05:35,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:05:35,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 200 [2025-03-08 12:05:35,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:05:35,391 INFO L225 Difference]: With dead ends: 480 [2025-03-08 12:05:35,395 INFO L226 Difference]: Without dead ends: 314 [2025-03-08 12:05:35,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:05:35,397 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 125 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:05:35,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 374 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 12:05:35,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-08 12:05:35,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 226. [2025-03-08 12:05:35,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 129 states have (on average 1.2790697674418605) internal successors, (165), 129 states have internal predecessors, (165), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 12:05:35,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 351 transitions. [2025-03-08 12:05:35,458 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 351 transitions. Word has length 200 [2025-03-08 12:05:35,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:05:35,460 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 351 transitions. [2025-03-08 12:05:35,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-08 12:05:35,460 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 351 transitions. [2025-03-08 12:05:35,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-08 12:05:35,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:05:35,464 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] [2025-03-08 12:05:35,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-03-08 12:05:35,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:05:35,667 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:05:35,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:05:35,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1430032740, now seen corresponding path program 1 times [2025-03-08 12:05:35,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:05:35,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056985868] [2025-03-08 12:05:35,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:05:35,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:05:35,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:05:35,670 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:05:35,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 12:05:35,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 12:05:36,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 12:05:36,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:05:36,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:05:36,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 12:05:36,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:05:36,448 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-08 12:05:36,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:05:36,985 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-08 12:05:36,986 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:05:36,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056985868] [2025-03-08 12:05:36,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056985868] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:05:36,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 12:05:36,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2025-03-08 12:05:36,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055508303] [2025-03-08 12:05:36,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 12:05:36,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 12:05:36,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:05:36,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 12:05:36,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-08 12:05:36,991 INFO L87 Difference]: Start difference. First operand 226 states and 351 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 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-08 12:05:39,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:05:39,953 INFO L93 Difference]: Finished difference Result 511 states and 775 transitions. [2025-03-08 12:05:39,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 12:05:39,964 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 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 200 [2025-03-08 12:05:39,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:05:39,971 INFO L225 Difference]: With dead ends: 511 [2025-03-08 12:05:39,971 INFO L226 Difference]: Without dead ends: 343 [2025-03-08 12:05:39,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 390 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=268, Invalid=724, Unknown=0, NotChecked=0, Total=992 [2025-03-08 12:05:39,975 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 282 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 12:05:39,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 895 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 12:05:39,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-03-08 12:05:40,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 236. [2025-03-08 12:05:40,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 136 states have (on average 1.2573529411764706) internal successors, (171), 136 states have internal predecessors, (171), 93 states have call successors, (93), 6 states have call predecessors, (93), 6 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 12:05:40,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 357 transitions. [2025-03-08 12:05:40,032 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 357 transitions. Word has length 200 [2025-03-08 12:05:40,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:05:40,033 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 357 transitions. [2025-03-08 12:05:40,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 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-08 12:05:40,033 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 357 transitions. [2025-03-08 12:05:40,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-08 12:05:40,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:05:40,034 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:05:40,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-08 12:05:40,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:05:40,243 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:05:40,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:05:40,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1311963743, now seen corresponding path program 1 times [2025-03-08 12:05:40,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:05:40,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425424565] [2025-03-08 12:05:40,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:05:40,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:05:40,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:05:40,250 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:05:40,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-08 12:05:40,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-08 12:05:40,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-08 12:05:40,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:05:40,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:05:40,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 12:05:40,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:05:40,605 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-08 12:05:40,605 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:05:40,605 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:05:40,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425424565] [2025-03-08 12:05:40,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425424565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:05:40,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:05:40,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:05:40,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074299593] [2025-03-08 12:05:40,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:05:40,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:05:40,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:05:40,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:05:40,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:05:40,610 INFO L87 Difference]: Start difference. First operand 236 states and 357 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-08 12:05:41,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:05:41,541 INFO L93 Difference]: Finished difference Result 415 states and 629 transitions. [2025-03-08 12:05:41,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:05:41,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 201 [2025-03-08 12:05:41,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:05:41,544 INFO L225 Difference]: With dead ends: 415 [2025-03-08 12:05:41,544 INFO L226 Difference]: Without dead ends: 241 [2025-03-08 12:05:41,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:05:41,552 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 129 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 12:05:41,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 306 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 12:05:41,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-08 12:05:41,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 236. [2025-03-08 12:05:41,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 136 states have (on average 1.2426470588235294) internal successors, (169), 136 states have internal predecessors, (169), 93 states have call successors, (93), 6 states have call predecessors, (93), 6 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 12:05:41,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 355 transitions. [2025-03-08 12:05:41,594 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 355 transitions. Word has length 201 [2025-03-08 12:05:41,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:05:41,597 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 355 transitions. [2025-03-08 12:05:41,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-08 12:05:41,597 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 355 transitions. [2025-03-08 12:05:41,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-08 12:05:41,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:05:41,600 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-08 12:05:41,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-08 12:05:41,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:05:41,800 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:05:41,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:05:41,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1397993819, now seen corresponding path program 1 times [2025-03-08 12:05:41,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:05:41,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114036754] [2025-03-08 12:05:41,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:05:41,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:05:41,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:05:41,809 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:05:41,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-08 12:05:41,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-08 12:05:42,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-08 12:05:42,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:05:42,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:05:42,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 12:05:42,228 INFO L279 TraceCheckSpWp]: Computing forward predicates...