./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-37.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_loopvsstraightlinecode_100-1loop_file-37.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 756b1d01df61c24805ab157361b9ee1a24103f9269ae5b644501d5253d658808 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:57:07,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:57:07,788 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:57:07,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:57:07,794 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:57:07,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:57:07,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:57:07,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:57:07,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:57:07,810 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:57:07,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:57:07,810 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:57:07,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:57:07,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:57:07,811 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:57:07,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:57:07,811 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:57:07,812 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:57:07,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:57:07,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:57:07,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:57:07,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:57:07,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:57:07,812 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:57:07,812 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:57:07,812 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:57:07,812 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:57:07,812 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:57:07,812 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:57:07,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:57:07,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:57:07,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:57:07,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:57:07,813 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:57:07,813 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:57:07,813 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:57:07,813 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:57:07,813 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:57:07,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:57:07,814 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:57:07,814 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:57:07,814 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:57:07,814 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:57:07,814 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 -> 756b1d01df61c24805ab157361b9ee1a24103f9269ae5b644501d5253d658808 [2025-03-08 13:57:08,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:57:08,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:57:08,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:57:08,040 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:57:08,040 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:57:08,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-37.i [2025-03-08 13:57:09,172 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6081fccd3/97375198cfcc4d8992950fb3a9e5d2df/FLAG159a111fc [2025-03-08 13:57:09,388 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:57:09,388 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-37.i [2025-03-08 13:57:09,395 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6081fccd3/97375198cfcc4d8992950fb3a9e5d2df/FLAG159a111fc [2025-03-08 13:57:09,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6081fccd3/97375198cfcc4d8992950fb3a9e5d2df [2025-03-08 13:57:09,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:57:09,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:57:09,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:57:09,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:57:09,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:57:09,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:57:09" (1/1) ... [2025-03-08 13:57:09,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b315ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:09, skipping insertion in model container [2025-03-08 13:57:09,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:57:09" (1/1) ... [2025-03-08 13:57:09,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:57:09,536 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_loopvsstraightlinecode_100-1loop_file-37.i[916,929] [2025-03-08 13:57:09,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:57:09,630 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:57:09,638 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_loopvsstraightlinecode_100-1loop_file-37.i[916,929] [2025-03-08 13:57:09,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:57:09,698 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:57:09,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:09 WrapperNode [2025-03-08 13:57:09,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:57:09,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:57:09,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:57:09,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:57:09,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:09" (1/1) ... [2025-03-08 13:57:09,714 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:09" (1/1) ... [2025-03-08 13:57:09,748 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233 [2025-03-08 13:57:09,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:57:09,748 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:57:09,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:57:09,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:57:09,755 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:09" (1/1) ... [2025-03-08 13:57:09,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:09" (1/1) ... [2025-03-08 13:57:09,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:09" (1/1) ... [2025-03-08 13:57:09,778 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 13:57:09,779 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:09" (1/1) ... [2025-03-08 13:57:09,779 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:09" (1/1) ... [2025-03-08 13:57:09,785 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:09" (1/1) ... [2025-03-08 13:57:09,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:09" (1/1) ... [2025-03-08 13:57:09,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:09" (1/1) ... [2025-03-08 13:57:09,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:09" (1/1) ... [2025-03-08 13:57:09,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:57:09,795 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:57:09,796 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:57:09,796 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:57:09,796 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:09" (1/1) ... [2025-03-08 13:57:09,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:57:09,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:57:09,823 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 13:57:09,827 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 13:57:09,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:57:09,844 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:57:09,844 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:57:09,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:57:09,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:57:09,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:57:09,909 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:57:09,910 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:57:10,263 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L183: havoc property_#t~ite19#1;havoc property_#t~bitwise17#1;havoc property_#t~bitwise18#1;havoc property_#t~short20#1; [2025-03-08 13:57:10,293 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-08 13:57:10,293 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:57:10,311 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:57:10,313 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:57:10,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:57:10 BoogieIcfgContainer [2025-03-08 13:57:10,313 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:57:10,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:57:10,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:57:10,318 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:57:10,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:57:09" (1/3) ... [2025-03-08 13:57:10,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a36b0f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:57:10, skipping insertion in model container [2025-03-08 13:57:10,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:09" (2/3) ... [2025-03-08 13:57:10,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a36b0f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:57:10, skipping insertion in model container [2025-03-08 13:57:10,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:57:10" (3/3) ... [2025-03-08 13:57:10,322 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-37.i [2025-03-08 13:57:10,333 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:57:10,335 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-37.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:57:10,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:57:10,382 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;@3e816986, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:57:10,383 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:57:10,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 70 states have internal predecessors, (104), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 13:57:10,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 13:57:10,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:10,399 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:10,399 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:10,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:10,403 INFO L85 PathProgramCache]: Analyzing trace with hash 361522930, now seen corresponding path program 1 times [2025-03-08 13:57:10,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:10,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929817845] [2025-03-08 13:57:10,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:10,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:10,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 13:57:10,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 13:57:10,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:10,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:10,650 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 13:57:10,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:57:10,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929817845] [2025-03-08 13:57:10,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929817845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:57:10,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78467236] [2025-03-08 13:57:10,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:10,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:57:10,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:57:10,655 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 13:57:10,657 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 13:57:10,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 13:57:10,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 13:57:10,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:10,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:10,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:57:10,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:57:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 13:57:10,835 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:57:10,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78467236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:57:10,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:57:10,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:57:10,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401469655] [2025-03-08 13:57:10,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:57:10,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:57:10,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:57:10,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:57:10,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:57:10,857 INFO L87 Difference]: Start difference. First operand has 92 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 70 states have internal predecessors, (104), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 13:57:10,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:57:10,881 INFO L93 Difference]: Finished difference Result 181 states and 305 transitions. [2025-03-08 13:57:10,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:57:10,882 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 137 [2025-03-08 13:57:10,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:57:10,887 INFO L225 Difference]: With dead ends: 181 [2025-03-08 13:57:10,888 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 13:57:10,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 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 13:57:10,894 INFO L435 NwaCegarLoop]: 138 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, 138 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 13:57:10,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:57:10,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 13:57:10,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-08 13:57:10,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 67 states have internal predecessors, (99), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 13:57:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 139 transitions. [2025-03-08 13:57:10,931 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 139 transitions. Word has length 137 [2025-03-08 13:57:10,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:57:10,932 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 139 transitions. [2025-03-08 13:57:10,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 13:57:10,932 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 139 transitions. [2025-03-08 13:57:10,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 13:57:10,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:10,936 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:10,944 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 13:57:11,137 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 13:57:11,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:11,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:11,138 INFO L85 PathProgramCache]: Analyzing trace with hash -30673200, now seen corresponding path program 1 times [2025-03-08 13:57:11,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:11,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816069380] [2025-03-08 13:57:11,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:11,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:11,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 13:57:11,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 13:57:11,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:11,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:11,353 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 13:57:11,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:57:11,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816069380] [2025-03-08 13:57:11,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816069380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:57:11,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:57:11,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:57:11,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473429218] [2025-03-08 13:57:11,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:57:11,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:57:11,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:57:11,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:57:11,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:57:11,356 INFO L87 Difference]: Start difference. First operand 89 states and 139 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 13:57:11,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:57:11,458 INFO L93 Difference]: Finished difference Result 258 states and 405 transitions. [2025-03-08 13:57:11,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:57:11,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2025-03-08 13:57:11,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:57:11,462 INFO L225 Difference]: With dead ends: 258 [2025-03-08 13:57:11,462 INFO L226 Difference]: Without dead ends: 172 [2025-03-08 13:57:11,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:57:11,463 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 124 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:57:11,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 283 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:57:11,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-08 13:57:11,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2025-03-08 13:57:11,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 127 states have (on average 1.4409448818897639) internal successors, (183), 127 states have internal predecessors, (183), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 13:57:11,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 263 transitions. [2025-03-08 13:57:11,491 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 263 transitions. Word has length 137 [2025-03-08 13:57:11,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:57:11,492 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 263 transitions. [2025-03-08 13:57:11,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 13:57:11,493 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 263 transitions. [2025-03-08 13:57:11,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 13:57:11,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:11,494 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:11,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:57:11,495 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:11,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:11,495 INFO L85 PathProgramCache]: Analyzing trace with hash 806347879, now seen corresponding path program 1 times [2025-03-08 13:57:11,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:11,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085368788] [2025-03-08 13:57:11,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:11,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:11,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 13:57:11,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 13:57:11,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:11,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:11,900 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 13:57:11,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:57:11,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085368788] [2025-03-08 13:57:11,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085368788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:57:11,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:57:11,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 13:57:11,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922595854] [2025-03-08 13:57:11,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:57:11,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 13:57:11,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:57:11,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 13:57:11,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:57:11,906 INFO L87 Difference]: Start difference. First operand 170 states and 263 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 13:57:12,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:57:12,122 INFO L93 Difference]: Finished difference Result 394 states and 603 transitions. [2025-03-08 13:57:12,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 13:57:12,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2025-03-08 13:57:12,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:57:12,125 INFO L225 Difference]: With dead ends: 394 [2025-03-08 13:57:12,125 INFO L226 Difference]: Without dead ends: 227 [2025-03-08 13:57:12,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 13:57:12,129 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 189 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:57:12,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 701 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:57:12,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-08 13:57:12,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 222. [2025-03-08 13:57:12,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 173 states have (on average 1.4104046242774566) internal successors, (244), 174 states have internal predecessors, (244), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 13:57:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 332 transitions. [2025-03-08 13:57:12,157 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 332 transitions. Word has length 138 [2025-03-08 13:57:12,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:57:12,158 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 332 transitions. [2025-03-08 13:57:12,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 13:57:12,158 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 332 transitions. [2025-03-08 13:57:12,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 13:57:12,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:12,162 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:12,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 13:57:12,162 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:12,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:12,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1649767506, now seen corresponding path program 1 times [2025-03-08 13:57:12,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:12,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018766259] [2025-03-08 13:57:12,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:12,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:12,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 13:57:12,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 13:57:12,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:12,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:12,468 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 13:57:12,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:57:12,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018766259] [2025-03-08 13:57:12,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018766259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:57:12,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:57:12,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 13:57:12,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413705815] [2025-03-08 13:57:12,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:57:12,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 13:57:12,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:57:12,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 13:57:12,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 13:57:12,471 INFO L87 Difference]: Start difference. First operand 222 states and 332 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 13:57:12,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:57:12,815 INFO L93 Difference]: Finished difference Result 449 states and 666 transitions. [2025-03-08 13:57:12,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 13:57:12,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2025-03-08 13:57:12,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:57:12,818 INFO L225 Difference]: With dead ends: 449 [2025-03-08 13:57:12,819 INFO L226 Difference]: Without dead ends: 230 [2025-03-08 13:57:12,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 13:57:12,829 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 158 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 13:57:12,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 581 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 13:57:12,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-08 13:57:12,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 226. [2025-03-08 13:57:12,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 176 states have (on average 1.3977272727272727) internal successors, (246), 177 states have internal predecessors, (246), 44 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 13:57:12,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 334 transitions. [2025-03-08 13:57:12,855 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 334 transitions. Word has length 139 [2025-03-08 13:57:12,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:57:12,856 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 334 transitions. [2025-03-08 13:57:12,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 13:57:12,856 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 334 transitions. [2025-03-08 13:57:12,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 13:57:12,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:12,858 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:12,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 13:57:12,858 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:12,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:12,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1409236470, now seen corresponding path program 1 times [2025-03-08 13:57:12,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:12,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577774261] [2025-03-08 13:57:12,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:12,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:12,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 13:57:13,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 13:57:13,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:13,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:13,513 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 33 proven. 24 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-08 13:57:13,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:57:13,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577774261] [2025-03-08 13:57:13,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577774261] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:57:13,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103993704] [2025-03-08 13:57:13,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:13,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:57:13,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:57:13,516 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 13:57:13,518 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 13:57:13,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 13:57:13,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 13:57:13,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:13,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:13,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 13:57:13,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:57:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 393 proven. 24 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-08 13:57:13,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:57:13,975 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 33 proven. 24 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-08 13:57:13,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103993704] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:57:13,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 13:57:13,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-08 13:57:13,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663750279] [2025-03-08 13:57:13,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 13:57:13,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 13:57:13,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:57:13,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 13:57:13,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:57:13,978 INFO L87 Difference]: Start difference. First operand 226 states and 334 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 13:57:14,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:57:14,211 INFO L93 Difference]: Finished difference Result 370 states and 543 transitions. [2025-03-08 13:57:14,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 13:57:14,212 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 140 [2025-03-08 13:57:14,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:57:14,213 INFO L225 Difference]: With dead ends: 370 [2025-03-08 13:57:14,213 INFO L226 Difference]: Without dead ends: 147 [2025-03-08 13:57:14,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 277 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-03-08 13:57:14,214 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 245 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:57:14,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 233 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:57:14,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-08 13:57:14,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 127. [2025-03-08 13:57:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 98 states have (on average 1.316326530612245) internal successors, (129), 99 states have internal predecessors, (129), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 13:57:14,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 177 transitions. [2025-03-08 13:57:14,226 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 177 transitions. Word has length 140 [2025-03-08 13:57:14,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:57:14,227 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 177 transitions. [2025-03-08 13:57:14,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 13:57:14,227 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 177 transitions. [2025-03-08 13:57:14,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 13:57:14,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:14,229 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:14,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 13:57:14,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:57:14,433 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:14,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:14,433 INFO L85 PathProgramCache]: Analyzing trace with hash -475044386, now seen corresponding path program 1 times [2025-03-08 13:57:14,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:14,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364895246] [2025-03-08 13:57:14,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:14,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:14,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 13:57:14,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 13:57:14,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:14,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 13:57:14,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [409750614] [2025-03-08 13:57:14,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:14,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:57:14,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:57:14,586 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 13:57:14,588 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 13:57:14,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 13:57:14,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 13:57:14,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:14,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:14,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 13:57:14,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:57:15,957 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 404 proven. 78 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2025-03-08 13:57:15,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:57:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 81 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-03-08 13:57:17,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:57:17,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364895246] [2025-03-08 13:57:17,733 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 13:57:17,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409750614] [2025-03-08 13:57:17,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409750614] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:57:17,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 13:57:17,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 30 [2025-03-08 13:57:17,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937390185] [2025-03-08 13:57:17,733 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 13:57:17,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 13:57:17,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:57:17,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 13:57:17,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2025-03-08 13:57:17,736 INFO L87 Difference]: Start difference. First operand 127 states and 177 transitions. Second operand has 30 states, 29 states have (on average 3.310344827586207) internal successors, (96), 30 states have internal predecessors, (96), 10 states have call successors, (40), 6 states have call predecessors, (40), 9 states have return successors, (40), 8 states have call predecessors, (40), 10 states have call successors, (40) [2025-03-08 13:57:24,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:57:24,287 INFO L93 Difference]: Finished difference Result 755 states and 1028 transitions. [2025-03-08 13:57:24,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-08 13:57:24,288 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.310344827586207) internal successors, (96), 30 states have internal predecessors, (96), 10 states have call successors, (40), 6 states have call predecessors, (40), 9 states have return successors, (40), 8 states have call predecessors, (40), 10 states have call successors, (40) Word has length 141 [2025-03-08 13:57:24,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:57:24,291 INFO L225 Difference]: With dead ends: 755 [2025-03-08 13:57:24,291 INFO L226 Difference]: Without dead ends: 631 [2025-03-08 13:57:24,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2294 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1672, Invalid=4970, Unknown=0, NotChecked=0, Total=6642 [2025-03-08 13:57:24,294 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 2099 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 1899 mSolverCounterSat, 453 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2102 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 2352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 453 IncrementalHoareTripleChecker+Valid, 1899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 13:57:24,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2102 Valid, 972 Invalid, 2352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [453 Valid, 1899 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 13:57:24,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-03-08 13:57:24,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 391. [2025-03-08 13:57:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 307 states have (on average 1.3029315960912051) internal successors, (400), 309 states have internal predecessors, (400), 66 states have call successors, (66), 17 states have call predecessors, (66), 17 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 13:57:24,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 532 transitions. [2025-03-08 13:57:24,344 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 532 transitions. Word has length 141 [2025-03-08 13:57:24,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:57:24,344 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 532 transitions. [2025-03-08 13:57:24,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.310344827586207) internal successors, (96), 30 states have internal predecessors, (96), 10 states have call successors, (40), 6 states have call predecessors, (40), 9 states have return successors, (40), 8 states have call predecessors, (40), 10 states have call successors, (40) [2025-03-08 13:57:24,344 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 532 transitions. [2025-03-08 13:57:24,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 13:57:24,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:24,346 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:24,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 13:57:24,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:57:24,548 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:24,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:24,548 INFO L85 PathProgramCache]: Analyzing trace with hash -980603011, now seen corresponding path program 1 times [2025-03-08 13:57:24,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:24,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852025952] [2025-03-08 13:57:24,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:24,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:24,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 13:57:24,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 13:57:24,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:24,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 13:57:24,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2066495462] [2025-03-08 13:57:24,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:24,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:57:24,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:57:24,747 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:57:24,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 13:57:24,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 13:57:24,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 13:57:24,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:24,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:24,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 13:57:24,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:57:25,668 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 500 proven. 87 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-03-08 13:57:25,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:57:32,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:57:32,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852025952] [2025-03-08 13:57:32,852 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 13:57:32,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066495462] [2025-03-08 13:57:32,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066495462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:57:32,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:57:32,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2025-03-08 13:57:32,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743897465] [2025-03-08 13:57:32,852 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 13:57:32,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 13:57:32,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:57:32,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 13:57:32,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=340, Unknown=1, NotChecked=0, Total=420 [2025-03-08 13:57:32,853 INFO L87 Difference]: Start difference. First operand 391 states and 532 transitions. Second operand has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 4 states have call successors, (20), 4 states have call predecessors, (20), 7 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-08 13:57:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:57:34,073 INFO L93 Difference]: Finished difference Result 674 states and 908 transitions. [2025-03-08 13:57:34,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 13:57:34,075 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 4 states have call successors, (20), 4 states have call predecessors, (20), 7 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 141 [2025-03-08 13:57:34,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:57:34,078 INFO L225 Difference]: With dead ends: 674 [2025-03-08 13:57:34,079 INFO L226 Difference]: Without dead ends: 424 [2025-03-08 13:57:34,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=303, Invalid=1102, Unknown=1, NotChecked=0, Total=1406 [2025-03-08 13:57:34,080 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 317 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 13:57:34,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 834 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 13:57:34,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-03-08 13:57:34,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 399. [2025-03-08 13:57:34,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 313 states have (on average 1.293929712460064) internal successors, (405), 315 states have internal predecessors, (405), 66 states have call successors, (66), 19 states have call predecessors, (66), 19 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 13:57:34,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 537 transitions. [2025-03-08 13:57:34,138 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 537 transitions. Word has length 141 [2025-03-08 13:57:34,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:57:34,138 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 537 transitions. [2025-03-08 13:57:34,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 4 states have call successors, (20), 4 states have call predecessors, (20), 7 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-08 13:57:34,138 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 537 transitions. [2025-03-08 13:57:34,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 13:57:34,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:34,139 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:34,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 13:57:34,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:57:34,344 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:34,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:34,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1742713567, now seen corresponding path program 1 times [2025-03-08 13:57:34,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:34,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675873388] [2025-03-08 13:57:34,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:34,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:34,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 13:57:34,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 13:57:34,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:34,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 13:57:34,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [925991434] [2025-03-08 13:57:34,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:34,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:57:34,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:57:34,456 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:57:34,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 13:57:34,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 13:57:34,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 13:57:34,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:34,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:34,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 13:57:34,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:57:36,342 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 522 proven. 114 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-08 13:57:36,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:57:52,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:57:52,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675873388] [2025-03-08 13:57:52,592 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 13:57:52,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925991434] [2025-03-08 13:57:52,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925991434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:57:52,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:57:52,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2025-03-08 13:57:52,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890614773] [2025-03-08 13:57:52,592 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 13:57:52,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 13:57:52,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:57:52,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 13:57:52,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=654, Unknown=3, NotChecked=0, Total=812 [2025-03-08 13:57:52,594 INFO L87 Difference]: Start difference. First operand 399 states and 537 transitions. Second operand has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 21 states have internal predecessors, (68), 7 states have call successors, (20), 7 states have call predecessors, (20), 9 states have return successors, (20), 6 states have call predecessors, (20), 7 states have call successors, (20) [2025-03-08 13:57:55,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:57:55,118 INFO L93 Difference]: Finished difference Result 771 states and 1022 transitions. [2025-03-08 13:57:55,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 13:57:55,119 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 21 states have internal predecessors, (68), 7 states have call successors, (20), 7 states have call predecessors, (20), 9 states have return successors, (20), 6 states have call predecessors, (20), 7 states have call successors, (20) Word has length 141 [2025-03-08 13:57:55,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:57:55,124 INFO L225 Difference]: With dead ends: 771 [2025-03-08 13:57:55,125 INFO L226 Difference]: Without dead ends: 605 [2025-03-08 13:57:55,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=618, Invalid=2349, Unknown=3, NotChecked=0, Total=2970 [2025-03-08 13:57:55,127 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 721 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:57:55,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 706 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 13:57:55,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-08 13:57:55,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 420. [2025-03-08 13:57:55,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 330 states have (on average 1.293939393939394) internal successors, (427), 332 states have internal predecessors, (427), 68 states have call successors, (68), 21 states have call predecessors, (68), 21 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 13:57:55,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 563 transitions. [2025-03-08 13:57:55,200 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 563 transitions. Word has length 141 [2025-03-08 13:57:55,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:57:55,200 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 563 transitions. [2025-03-08 13:57:55,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 21 states have internal predecessors, (68), 7 states have call successors, (20), 7 states have call predecessors, (20), 9 states have return successors, (20), 6 states have call predecessors, (20), 7 states have call successors, (20) [2025-03-08 13:57:55,200 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 563 transitions. [2025-03-08 13:57:55,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 13:57:55,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:55,201 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:55,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 13:57:55,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:57:55,407 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:55,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:55,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1237154942, now seen corresponding path program 1 times [2025-03-08 13:57:55,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:55,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680701512] [2025-03-08 13:57:55,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:55,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:55,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 13:57:55,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 13:57:55,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:55,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 13:57:55,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1647719304] [2025-03-08 13:57:55,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:55,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:57:55,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:57:55,609 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:57:55,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 13:57:55,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 13:57:55,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 13:57:55,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:55,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:55,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 13:57:55,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:57:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 502 proven. 114 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 13:57:56,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:58:04,073 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~last_1_var_1_10~0 65536))) (let ((.cse2 (div c_~var_1_5~0 c_~var_1_4~0)) (.cse0 (+ .cse3 1))) (let ((.cse4 (= (mod c_~var_1_5~0 c_~var_1_4~0) 0)) (.cse5 (< .cse2 .cse0)) (.cse1 (< 0 (+ c_~var_1_5~0 1)))) (and (forall ((~var_1_23~0 Int)) (or (< (div c_~var_1_5~0 ~var_1_23~0) .cse0) (not (= (mod c_~var_1_5~0 ~var_1_23~0) 0)) (< c_~var_1_4~0 ~var_1_23~0) (= ~var_1_23~0 0))) (or .cse1 (and (or (< c_~var_1_4~0 0) (< .cse2 .cse3)) (<= .cse2 .cse0)) .cse4) (or (not .cse4) .cse5) (or (< c_~var_1_5~0 0) .cse5) (or (forall ((~var_1_23~0 Int)) (or (< c_~var_1_4~0 ~var_1_23~0) (= ~var_1_23~0 0) (= (mod c_~var_1_5~0 ~var_1_23~0) 0) (< (div c_~var_1_5~0 ~var_1_23~0) (+ 2 .cse3)))) .cse1) (forall ((~var_1_23~0 Int)) (or (< (div c_~var_1_5~0 ~var_1_23~0) .cse0) (< c_~var_1_4~0 ~var_1_23~0) (= ~var_1_23~0 0) (< ~var_1_23~0 0))))))) is different from false [2025-03-08 13:58:04,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:58:04,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680701512] [2025-03-08 13:58:04,093 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 13:58:04,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647719304] [2025-03-08 13:58:04,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647719304] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:58:04,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:58:04,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2025-03-08 13:58:04,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033192861] [2025-03-08 13:58:04,093 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 13:58:04,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 13:58:04,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:58:04,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 13:58:04,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=264, Unknown=1, NotChecked=34, Total=380 [2025-03-08 13:58:04,094 INFO L87 Difference]: Start difference. First operand 420 states and 563 transitions. Second operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 15 states have internal predecessors, (65), 5 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-08 13:58:05,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:58:05,187 INFO L93 Difference]: Finished difference Result 591 states and 794 transitions. [2025-03-08 13:58:05,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 13:58:05,187 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 15 states have internal predecessors, (65), 5 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 141 [2025-03-08 13:58:05,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:58:05,189 INFO L225 Difference]: With dead ends: 591 [2025-03-08 13:58:05,189 INFO L226 Difference]: Without dead ends: 411 [2025-03-08 13:58:05,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=310, Invalid=953, Unknown=1, NotChecked=68, Total=1332 [2025-03-08 13:58:05,190 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 166 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 13:58:05,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 677 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 13:58:05,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-03-08 13:58:05,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 400. [2025-03-08 13:58:05,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 310 states have (on average 1.2806451612903227) internal successors, (397), 312 states have internal predecessors, (397), 68 states have call successors, (68), 21 states have call predecessors, (68), 21 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 13:58:05,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 533 transitions. [2025-03-08 13:58:05,242 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 533 transitions. Word has length 141 [2025-03-08 13:58:05,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:58:05,243 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 533 transitions. [2025-03-08 13:58:05,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 15 states have internal predecessors, (65), 5 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-08 13:58:05,243 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 533 transitions. [2025-03-08 13:58:05,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 13:58:05,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:58:05,244 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:58:05,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 13:58:05,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:58:05,444 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:58:05,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:58:05,445 INFO L85 PathProgramCache]: Analyzing trace with hash 156637126, now seen corresponding path program 1 times [2025-03-08 13:58:05,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:58:05,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530333900] [2025-03-08 13:58:05,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:58:05,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:58:05,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 13:58:05,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 13:58:05,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:58:05,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 13:58:05,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1665130811] [2025-03-08 13:58:05,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:58:05,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:58:05,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:58:05,643 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:58:05,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 13:58:05,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 13:58:05,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 13:58:05,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:58:05,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:58:05,761 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:58:05,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 13:58:05,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 13:58:05,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:58:05,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:58:05,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:58:05,875 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:58:05,877 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:58:05,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 13:58:06,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:58:06,081 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:58:06,169 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:58:06,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:58:06 BoogieIcfgContainer [2025-03-08 13:58:06,176 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:58:06,176 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:58:06,176 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:58:06,176 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:58:06,177 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:57:10" (3/4) ... [2025-03-08 13:58:06,178 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:58:06,179 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:58:06,180 INFO L158 Benchmark]: Toolchain (without parser) took 56770.09ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 111.8MB in the beginning and 98.5MB in the end (delta: 13.3MB). Peak memory consumption was 144.5MB. Max. memory is 16.1GB. [2025-03-08 13:58:06,180 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:58:06,180 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.65ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 95.0MB in the end (delta: 16.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:58:06,180 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.76ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 91.5MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:58:06,181 INFO L158 Benchmark]: Boogie Preprocessor took 42.79ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 86.1MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:58:06,181 INFO L158 Benchmark]: IcfgBuilder took 517.85ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 55.6MB in the end (delta: 30.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 13:58:06,181 INFO L158 Benchmark]: TraceAbstraction took 55860.33ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 54.7MB in the beginning and 100.9MB in the end (delta: -46.2MB). Peak memory consumption was 85.7MB. Max. memory is 16.1GB. [2025-03-08 13:58:06,181 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 268.4MB. Free memory was 100.9MB in the beginning and 98.5MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:58:06,184 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.65ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 95.0MB in the end (delta: 16.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.76ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 91.5MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.79ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 86.1MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 517.85ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 55.6MB in the end (delta: 30.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 55860.33ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 54.7MB in the beginning and 100.9MB in the end (delta: -46.2MB). Peak memory consumption was 85.7MB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 268.4MB. Free memory was 100.9MB in the beginning and 98.5MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 157, overapproximation of someBinaryFLOATComparisonOperation at line 155, overapproximation of someBinaryFLOATComparisonOperation at line 123, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 183, overapproximation of someBinaryFLOATComparisonOperation at line 153, overapproximation of someBinaryDOUBLEComparisonOperation at line 128, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 183, overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryArithmeticFLOAToperation at line 75, overapproximation of someUnaryFLOAToperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 2; [L23] unsigned char var_1_2 = 0; [L24] signed char var_1_3 = 10; [L25] signed char var_1_4 = 64; [L26] signed char var_1_5 = 5; [L27] double var_1_7 = 4.175; [L28] unsigned char var_1_9 = 100; [L29] unsigned short int var_1_10 = 128; [L30] float var_1_11 = 10.6; [L31] float var_1_12 = 16.25; [L32] float var_1_13 = 0.0; [L33] float var_1_14 = 127.2; [L34] double var_1_15 = 0.75; [L35] unsigned char var_1_18 = 1; [L36] unsigned char var_1_19 = 1; [L37] signed char var_1_20 = 1; [L38] signed short int var_1_21 = -1; [L39] unsigned long int var_1_22 = 1000000000; [L40] signed long int var_1_23 = -50; [L41] unsigned long int var_1_24 = 3900988395; [L42] unsigned long int var_1_25 = 2230016845; [L43] unsigned long int var_1_26 = 256; [L44] unsigned long int var_1_27 = 4; [L45] signed char var_1_29 = 8; [L46] signed long int last_1_var_1_1 = 2; [L47] unsigned char last_1_var_1_9 = 100; [L48] unsigned short int last_1_var_1_10 = 128; [L49] double last_1_var_1_15 = 0.75; [L50] signed short int last_1_var_1_21 = -1; [L51] unsigned long int last_1_var_1_22 = 1000000000; [L52] unsigned long int last_1_var_1_27 = 4; [L53] signed char last_1_var_1_29 = 8; VAL [isInitial=0, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=0, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L187] isInitial = 1 [L188] FCALL initially() [L189] int k_loop; [L190] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=0, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L190] COND TRUE k_loop < 1 [L191] CALL updateLastVariables() [L173] last_1_var_1_1 = var_1_1 [L174] last_1_var_1_9 = var_1_9 [L175] last_1_var_1_10 = var_1_10 [L176] last_1_var_1_15 = var_1_15 [L177] last_1_var_1_21 = var_1_21 [L178] last_1_var_1_22 = var_1_22 [L179] last_1_var_1_27 = var_1_27 [L180] last_1_var_1_29 = var_1_29 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=0, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L191] RET updateLastVariables() [L192] 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_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L142] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L142] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L143] var_1_3 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_3 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L144] RET assume_abort_if_not(var_1_3 >= -1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L145] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L145] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L146] var_1_4 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_4 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=5, var_1_7=167/40, var_1_9=100] [L147] RET assume_abort_if_not(var_1_4 >= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=5, var_1_7=167/40, var_1_9=100] [L148] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=5, var_1_7=167/40, var_1_9=100] [L148] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=5, var_1_7=167/40, var_1_9=100] [L149] var_1_5 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L150] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L151] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L151] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L152] var_1_12 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_12 >= 0.0F && 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_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L153] RET assume_abort_if_not((var_1_12 >= 0.0F && 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_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L154] var_1_13 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_13 >= 6917529.027641073700e+12F && 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_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L155] RET assume_abort_if_not((var_1_13 >= 6917529.027641073700e+12F && 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_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L156] var_1_14 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L157] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L158] var_1_19 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_19 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L159] RET assume_abort_if_not(var_1_19 >= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L160] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L160] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L161] var_1_23 = __VERIFIER_nondet_long() [L162] CALL assume_abort_if_not(var_1_23 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L162] RET assume_abort_if_not(var_1_23 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L163] CALL assume_abort_if_not(var_1_23 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L163] RET assume_abort_if_not(var_1_23 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L164] CALL assume_abort_if_not(var_1_23 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L164] RET assume_abort_if_not(var_1_23 != 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L165] var_1_24 = __VERIFIER_nondet_ulong() [L166] CALL assume_abort_if_not(var_1_24 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L166] RET assume_abort_if_not(var_1_24 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L167] CALL assume_abort_if_not(var_1_24 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L167] RET assume_abort_if_not(var_1_24 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L168] var_1_25 = __VERIFIER_nondet_ulong() [L169] CALL assume_abort_if_not(var_1_25 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L169] RET assume_abort_if_not(var_1_25 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L170] CALL assume_abort_if_not(var_1_25 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L170] RET assume_abort_if_not(var_1_25 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L192] RET updateVariables() [L193] CALL step() [L57] signed long int stepLocal_3 = last_1_var_1_1 * last_1_var_1_29; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_3=16, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L58] COND TRUE var_1_5 == stepLocal_3 [L59] var_1_21 = ((var_1_4 - last_1_var_1_1) + ((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22)))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-13699, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L63] signed long int stepLocal_4 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_4=128, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-13699, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L64] COND TRUE (var_1_5 / ((((var_1_4) < (var_1_23)) ? (var_1_4) : (var_1_23)))) <= stepLocal_4 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-13699, var_1_22=1000000000, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L65] COND TRUE \read(var_1_19) [L66] var_1_22 = (var_1_24 - (last_1_var_1_9 + var_1_4)) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L71] COND TRUE last_1_var_1_15 < (- var_1_14) [L72] var_1_18 = (var_1_2 || var_1_19) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L74] var_1_10 = ((((var_1_5) < (var_1_4)) ? (var_1_5) : (var_1_4))) [L75] var_1_11 = (var_1_12 - ((((var_1_14) < (var_1_13)) ? (var_1_14) : (var_1_13)))) [L76] var_1_20 = var_1_5 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=100] [L77] COND TRUE var_1_21 != 10 [L78] var_1_9 = ((((var_1_4) > (2)) ? (var_1_4) : (2))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L90] signed short int stepLocal_2 = var_1_21; [L91] unsigned long int stepLocal_1 = var_1_22; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483876, stepLocal_2=-13699, var_1_10=16, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L92] COND FALSE !((var_1_9 * (var_1_4 * var_1_5)) < stepLocal_2) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483876, var_1_10=16, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L99] COND TRUE \read(var_1_18) [L100] var_1_15 = ((((((((var_1_14) > (var_1_12)) ? (var_1_14) : (var_1_12)))) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? (((((var_1_14) > (var_1_12)) ? (var_1_14) : (var_1_12)))) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483876, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L112] signed long int stepLocal_0 = 500 * var_1_10; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_0=8000, stepLocal_1=-2147483876, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L113] COND TRUE \read(var_1_18) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_0=8000, stepLocal_1=-2147483876, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L114] COND FALSE !((var_1_3 - (var_1_4 - var_1_5)) >= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483876, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L120] COND TRUE var_1_18 && var_1_19 [L121] var_1_27 = ((((var_1_5) < (((var_1_4 + var_1_1) + var_1_1))) ? (var_1_5) : (((var_1_4 + var_1_1) + var_1_1)))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483876, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=256, var_1_27=16, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L123] COND TRUE (var_1_13 - var_1_14) <= var_1_12 [L124] var_1_26 = (var_1_25 - var_1_27) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483876, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=6442450927, var_1_27=16, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L128] unsigned char stepLocal_5 = var_1_13 < var_1_15; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483876, stepLocal_5=1, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=6442450927, var_1_27=16, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L129] COND TRUE var_1_18 || stepLocal_5 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483876, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=6442450927, var_1_27=16, var_1_29=8, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L130] COND TRUE (((((var_1_7 / var_1_13)) > (99.6f)) ? ((var_1_7 / var_1_13)) : (99.6f))) != var_1_15 [L131] var_1_29 = (var_1_5 - 10) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=-2147483876, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=6442450927, var_1_27=16, var_1_29=6, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L193] RET step() [L194] CALL, EXPR property() [L183] EXPR (var_1_18 ? (((var_1_3 - (var_1_4 - var_1_5)) >= (500 * var_1_10)) ? (var_1_1 == ((signed long int) var_1_4)) : 1) : (var_1_1 == ((signed long int) var_1_4))) && (((var_1_9 * (var_1_4 * var_1_5)) < var_1_21) ? ((var_1_22 != (var_1_5 | (var_1_9 ^ var_1_4))) ? (var_1_18 ? (var_1_7 == ((double) 8.5)) : 1) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=6442450927, var_1_27=16, var_1_29=6, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L183] EXPR ((var_1_9 * (var_1_4 * var_1_5)) < var_1_21) ? ((var_1_22 != (var_1_5 | (var_1_9 ^ var_1_4))) ? (var_1_18 ? (var_1_7 == ((double) 8.5)) : 1) : 1) : 1 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=6442450927, var_1_27=16, var_1_29=6, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L183] EXPR (var_1_18 ? (((var_1_3 - (var_1_4 - var_1_5)) >= (500 * var_1_10)) ? (var_1_1 == ((signed long int) var_1_4)) : 1) : (var_1_1 == ((signed long int) var_1_4))) && (((var_1_9 * (var_1_4 * var_1_5)) < var_1_21) ? ((var_1_22 != (var_1_5 | (var_1_9 ^ var_1_4))) ? (var_1_18 ? (var_1_7 == ((double) 8.5)) : 1) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=6442450927, var_1_27=16, var_1_29=6, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L183-L184] return ((((((((((((var_1_18 ? (((var_1_3 - (var_1_4 - var_1_5)) >= (500 * var_1_10)) ? (var_1_1 == ((signed long int) var_1_4)) : 1) : (var_1_1 == ((signed long int) var_1_4))) && (((var_1_9 * (var_1_4 * var_1_5)) < var_1_21) ? ((var_1_22 != (var_1_5 | (var_1_9 ^ var_1_4))) ? (var_1_18 ? (var_1_7 == ((double) 8.5)) : 1) : 1) : 1)) && ((var_1_21 != 10) ? (var_1_9 == ((unsigned char) ((((var_1_4) > (2)) ? (var_1_4) : (2))))) : ((var_1_22 > (var_1_21 / 128)) ? (var_1_18 ? (var_1_9 == ((unsigned char) var_1_4)) : (var_1_9 == ((unsigned char) var_1_5))) : (var_1_9 == ((unsigned char) var_1_4))))) && (var_1_10 == ((unsigned short int) ((((var_1_5) < (var_1_4)) ? (var_1_5) : (var_1_4)))))) && (var_1_11 == ((float) (var_1_12 - ((((var_1_14) < (var_1_13)) ? (var_1_14) : (var_1_13))))))) && (var_1_18 ? (var_1_15 == ((double) ((((((((var_1_14) > (var_1_12)) ? (var_1_14) : (var_1_12)))) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? (((((var_1_14) > (var_1_12)) ? (var_1_14) : (var_1_12)))) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : ((var_1_22 < var_1_4) ? ((var_1_18 || var_1_18) ? (var_1_15 == ((double) var_1_14)) : (var_1_15 == ((double) var_1_14))) : (var_1_15 == ((double) var_1_13))))) && ((last_1_var_1_15 < (- var_1_14)) ? (var_1_18 == ((unsigned char) (var_1_2 || var_1_19))) : 1)) && (var_1_20 == ((signed char) var_1_5))) && ((var_1_5 == (last_1_var_1_1 * last_1_var_1_29)) ? (var_1_21 == ((signed short int) ((var_1_4 - last_1_var_1_1) + ((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22)))))) : (var_1_21 == ((signed short int) ((((last_1_var_1_21) > (var_1_4)) ? (last_1_var_1_21) : (var_1_4))))))) && (((var_1_5 / ((((var_1_4) < (var_1_23)) ? (var_1_4) : (var_1_23)))) <= last_1_var_1_10) ? (var_1_19 ? (var_1_22 == ((unsigned long int) (var_1_24 - (last_1_var_1_9 + var_1_4)))) : (var_1_22 == ((unsigned long int) (((((((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))) - (last_1_var_1_9 + last_1_var_1_27))) < (((((last_1_var_1_10) > (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) ? (last_1_var_1_10) : (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))))))) ? ((((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))) - (last_1_var_1_9 + last_1_var_1_27))) : (((((last_1_var_1_10) > (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) ? (last_1_var_1_10) : (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))))))))))) : 1)) && (((var_1_13 - var_1_14) <= var_1_12) ? (var_1_26 == ((unsigned long int) (var_1_25 - var_1_27))) : (var_1_26 == ((unsigned long int) ((((var_1_27 + ((((var_1_9) > (var_1_5)) ? (var_1_9) : (var_1_5)))) < 0 ) ? -(var_1_27 + ((((var_1_9) > (var_1_5)) ? (var_1_9) : (var_1_5)))) : (var_1_27 + ((((var_1_9) > (var_1_5)) ? (var_1_9) : (var_1_5)))))))))) && ((var_1_18 && var_1_19) ? (var_1_27 == ((unsigned long int) ((((var_1_5) < (((var_1_4 + var_1_1) + var_1_1))) ? (var_1_5) : (((var_1_4 + var_1_1) + var_1_1)))))) : 1)) && ((var_1_18 || (var_1_13 < var_1_15)) ? (((((((var_1_7 / var_1_13)) > (99.6f)) ? ((var_1_7 / var_1_13)) : (99.6f))) != var_1_15) ? (var_1_29 == ((signed char) (var_1_5 - 10))) : (var_1_29 == ((signed char) var_1_5))) : (var_1_29 == ((signed char) var_1_5))) ; [L194] RET, EXPR property() [L194] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=6442450927, var_1_27=16, var_1_29=6, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13699, var_1_22=-2147483876, var_1_23=17, var_1_24=-2147483649, var_1_25=6442450943, var_1_26=6442450927, var_1_27=16, var_1_29=6, var_1_2=1, var_1_3=-1, var_1_4=127, var_1_5=16, var_1_7=167/40, var_1_9=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 164 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 55.7s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4023 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4019 mSDsluCounter, 5125 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4029 mSDsCounter, 869 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5215 IncrementalHoareTripleChecker+Invalid, 6084 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 869 mSolverCounterUnsat, 1096 mSDtfsCounter, 5215 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1419 GetRequests, 1188 SyntacticMatches, 1 SemanticMatches, 230 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3562 ImplicationChecksByTransitivity, 30.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=420occurred in iteration=8, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 492 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 38.9s InterpolantComputationTime, 2380 NumberOfCodeBlocks, 2380 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1800 ConstructedInterpolants, 9 QuantifiedInterpolants, 11391 SizeOfPredicates, 36 NumberOfNonLiveVariables, 2201 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 9296/9880 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 13:58:06,395 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-03-08 13:58:06,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 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_loopvsstraightlinecode_100-1loop_file-37.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 756b1d01df61c24805ab157361b9ee1a24103f9269ae5b644501d5253d658808 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:58:08,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:58:08,118 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:58:08,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:58:08,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:58:08,144 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:58:08,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:58:08,145 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:58:08,145 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:58:08,145 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:58:08,145 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:58:08,145 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:58:08,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:58:08,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:58:08,146 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:58:08,146 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:58:08,146 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:58:08,146 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:58:08,146 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:58:08,146 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:58:08,146 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:58:08,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:58:08,146 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:58:08,146 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:58:08,146 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:58:08,146 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:58:08,146 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:58:08,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:58:08,146 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:58:08,146 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:58:08,146 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:58:08,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:58:08,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:58:08,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:58:08,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:58:08,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:58:08,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:58:08,147 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:58:08,147 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:58:08,147 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:58:08,147 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:58:08,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:58:08,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:58:08,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:58:08,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:58:08,147 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 -> 756b1d01df61c24805ab157361b9ee1a24103f9269ae5b644501d5253d658808 [2025-03-08 13:58:08,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:58:08,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:58:08,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:58:08,416 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:58:08,416 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:58:08,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-37.i [2025-03-08 13:58:09,612 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfbf0982e/ae82fc74b1304f75824071634efd370d/FLAGb21d7be70 [2025-03-08 13:58:09,832 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:58:09,833 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-37.i [2025-03-08 13:58:09,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfbf0982e/ae82fc74b1304f75824071634efd370d/FLAGb21d7be70 [2025-03-08 13:58:10,180 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfbf0982e/ae82fc74b1304f75824071634efd370d [2025-03-08 13:58:10,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:58:10,184 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:58:10,185 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:58:10,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:58:10,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:58:10,190 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:58:10" (1/1) ... [2025-03-08 13:58:10,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f3dc542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:10, skipping insertion in model container [2025-03-08 13:58:10,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:58:10" (1/1) ... [2025-03-08 13:58:10,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:58:10,317 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_loopvsstraightlinecode_100-1loop_file-37.i[916,929] [2025-03-08 13:58:10,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:58:10,394 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:58:10,401 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_loopvsstraightlinecode_100-1loop_file-37.i[916,929] [2025-03-08 13:58:10,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:58:10,463 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:58:10,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:10 WrapperNode [2025-03-08 13:58:10,464 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:58:10,465 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:58:10,465 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:58:10,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:58:10,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:10" (1/1) ... [2025-03-08 13:58:10,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:10" (1/1) ... [2025-03-08 13:58:10,512 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2025-03-08 13:58:10,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:58:10,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:58:10,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:58:10,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:58:10,523 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:10" (1/1) ... [2025-03-08 13:58:10,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:10" (1/1) ... [2025-03-08 13:58:10,526 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:10" (1/1) ... [2025-03-08 13:58:10,537 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 13:58:10,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:10" (1/1) ... [2025-03-08 13:58:10,537 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:10" (1/1) ... [2025-03-08 13:58:10,549 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:10" (1/1) ... [2025-03-08 13:58:10,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:10" (1/1) ... [2025-03-08 13:58:10,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:10" (1/1) ... [2025-03-08 13:58:10,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:10" (1/1) ... [2025-03-08 13:58:10,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:58:10,560 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:58:10,560 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:58:10,560 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:58:10,566 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:10" (1/1) ... [2025-03-08 13:58:10,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:58:10,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:58:10,595 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 13:58:10,598 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 13:58:10,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:58:10,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:58:10,615 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:58:10,615 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:58:10,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:58:10,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:58:10,684 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:58:10,686 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:58:24,908 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-08 13:58:24,908 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:58:24,917 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:58:24,917 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:58:24,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:58:24 BoogieIcfgContainer [2025-03-08 13:58:24,917 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:58:24,919 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:58:24,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:58:24,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:58:24,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:58:10" (1/3) ... [2025-03-08 13:58:24,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0b1ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:58:24, skipping insertion in model container [2025-03-08 13:58:24,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:58:10" (2/3) ... [2025-03-08 13:58:24,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0b1ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:58:24, skipping insertion in model container [2025-03-08 13:58:24,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:58:24" (3/3) ... [2025-03-08 13:58:24,924 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-37.i [2025-03-08 13:58:24,933 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:58:24,934 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-37.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:58:24,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:58:24,980 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;@124fdd55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:58:24,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:58:24,983 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 13:58:24,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 13:58:24,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:58:24,991 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:58:24,991 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:58:24,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:58:24,995 INFO L85 PathProgramCache]: Analyzing trace with hash 476994014, now seen corresponding path program 1 times [2025-03-08 13:58:25,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:58:25,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064737045] [2025-03-08 13:58:25,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:58:25,018 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 13:58:25,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:58:25,021 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 13:58:25,022 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 13:58:25,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 13:58:25,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 13:58:25,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:58:25,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:58:25,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:58:25,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:58:25,915 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2025-03-08 13:58:25,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:58:25,916 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:58:25,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064737045] [2025-03-08 13:58:25,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064737045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:58:25,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:58:25,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:58:25,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455034559] [2025-03-08 13:58:25,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:58:25,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:58:25,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:58:25,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:58:25,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:58:25,935 INFO L87 Difference]: Start difference. First operand has 73 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 13:58:25,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:58:25,950 INFO L93 Difference]: Finished difference Result 143 states and 243 transitions. [2025-03-08 13:58:25,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:58:25,952 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 135 [2025-03-08 13:58:25,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:58:25,958 INFO L225 Difference]: With dead ends: 143 [2025-03-08 13:58:25,958 INFO L226 Difference]: Without dead ends: 70 [2025-03-08 13:58:25,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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 13:58:25,964 INFO L435 NwaCegarLoop]: 111 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, 111 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 13:58:25,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:58:25,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-08 13:58:25,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-08 13:58:25,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 13:58:25,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 108 transitions. [2025-03-08 13:58:25,991 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 108 transitions. Word has length 135 [2025-03-08 13:58:25,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:58:25,991 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 108 transitions. [2025-03-08 13:58:25,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 13:58:25,992 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 108 transitions. [2025-03-08 13:58:25,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 13:58:25,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:58:25,996 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:58:26,023 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 13:58:26,197 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 13:58:26,197 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:58:26,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:58:26,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1530115780, now seen corresponding path program 1 times [2025-03-08 13:58:26,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:58:26,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358559169] [2025-03-08 13:58:26,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:58:26,199 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 13:58:26,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:58:26,201 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 13:58:26,202 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 13:58:26,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 13:58:27,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 13:58:27,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:58:27,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:58:27,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 13:58:27,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:58:36,543 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 399 proven. 27 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-03-08 13:58:36,544 INFO L312 TraceCheckSpWp]: Computing backward predicates...