./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-17.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-17.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 4feb39e487a380ff9488b8d70ce2acf8acdc63d176a7d1801d07edeaf24892b2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:00:13,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:00:13,994 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 12:00:14,006 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:00:14,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:00:14,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:00:14,050 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:00:14,051 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:00:14,051 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:00:14,051 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:00:14,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:00:14,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:00:14,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:00:14,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:00:14,051 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:00:14,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:00:14,051 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:00:14,052 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:00:14,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 12:00:14,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:00:14,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:00:14,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:00:14,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:00:14,052 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:00:14,052 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:00:14,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:00:14,052 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:00:14,052 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:00:14,052 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:00:14,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:00:14,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:00:14,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:00:14,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:00:14,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:00:14,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:00:14,052 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:00:14,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:00:14,053 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 12:00:14,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 12:00:14,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:00:14,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:00:14,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:00:14,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:00:14,053 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 -> 4feb39e487a380ff9488b8d70ce2acf8acdc63d176a7d1801d07edeaf24892b2 [2025-03-08 12:00:14,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:00:14,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:00:14,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:00:14,379 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:00:14,383 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:00:14,384 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-17.i [2025-03-08 12:00:16,251 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58082a180/6572fdc802f1428699a7945dc15a5fdc/FLAG724ba011d [2025-03-08 12:00:16,687 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:00:16,689 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-17.i [2025-03-08 12:00:16,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58082a180/6572fdc802f1428699a7945dc15a5fdc/FLAG724ba011d [2025-03-08 12:00:16,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58082a180/6572fdc802f1428699a7945dc15a5fdc [2025-03-08 12:00:16,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:00:16,875 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:00:16,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:00:16,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:00:16,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:00:16,888 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:00:16" (1/1) ... [2025-03-08 12:00:16,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8fa28fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:16, skipping insertion in model container [2025-03-08 12:00:16,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:00:16" (1/1) ... [2025-03-08 12:00:16,919 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:00:17,112 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-17.i[919,932] [2025-03-08 12:00:17,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:00:17,267 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:00:17,282 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-17.i[919,932] [2025-03-08 12:00:17,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:00:17,376 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:00:17,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:17 WrapperNode [2025-03-08 12:00:17,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:00:17,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:00:17,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:00:17,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:00:17,390 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:00:17" (1/1) ... [2025-03-08 12:00:17,416 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:00:17" (1/1) ... [2025-03-08 12:00:17,488 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 235 [2025-03-08 12:00:17,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:00:17,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:00:17,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:00:17,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:00:17,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:17" (1/1) ... [2025-03-08 12:00:17,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:17" (1/1) ... [2025-03-08 12:00:17,512 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:17" (1/1) ... [2025-03-08 12:00:17,554 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:00:17,554 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:17" (1/1) ... [2025-03-08 12:00:17,554 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:17" (1/1) ... [2025-03-08 12:00:17,564 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:17" (1/1) ... [2025-03-08 12:00:17,569 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:17" (1/1) ... [2025-03-08 12:00:17,570 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:17" (1/1) ... [2025-03-08 12:00:17,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:17" (1/1) ... [2025-03-08 12:00:17,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:00:17,581 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:00:17,581 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:00:17,581 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:00:17,582 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:17" (1/1) ... [2025-03-08 12:00:17,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:00:17,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:00:17,609 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:00:17,612 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:00:17,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:00:17,630 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:00:17,630 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:00:17,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 12:00:17,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:00:17,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:00:17,735 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:00:17,740 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:00:18,386 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L187: havoc property_#t~ite24#1;havoc property_#t~ite23#1;havoc property_#t~bitwise22#1;havoc property_#t~short25#1; [2025-03-08 12:00:18,457 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 12:00:18,457 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:00:18,505 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:00:18,506 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:00:18,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:00:18 BoogieIcfgContainer [2025-03-08 12:00:18,506 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:00:18,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:00:18,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:00:18,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:00:18,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:00:16" (1/3) ... [2025-03-08 12:00:18,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f91f958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:00:18, skipping insertion in model container [2025-03-08 12:00:18,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:17" (2/3) ... [2025-03-08 12:00:18,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f91f958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:00:18, skipping insertion in model container [2025-03-08 12:00:18,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:00:18" (3/3) ... [2025-03-08 12:00:18,531 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-17.i [2025-03-08 12:00:18,555 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:00:18,559 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-17.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:00:18,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:00:18,671 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;@15ecd92f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:00:18,671 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:00:18,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 76 states have internal predecessors, (110), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 12:00:18,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 12:00:18,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:00:18,703 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:18,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:00:18,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:00:18,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2110438327, now seen corresponding path program 1 times [2025-03-08 12:00:18,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:00:18,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352201484] [2025-03-08 12:00:18,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:00:18,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:00:18,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 12:00:18,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 12:00:18,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:00:18,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:00:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-08 12:00:19,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:00:19,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352201484] [2025-03-08 12:00:19,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352201484] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:00:19,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297424995] [2025-03-08 12:00:19,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:00:19,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:00:19,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:00:19,191 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:00:19,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 12:00:19,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 12:00:19,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 12:00:19,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:00:19,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:00:19,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:00:19,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:00:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-08 12:00:19,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:00:19,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297424995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:00:19,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:00:19,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 12:00:19,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234936932] [2025-03-08 12:00:19,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:00:19,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:00:19,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:00:19,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:00:19,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:00:19,532 INFO L87 Difference]: Start difference. First operand has 104 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 76 states have internal predecessors, (110), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 12:00:19,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:00:19,576 INFO L93 Difference]: Finished difference Result 202 states and 345 transitions. [2025-03-08 12:00:19,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:00:19,578 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 175 [2025-03-08 12:00:19,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:00:19,584 INFO L225 Difference]: With dead ends: 202 [2025-03-08 12:00:19,588 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 12:00:19,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 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:00:19,601 INFO L435 NwaCegarLoop]: 153 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, 153 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:00:19,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:00:19,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 12:00:19,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-08 12:00:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 73 states have internal predecessors, (105), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 12:00:19,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 157 transitions. [2025-03-08 12:00:19,672 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 157 transitions. Word has length 175 [2025-03-08 12:00:19,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:00:19,677 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 157 transitions. [2025-03-08 12:00:19,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 12:00:19,677 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 157 transitions. [2025-03-08 12:00:19,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 12:00:19,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:00:19,682 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:19,689 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:00:19,883 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:00:19,883 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:00:19,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:00:19,885 INFO L85 PathProgramCache]: Analyzing trace with hash -946210459, now seen corresponding path program 1 times [2025-03-08 12:00:19,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:00:19,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830655619] [2025-03-08 12:00:19,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:00:19,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:00:19,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 12:00:20,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 12:00:20,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:00:20,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:00:20,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 12:00:20,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:00:20,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830655619] [2025-03-08 12:00:20,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830655619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:00:20,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:00:20,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:00:20,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686563220] [2025-03-08 12:00:20,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:00:20,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:00:20,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:00:20,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:00:20,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:00:20,593 INFO L87 Difference]: Start difference. First operand 101 states and 157 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 12:00:21,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:00:21,043 INFO L93 Difference]: Finished difference Result 376 states and 586 transitions. [2025-03-08 12:00:21,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:00:21,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2025-03-08 12:00:21,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:00:21,046 INFO L225 Difference]: With dead ends: 376 [2025-03-08 12:00:21,052 INFO L226 Difference]: Without dead ends: 278 [2025-03-08 12:00:21,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:00:21,054 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 212 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 12:00:21,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 357 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 12:00:21,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-03-08 12:00:21,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 204. [2025-03-08 12:00:21,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 149 states have (on average 1.4563758389261745) internal successors, (217), 149 states have internal predecessors, (217), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 12:00:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 321 transitions. [2025-03-08 12:00:21,136 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 321 transitions. Word has length 175 [2025-03-08 12:00:21,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:00:21,139 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 321 transitions. [2025-03-08 12:00:21,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 12:00:21,140 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 321 transitions. [2025-03-08 12:00:21,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 12:00:21,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:00:21,147 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:21,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 12:00:21,148 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:00:21,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:00:21,148 INFO L85 PathProgramCache]: Analyzing trace with hash -817127740, now seen corresponding path program 1 times [2025-03-08 12:00:21,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:00:21,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630739139] [2025-03-08 12:00:21,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:00:21,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:00:21,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 12:00:21,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 12:00:21,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:00:21,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:00:21,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 12:00:21,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:00:21,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630739139] [2025-03-08 12:00:21,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630739139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:00:21,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:00:21,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:00:21,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382395802] [2025-03-08 12:00:21,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:00:21,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:00:21,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:00:21,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:00:21,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:00:21,922 INFO L87 Difference]: Start difference. First operand 204 states and 321 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 12:00:22,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:00:22,310 INFO L93 Difference]: Finished difference Result 546 states and 862 transitions. [2025-03-08 12:00:22,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:00:22,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2025-03-08 12:00:22,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:00:22,318 INFO L225 Difference]: With dead ends: 546 [2025-03-08 12:00:22,319 INFO L226 Difference]: Without dead ends: 345 [2025-03-08 12:00:22,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:00:22,321 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 108 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:00:22,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 517 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 12:00:22,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-08 12:00:22,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 253. [2025-03-08 12:00:22,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 171 states have (on average 1.3976608187134503) internal successors, (239), 171 states have internal predecessors, (239), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 12:00:22,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 395 transitions. [2025-03-08 12:00:22,388 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 395 transitions. Word has length 175 [2025-03-08 12:00:22,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:00:22,390 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 395 transitions. [2025-03-08 12:00:22,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 12:00:22,394 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 395 transitions. [2025-03-08 12:00:22,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 12:00:22,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:00:22,399 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:22,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 12:00:22,399 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:00:22,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:00:22,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1923083856, now seen corresponding path program 1 times [2025-03-08 12:00:22,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:00:22,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530352221] [2025-03-08 12:00:22,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:00:22,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:00:22,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 12:00:22,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 12:00:22,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:00:22,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:00:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 12:00:24,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:00:24,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530352221] [2025-03-08 12:00:24,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530352221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:00:24,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:00:24,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 12:00:24,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290073325] [2025-03-08 12:00:24,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:00:24,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 12:00:24,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:00:24,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 12:00:24,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 12:00:24,588 INFO L87 Difference]: Start difference. First operand 253 states and 395 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 12:00:27,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:00:27,824 INFO L93 Difference]: Finished difference Result 1005 states and 1574 transitions. [2025-03-08 12:00:27,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 12:00:27,825 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2025-03-08 12:00:27,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:00:27,831 INFO L225 Difference]: With dead ends: 1005 [2025-03-08 12:00:27,833 INFO L226 Difference]: Without dead ends: 804 [2025-03-08 12:00:27,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2025-03-08 12:00:27,836 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 1273 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1273 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 12:00:27,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1273 Valid, 1009 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 12:00:27,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-03-08 12:00:27,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 492. [2025-03-08 12:00:27,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 356 states have (on average 1.4325842696629214) internal successors, (510), 356 states have internal predecessors, (510), 130 states have call successors, (130), 5 states have call predecessors, (130), 5 states have return successors, (130), 130 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-08 12:00:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 770 transitions. [2025-03-08 12:00:27,952 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 770 transitions. Word has length 176 [2025-03-08 12:00:27,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:00:27,952 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 770 transitions. [2025-03-08 12:00:27,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 12:00:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 770 transitions. [2025-03-08 12:00:27,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 12:00:27,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:00:27,958 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:27,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 12:00:27,958 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:00:27,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:00:27,959 INFO L85 PathProgramCache]: Analyzing trace with hash -476106265, now seen corresponding path program 1 times [2025-03-08 12:00:27,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:00:27,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381951543] [2025-03-08 12:00:27,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:00:27,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:00:27,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 12:00:27,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 12:00:27,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:00:27,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:00:28,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 12:00:28,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:00:28,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381951543] [2025-03-08 12:00:28,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381951543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:00:28,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:00:28,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:00:28,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672931320] [2025-03-08 12:00:28,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:00:28,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:00:28,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:00:28,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:00:28,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:00:28,119 INFO L87 Difference]: Start difference. First operand 492 states and 770 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 12:00:28,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:00:28,604 INFO L93 Difference]: Finished difference Result 1547 states and 2416 transitions. [2025-03-08 12:00:28,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:00:28,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-03-08 12:00:28,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:00:28,617 INFO L225 Difference]: With dead ends: 1547 [2025-03-08 12:00:28,621 INFO L226 Difference]: Without dead ends: 1107 [2025-03-08 12:00:28,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:00:28,624 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 260 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:00:28,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 432 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 12:00:28,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2025-03-08 12:00:28,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 870. [2025-03-08 12:00:28,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 689 states have (on average 1.4760522496371553) internal successors, (1017), 693 states have internal predecessors, (1017), 170 states have call successors, (170), 10 states have call predecessors, (170), 10 states have return successors, (170), 166 states have call predecessors, (170), 170 states have call successors, (170) [2025-03-08 12:00:28,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1357 transitions. [2025-03-08 12:00:28,855 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1357 transitions. Word has length 177 [2025-03-08 12:00:28,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:00:28,856 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1357 transitions. [2025-03-08 12:00:28,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 12:00:28,858 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1357 transitions. [2025-03-08 12:00:28,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 12:00:28,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:00:28,863 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:28,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 12:00:28,863 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:00:28,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:00:28,864 INFO L85 PathProgramCache]: Analyzing trace with hash -672619770, now seen corresponding path program 1 times [2025-03-08 12:00:28,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:00:28,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21642947] [2025-03-08 12:00:28,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:00:28,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:00:28,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 12:00:28,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 12:00:28,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:00:28,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:00:29,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 12:00:29,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:00:29,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21642947] [2025-03-08 12:00:29,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21642947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:00:29,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:00:29,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:00:29,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141785272] [2025-03-08 12:00:29,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:00:29,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:00:29,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:00:29,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:00:29,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:00:29,491 INFO L87 Difference]: Start difference. First operand 870 states and 1357 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 12:00:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:00:30,114 INFO L93 Difference]: Finished difference Result 2778 states and 4307 transitions. [2025-03-08 12:00:30,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 12:00:30,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-03-08 12:00:30,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:00:30,138 INFO L225 Difference]: With dead ends: 2778 [2025-03-08 12:00:30,138 INFO L226 Difference]: Without dead ends: 1956 [2025-03-08 12:00:30,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:00:30,147 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 407 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 12:00:30,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 559 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 12:00:30,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2025-03-08 12:00:30,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1462. [2025-03-08 12:00:30,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 1141 states have (on average 1.4390885188431202) internal successors, (1642), 1149 states have internal predecessors, (1642), 298 states have call successors, (298), 22 states have call predecessors, (298), 22 states have return successors, (298), 290 states have call predecessors, (298), 298 states have call successors, (298) [2025-03-08 12:00:30,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 2238 transitions. [2025-03-08 12:00:30,369 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 2238 transitions. Word has length 177 [2025-03-08 12:00:30,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:00:30,374 INFO L471 AbstractCegarLoop]: Abstraction has 1462 states and 2238 transitions. [2025-03-08 12:00:30,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 12:00:30,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 2238 transitions. [2025-03-08 12:00:30,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 12:00:30,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:00:30,379 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:30,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 12:00:30,380 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:00:30,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:00:30,380 INFO L85 PathProgramCache]: Analyzing trace with hash -473783261, now seen corresponding path program 1 times [2025-03-08 12:00:30,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:00:30,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469532325] [2025-03-08 12:00:30,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:00:30,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:00:30,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 12:00:30,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 12:00:30,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:00:30,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:00:31,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 12:00:31,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:00:31,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469532325] [2025-03-08 12:00:31,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469532325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:00:31,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:00:31,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 12:00:31,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212707605] [2025-03-08 12:00:31,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:00:31,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:00:31,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:00:31,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:00:31,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:00:31,105 INFO L87 Difference]: Start difference. First operand 1462 states and 2238 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 12:00:32,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:00:32,755 INFO L93 Difference]: Finished difference Result 3897 states and 5931 transitions. [2025-03-08 12:00:32,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 12:00:32,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-03-08 12:00:32,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:00:32,782 INFO L225 Difference]: With dead ends: 3897 [2025-03-08 12:00:32,786 INFO L226 Difference]: Without dead ends: 2490 [2025-03-08 12:00:32,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-08 12:00:32,795 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 591 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:00:32,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 442 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 12:00:32,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2490 states. [2025-03-08 12:00:33,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2490 to 1982. [2025-03-08 12:00:33,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1541 states have (on average 1.4205061648280337) internal successors, (2189), 1557 states have internal predecessors, (2189), 402 states have call successors, (402), 38 states have call predecessors, (402), 38 states have return successors, (402), 386 states have call predecessors, (402), 402 states have call successors, (402) [2025-03-08 12:00:33,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 2993 transitions. [2025-03-08 12:00:33,186 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 2993 transitions. Word has length 177 [2025-03-08 12:00:33,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:00:33,193 INFO L471 AbstractCegarLoop]: Abstraction has 1982 states and 2993 transitions. [2025-03-08 12:00:33,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 12:00:33,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 2993 transitions. [2025-03-08 12:00:33,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 12:00:33,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:00:33,197 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:33,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 12:00:33,197 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:00:33,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:00:33,197 INFO L85 PathProgramCache]: Analyzing trace with hash 2045548771, now seen corresponding path program 1 times [2025-03-08 12:00:33,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:00:33,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354093282] [2025-03-08 12:00:33,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:00:33,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:00:33,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 12:00:33,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 12:00:33,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:00:33,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:00:34,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 12:00:34,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:00:34,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354093282] [2025-03-08 12:00:34,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354093282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:00:34,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:00:34,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:00:34,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43568120] [2025-03-08 12:00:34,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:00:34,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:00:34,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:00:34,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:00:34,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:00:34,043 INFO L87 Difference]: Start difference. First operand 1982 states and 2993 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 12:00:34,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:00:34,873 INFO L93 Difference]: Finished difference Result 5161 states and 7679 transitions. [2025-03-08 12:00:34,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:00:34,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-03-08 12:00:34,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:00:34,894 INFO L225 Difference]: With dead ends: 5161 [2025-03-08 12:00:34,894 INFO L226 Difference]: Without dead ends: 3234 [2025-03-08 12:00:34,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:00:34,900 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 331 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 12:00:34,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 505 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 12:00:34,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3234 states. [2025-03-08 12:00:35,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3234 to 2316. [2025-03-08 12:00:35,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2316 states, 1830 states have (on average 1.4218579234972677) internal successors, (2602), 1850 states have internal predecessors, (2602), 434 states have call successors, (434), 51 states have call predecessors, (434), 51 states have return successors, (434), 414 states have call predecessors, (434), 434 states have call successors, (434) [2025-03-08 12:00:35,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 2316 states and 3470 transitions. [2025-03-08 12:00:35,247 INFO L78 Accepts]: Start accepts. Automaton has 2316 states and 3470 transitions. Word has length 177 [2025-03-08 12:00:35,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:00:35,248 INFO L471 AbstractCegarLoop]: Abstraction has 2316 states and 3470 transitions. [2025-03-08 12:00:35,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 12:00:35,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 3470 transitions. [2025-03-08 12:00:35,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 12:00:35,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:00:35,256 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:35,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 12:00:35,256 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:00:35,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:00:35,257 INFO L85 PathProgramCache]: Analyzing trace with hash 248597412, now seen corresponding path program 1 times [2025-03-08 12:00:35,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:00:35,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182048853] [2025-03-08 12:00:35,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:00:35,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:00:35,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 12:00:35,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 12:00:35,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:00:35,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:00:35,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-08 12:00:35,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:00:35,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182048853] [2025-03-08 12:00:35,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182048853] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:00:35,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941218102] [2025-03-08 12:00:35,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:00:35,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:00:35,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:00:35,956 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:00:35,957 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:00:36,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 12:00:36,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 12:00:36,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:00:36,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:00:36,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 12:00:36,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:00:36,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 645 proven. 45 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2025-03-08 12:00:36,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:00:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-08 12:00:37,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941218102] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:00:37,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:00:37,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 18 [2025-03-08 12:00:37,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967332202] [2025-03-08 12:00:37,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:00:37,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 12:00:37,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:00:37,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 12:00:37,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-03-08 12:00:37,508 INFO L87 Difference]: Start difference. First operand 2316 states and 3470 transitions. Second operand has 18 states, 18 states have (on average 7.111111111111111) internal successors, (128), 18 states have internal predecessors, (128), 5 states have call successors, (67), 3 states have call predecessors, (67), 6 states have return successors, (68), 5 states have call predecessors, (68), 5 states have call successors, (68) [2025-03-08 12:00:39,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:00:39,733 INFO L93 Difference]: Finished difference Result 5780 states and 8543 transitions. [2025-03-08 12:00:39,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 12:00:39,734 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.111111111111111) internal successors, (128), 18 states have internal predecessors, (128), 5 states have call successors, (67), 3 states have call predecessors, (67), 6 states have return successors, (68), 5 states have call predecessors, (68), 5 states have call successors, (68) Word has length 177 [2025-03-08 12:00:39,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:00:39,756 INFO L225 Difference]: With dead ends: 5780 [2025-03-08 12:00:39,756 INFO L226 Difference]: Without dead ends: 3519 [2025-03-08 12:00:39,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 348 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=428, Invalid=1294, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 12:00:39,764 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1109 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:00:39,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 1051 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 12:00:39,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3519 states. [2025-03-08 12:00:40,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3519 to 2069. [2025-03-08 12:00:40,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2069 states, 1553 states have (on average 1.347070186735351) internal successors, (2092), 1572 states have internal predecessors, (2092), 454 states have call successors, (454), 61 states have call predecessors, (454), 61 states have return successors, (454), 435 states have call predecessors, (454), 454 states have call successors, (454) [2025-03-08 12:00:40,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 3000 transitions. [2025-03-08 12:00:40,041 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 3000 transitions. Word has length 177 [2025-03-08 12:00:40,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:00:40,042 INFO L471 AbstractCegarLoop]: Abstraction has 2069 states and 3000 transitions. [2025-03-08 12:00:40,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.111111111111111) internal successors, (128), 18 states have internal predecessors, (128), 5 states have call successors, (67), 3 states have call predecessors, (67), 6 states have return successors, (68), 5 states have call predecessors, (68), 5 states have call successors, (68) [2025-03-08 12:00:40,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 3000 transitions. [2025-03-08 12:00:40,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 12:00:40,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:00:40,044 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:40,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 12:00:40,244 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,SelfDestructingSolverStorable8 [2025-03-08 12:00:40,245 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:00:40,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:00:40,245 INFO L85 PathProgramCache]: Analyzing trace with hash -687457178, now seen corresponding path program 1 times [2025-03-08 12:00:40,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:00:40,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006363287] [2025-03-08 12:00:40,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:00:40,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:00:40,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 12:00:40,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 12:00:40,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:00:40,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:00:43,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 12:00:43,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:00:43,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006363287] [2025-03-08 12:00:43,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006363287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:00:43,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:00:43,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 12:00:43,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436625121] [2025-03-08 12:00:43,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:00:43,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 12:00:43,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:00:43,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 12:00:43,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 12:00:43,879 INFO L87 Difference]: Start difference. First operand 2069 states and 3000 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 12:00:48,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:00:48,497 INFO L93 Difference]: Finished difference Result 4838 states and 6945 transitions. [2025-03-08 12:00:48,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 12:00:48,497 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-03-08 12:00:48,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:00:48,516 INFO L225 Difference]: With dead ends: 4838 [2025-03-08 12:00:48,516 INFO L226 Difference]: Without dead ends: 4446 [2025-03-08 12:00:48,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=335, Invalid=997, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 12:00:48,520 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1525 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 1534 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 1884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 12:00:48,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 1366 Invalid, 1884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1534 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 12:00:48,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4446 states. [2025-03-08 12:00:48,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4446 to 2582. [2025-03-08 12:00:48,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2582 states, 1966 states have (on average 1.3580874872838251) internal successors, (2670), 1988 states have internal predecessors, (2670), 540 states have call successors, (540), 75 states have call predecessors, (540), 75 states have return successors, (540), 518 states have call predecessors, (540), 540 states have call successors, (540) [2025-03-08 12:00:48,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 3750 transitions. [2025-03-08 12:00:48,923 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 3750 transitions. Word has length 177 [2025-03-08 12:00:48,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:00:48,924 INFO L471 AbstractCegarLoop]: Abstraction has 2582 states and 3750 transitions. [2025-03-08 12:00:48,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 12:00:48,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 3750 transitions. [2025-03-08 12:00:48,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 12:00:48,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:00:48,925 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:48,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 12:00:48,926 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:00:48,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:00:48,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1834197858, now seen corresponding path program 1 times [2025-03-08 12:00:48,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:00:48,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599474160] [2025-03-08 12:00:48,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:00:48,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:00:48,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 12:00:48,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 12:00:48,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:00:48,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 12:00:48,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1354707800] [2025-03-08 12:00:48,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:00:48,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:00:48,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:00:48,998 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:00:49,000 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:00:49,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 12:00:49,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 12:00:49,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:00:49,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:00:49,085 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 12:00:49,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 12:00:49,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 12:00:49,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:00:49,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:00:49,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 12:00:49,213 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 12:00:49,214 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 12:00:49,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 12:00:49,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:00:49,422 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:00:49,522 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 12:00:49,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:00:49 BoogieIcfgContainer [2025-03-08 12:00:49,527 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 12:00:49,528 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 12:00:49,528 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 12:00:49,528 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 12:00:49,528 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:00:18" (3/4) ... [2025-03-08 12:00:49,530 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 12:00:49,531 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 12:00:49,531 INFO L158 Benchmark]: Toolchain (without parser) took 32656.66ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 105.5MB in the beginning and 278.5MB in the end (delta: -173.0MB). Peak memory consumption was 380.2MB. Max. memory is 16.1GB. [2025-03-08 12:00:49,532 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:00:49,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 503.99ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 90.3MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 12:00:49,532 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.08ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 85.6MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:00:49,532 INFO L158 Benchmark]: Boogie Preprocessor took 91.22ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 81.1MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 12:00:49,532 INFO L158 Benchmark]: IcfgBuilder took 925.27ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 49.2MB in the end (delta: 31.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 12:00:49,533 INFO L158 Benchmark]: TraceAbstraction took 31012.06ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 48.4MB in the beginning and 278.7MB in the end (delta: -230.3MB). Peak memory consumption was 321.5MB. Max. memory is 16.1GB. [2025-03-08 12:00:49,533 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 696.3MB. Free memory was 278.7MB in the beginning and 278.5MB in the end (delta: 180.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:00:49,534 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.26ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 503.99ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 90.3MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.08ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 85.6MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 91.22ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 81.1MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 925.27ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 49.2MB in the end (delta: 31.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 31012.06ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 48.4MB in the beginning and 278.7MB in the end (delta: -230.3MB). Peak memory consumption was 321.5MB. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 696.3MB. Free memory was 278.7MB in the beginning and 278.5MB in the end (delta: 180.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 129, overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 171, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 161, overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of someBinaryDOUBLEComparisonOperation at line 159. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 25; [L23] unsigned char var_1_2 = 25; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 0; [L26] signed long int var_1_5 = 4; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 1; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 0; [L31] double var_1_11 = 7.3; [L32] double var_1_12 = 1.25; [L33] double var_1_13 = 128.8; [L34] signed char var_1_14 = -1; [L35] signed char var_1_15 = 10; [L36] signed short int var_1_16 = 8; [L37] unsigned long int var_1_18 = 128; [L38] unsigned long int var_1_19 = 3963666122; [L39] float var_1_20 = 15.875; [L40] float var_1_21 = 4.2; [L41] float var_1_22 = 5.5; [L42] signed short int var_1_23 = -10; [L43] unsigned long int var_1_30 = 1000000000; [L44] unsigned long int var_1_31 = 4155847319; [L45] float var_1_33 = 99.25; [L46] signed long int var_1_34 = 10; [L47] unsigned char var_1_35 = 16; [L48] unsigned char var_1_36 = 100; [L49] signed long int var_1_39 = -128; [L50] signed long int var_1_40 = 1792665454; [L51] unsigned char last_1_var_1_8 = 1; [L52] signed char last_1_var_1_14 = -1; VAL [isInitial=0, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=25, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L191] isInitial = 1 [L192] FCALL initially() [L193] COND TRUE 1 [L194] CALL updateLastVariables() [L183] last_1_var_1_8 = var_1_8 [L184] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=25, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L194] RET updateLastVariables() [L195] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L142] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L142] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L143] var_1_3 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L144] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L145] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L146] var_1_4 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L147] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L148] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L149] var_1_7 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L150] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=0] [L151] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=0] [L152] var_1_9 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L153] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L154] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L154] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L155] var_1_10 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L156] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L157] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L157] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L158] var_1_12 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L159] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L160] var_1_13 = __VERIFIER_nondet_double() [L161] 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=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L161] 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=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L162] var_1_15 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_15 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L163] RET assume_abort_if_not(var_1_15 >= -127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L164] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L164] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L165] var_1_19 = __VERIFIER_nondet_ulong() [L166] CALL assume_abort_if_not(var_1_19 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L166] RET assume_abort_if_not(var_1_19 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L167] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L167] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L168] var_1_21 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L169] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_22=11/2, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L170] var_1_22 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L171] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L172] var_1_31 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_31 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L173] RET assume_abort_if_not(var_1_31 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L174] CALL assume_abort_if_not(var_1_31 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L174] RET assume_abort_if_not(var_1_31 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L175] var_1_36 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L176] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L177] CALL assume_abort_if_not(var_1_36 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L177] RET assume_abort_if_not(var_1_36 <= 254) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L178] var_1_40 = __VERIFIER_nondet_long() [L179] CALL assume_abort_if_not(var_1_40 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L179] RET assume_abort_if_not(var_1_40 >= 1073741823) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L180] CALL assume_abort_if_not(var_1_40 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L180] RET assume_abort_if_not(var_1_40 <= 2147483646) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L195] RET updateVariables() [L196] CALL step() [L56] unsigned char stepLocal_0 = last_1_var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_0=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L57] COND TRUE stepLocal_0 && last_1_var_1_8 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L58] COND TRUE \read(last_1_var_1_8) [L59] var_1_5 = (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L64] COND TRUE var_1_5 < var_1_3 [L65] var_1_8 = ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L69] var_1_1 = (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L70] COND FALSE !((64.4f + 1.5f) <= var_1_13) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L75] unsigned char stepLocal_3 = var_1_9 && var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_3=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L76] COND TRUE stepLocal_3 || (var_1_8 && var_1_10) [L77] var_1_18 = (var_1_19 - (((((1991720936u - var_1_1)) < (var_1_2)) ? ((1991720936u - var_1_1)) : (var_1_2)))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L81] signed long int stepLocal_1 = 8 + var_1_14; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_1=7, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L82] COND TRUE var_1_4 == stepLocal_1 [L83] var_1_11 = ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L85] EXPR var_1_15 & var_1_1 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L85] unsigned long int stepLocal_2 = var_1_18 * (var_1_15 & var_1_1); [L86] COND FALSE !(var_1_12 >= 9.6) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L97] var_1_20 = ((((var_1_21) < (var_1_22)) ? (var_1_21) : (var_1_22))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L98] COND FALSE !(128u <= var_1_5) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=513, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L113] COND TRUE var_1_1 >= var_1_16 [L114] var_1_30 = (((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31))) - var_1_1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=513, var_1_30=2147483596, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L116] var_1_33 = var_1_21 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=513, var_1_30=2147483596, var_1_31=2147483647, var_1_33=3, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L117] COND TRUE \read(var_1_8) [L118] var_1_34 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=513, var_1_30=2147483596, var_1_31=2147483647, var_1_33=3, var_1_34=1, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L120] COND TRUE var_1_31 > var_1_1 [L121] var_1_35 = var_1_36 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=513, var_1_30=2147483596, var_1_31=2147483647, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L129] EXPR var_1_1 >> var_1_16 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=513, var_1_30=2147483596, var_1_31=2147483647, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L129] COND FALSE !(var_1_14 > (var_1_1 >> var_1_16)) [L136] var_1_39 = var_1_18 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=513, var_1_30=2147483596, var_1_31=2147483647, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=2147483646, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L196] RET step() [L197] CALL, EXPR property() [L187] EXPR (((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=513, var_1_30=2147483596, var_1_31=2147483647, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=2147483646, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L187-L188] return ((((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1)) && (((var_1_9 && var_1_8) || (var_1_8 && var_1_10)) ? (var_1_18 == ((unsigned long int) (var_1_19 - (((((1991720936u - var_1_1)) < (var_1_2)) ? ((1991720936u - var_1_1)) : (var_1_2)))))) : (var_1_18 == ((unsigned long int) var_1_2))) ; [L197] RET, EXPR property() [L197] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=513, var_1_30=2147483596, var_1_31=2147483647, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=2147483646, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=513, var_1_30=2147483596, var_1_31=2147483647, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=2147483646, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 188 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.8s, OverallIterations: 11, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5827 SdHoareTripleChecker+Valid, 9.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5816 mSDsluCounter, 6391 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4311 mSDsCounter, 1437 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4624 IncrementalHoareTripleChecker+Invalid, 6061 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1437 mSolverCounterUnsat, 2080 mSDtfsCounter, 4624 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 690 GetRequests, 577 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2582occurred in iteration=10, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 5949 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 2469 NumberOfCodeBlocks, 2469 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2279 ConstructedInterpolants, 0 QuantifiedInterpolants, 8916 SizeOfPredicates, 5 NumberOfNonLiveVariables, 815 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 16715/16900 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:00:49,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-17.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 4feb39e487a380ff9488b8d70ce2acf8acdc63d176a7d1801d07edeaf24892b2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:00:51,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:00:52,120 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 12:00:52,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:00:52,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:00:52,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:00:52,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:00:52,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:00:52,199 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:00:52,201 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:00:52,201 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:00:52,201 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:00:52,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:00:52,201 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:00:52,201 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:00:52,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:00:52,202 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:00:52,202 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:00:52,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:00:52,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:00:52,202 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:00:52,202 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:00:52,202 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:00:52,202 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 12:00:52,202 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 12:00:52,202 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 12:00:52,202 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:00:52,202 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:00:52,202 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:00:52,202 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:00:52,202 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:00:52,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:00:52,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:00:52,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:00:52,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:00:52,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:00:52,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:00:52,203 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:00:52,203 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:00:52,203 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 12:00:52,203 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 12:00:52,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:00:52,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:00:52,203 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:00:52,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:00:52,203 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 -> 4feb39e487a380ff9488b8d70ce2acf8acdc63d176a7d1801d07edeaf24892b2 [2025-03-08 12:00:52,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:00:52,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:00:52,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:00:52,662 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:00:52,663 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:00:52,665 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-17.i [2025-03-08 12:00:54,316 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29d521b6d/191a98da7219461dabc5bdb518c5e922/FLAG39812fef6 [2025-03-08 12:00:54,541 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:00:54,543 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-17.i [2025-03-08 12:00:54,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29d521b6d/191a98da7219461dabc5bdb518c5e922/FLAG39812fef6 [2025-03-08 12:00:54,865 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29d521b6d/191a98da7219461dabc5bdb518c5e922 [2025-03-08 12:00:54,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:00:54,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:00:54,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:00:54,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:00:54,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:00:54,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:00:54" (1/1) ... [2025-03-08 12:00:54,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27439fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:54, skipping insertion in model container [2025-03-08 12:00:54,875 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:00:54" (1/1) ... [2025-03-08 12:00:54,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:00:54,999 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-17.i[919,932] [2025-03-08 12:00:55,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:00:55,069 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:00:55,078 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-17.i[919,932] [2025-03-08 12:00:55,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:00:55,125 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:00:55,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:55 WrapperNode [2025-03-08 12:00:55,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:00:55,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:00:55,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:00:55,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:00:55,132 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:00:55" (1/1) ... [2025-03-08 12:00:55,144 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:00:55" (1/1) ... [2025-03-08 12:00:55,166 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2025-03-08 12:00:55,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:00:55,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:00:55,167 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:00:55,167 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:00:55,174 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:55" (1/1) ... [2025-03-08 12:00:55,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:55" (1/1) ... [2025-03-08 12:00:55,177 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:55" (1/1) ... [2025-03-08 12:00:55,185 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:00:55,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:55" (1/1) ... [2025-03-08 12:00:55,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:55" (1/1) ... [2025-03-08 12:00:55,196 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:55" (1/1) ... [2025-03-08 12:00:55,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:55" (1/1) ... [2025-03-08 12:00:55,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:55" (1/1) ... [2025-03-08 12:00:55,198 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:55" (1/1) ... [2025-03-08 12:00:55,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:00:55,201 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:00:55,201 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:00:55,201 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:00:55,201 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:55" (1/1) ... [2025-03-08 12:00:55,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:00:55,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:00:55,228 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:00:55,230 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:00:55,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:00:55,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 12:00:55,247 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:00:55,247 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:00:55,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:00:55,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:00:55,305 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:00:55,306 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:00:56,096 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 12:00:56,097 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:00:56,105 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:00:56,106 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:00:56,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:00:56 BoogieIcfgContainer [2025-03-08 12:00:56,106 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:00:56,108 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:00:56,108 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:00:56,112 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:00:56,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:00:54" (1/3) ... [2025-03-08 12:00:56,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a9a20f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:00:56, skipping insertion in model container [2025-03-08 12:00:56,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:00:55" (2/3) ... [2025-03-08 12:00:56,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a9a20f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:00:56, skipping insertion in model container [2025-03-08 12:00:56,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:00:56" (3/3) ... [2025-03-08 12:00:56,115 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-17.i [2025-03-08 12:00:56,126 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:00:56,127 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-17.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:00:56,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:00:56,187 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;@691b96eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:00:56,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:00:56,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 12:00:56,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-08 12:00:56,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:00:56,204 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:56,205 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:00:56,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:00:56,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1204646963, now seen corresponding path program 1 times [2025-03-08 12:00:56,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:00:56,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142012479] [2025-03-08 12:00:56,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:00:56,216 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:00:56,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:00:56,219 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:00:56,220 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:00:56,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 12:00:56,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 12:00:56,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:00:56,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:00:56,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:00:56,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:00:56,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2025-03-08 12:00:56,487 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:00:56,487 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:00:56,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142012479] [2025-03-08 12:00:56,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142012479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:00:56,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:00:56,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 12:00:56,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211050175] [2025-03-08 12:00:56,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:00:56,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:00:56,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:00:56,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:00:56,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:00:56,506 INFO L87 Difference]: Start difference. First operand has 86 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 12:00:56,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:00:56,524 INFO L93 Difference]: Finished difference Result 166 states and 289 transitions. [2025-03-08 12:00:56,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:00:56,525 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2025-03-08 12:00:56,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:00:56,530 INFO L225 Difference]: With dead ends: 166 [2025-03-08 12:00:56,530 INFO L226 Difference]: Without dead ends: 83 [2025-03-08 12:00:56,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 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:00:56,534 INFO L435 NwaCegarLoop]: 129 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, 129 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:00:56,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:00:56,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-08 12:00:56,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-08 12:00:56,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 12:00:56,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 129 transitions. [2025-03-08 12:00:56,575 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 129 transitions. Word has length 171 [2025-03-08 12:00:56,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:00:56,576 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 129 transitions. [2025-03-08 12:00:56,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 12:00:56,579 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 129 transitions. [2025-03-08 12:00:56,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-08 12:00:56,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:00:56,581 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:56,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 12:00:56,782 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:00:56,782 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:00:56,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:00:56,783 INFO L85 PathProgramCache]: Analyzing trace with hash -325701911, now seen corresponding path program 1 times [2025-03-08 12:00:56,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:00:56,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303769356] [2025-03-08 12:00:56,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:00:56,783 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:00:56,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:00:56,785 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:00:56,787 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:00:56,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 12:00:56,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 12:00:56,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:00:56,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:00:56,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 12:00:57,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:00:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 12:00:57,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:00:57,407 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:00:57,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303769356] [2025-03-08 12:00:57,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303769356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:00:57,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:00:57,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:00:57,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145275039] [2025-03-08 12:00:57,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:00:57,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:00:57,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:00:57,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:00:57,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:00:57,413 INFO L87 Difference]: Start difference. First operand 83 states and 129 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 12:00:58,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:00:58,069 INFO L93 Difference]: Finished difference Result 244 states and 382 transitions. [2025-03-08 12:00:58,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:00:58,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-03-08 12:00:58,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:00:58,079 INFO L225 Difference]: With dead ends: 244 [2025-03-08 12:00:58,080 INFO L226 Difference]: Without dead ends: 164 [2025-03-08 12:00:58,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:00:58,081 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 76 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 12:00:58,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 422 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 12:00:58,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-08 12:00:58,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 132. [2025-03-08 12:00:58,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 77 states have internal predecessors, (99), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 12:00:58,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 203 transitions. [2025-03-08 12:00:58,102 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 203 transitions. Word has length 171 [2025-03-08 12:00:58,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:00:58,102 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 203 transitions. [2025-03-08 12:00:58,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 12:00:58,103 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 203 transitions. [2025-03-08 12:00:58,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-08 12:00:58,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:00:58,104 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:58,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 12:00:58,308 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:00:58,308 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:00:58,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:00:58,309 INFO L85 PathProgramCache]: Analyzing trace with hash 101809974, now seen corresponding path program 1 times [2025-03-08 12:00:58,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:00:58,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922690457] [2025-03-08 12:00:58,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:00:58,310 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:00:58,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:00:58,313 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:00:58,314 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:00:58,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-08 12:00:58,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-08 12:00:58,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:00:58,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:00:58,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 12:00:58,495 INFO L279 TraceCheckSpWp]: Computing forward predicates...