./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-12.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 86a1ef4c3b49651577789848313528c73796bc9c822bd00ff46ecebbbdb382d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:01:10,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:01:10,516 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:01:10,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:01:10,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:01:10,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:01:10,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:01:10,539 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:01:10,539 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:01:10,539 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:01:10,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:01:10,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:01:10,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:01:10,540 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:01:10,540 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:01:10,540 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:01:10,540 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:01:10,540 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:01:10,540 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:01:10,540 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:01:10,541 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:01:10,541 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:01:10,541 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:01:10,541 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:01:10,541 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:01:10,541 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:01:10,541 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:01:10,541 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:01:10,541 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:01:10,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:01:10,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:01:10,542 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:01:10,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:01:10,542 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:01:10,542 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:01:10,542 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:01:10,542 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:01:10,542 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:01:10,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:01:10,542 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:01:10,542 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:01:10,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:01:10,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:01:10,543 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 -> 86a1ef4c3b49651577789848313528c73796bc9c822bd00ff46ecebbbdb382d5 [2025-03-17 03:01:10,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:01:10,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:01:10,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:01:10,759 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:01:10,759 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:01:10,760 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-12.i [2025-03-17 03:01:11,906 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/641c521a3/f3c6e23b3bf2448fa49c3952995a8a53/FLAG977f0b298 [2025-03-17 03:01:12,193 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:01:12,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-12.i [2025-03-17 03:01:12,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/641c521a3/f3c6e23b3bf2448fa49c3952995a8a53/FLAG977f0b298 [2025-03-17 03:01:12,483 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/641c521a3/f3c6e23b3bf2448fa49c3952995a8a53 [2025-03-17 03:01:12,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:01:12,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:01:12,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:01:12,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:01:12,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:01:12,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:01:12" (1/1) ... [2025-03-17 03:01:12,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37cc4922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:12, skipping insertion in model container [2025-03-17 03:01:12,490 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:01:12" (1/1) ... [2025-03-17 03:01:12,511 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:01:12,597 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-12.i[916,929] [2025-03-17 03:01:12,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:01:12,650 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:01:12,657 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-12.i[916,929] [2025-03-17 03:01:12,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:01:12,690 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:01:12,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:12 WrapperNode [2025-03-17 03:01:12,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:01:12,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:01:12,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:01:12,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:01:12,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:12" (1/1) ... [2025-03-17 03:01:12,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:12" (1/1) ... [2025-03-17 03:01:12,731 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2025-03-17 03:01:12,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:01:12,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:01:12,732 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:01:12,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:01:12,740 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:12" (1/1) ... [2025-03-17 03:01:12,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:12" (1/1) ... [2025-03-17 03:01:12,745 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:12" (1/1) ... [2025-03-17 03:01:12,761 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:01:12,761 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:12" (1/1) ... [2025-03-17 03:01:12,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:12" (1/1) ... [2025-03-17 03:01:12,774 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:12" (1/1) ... [2025-03-17 03:01:12,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:12" (1/1) ... [2025-03-17 03:01:12,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:12" (1/1) ... [2025-03-17 03:01:12,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:12" (1/1) ... [2025-03-17 03:01:12,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:01:12,786 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:01:12,786 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:01:12,786 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:01:12,787 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:12" (1/1) ... [2025-03-17 03:01:12,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:01:12,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:01:12,814 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:01:12,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:01:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:01:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:01:12,834 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:01:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:01:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:01:12,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:01:12,891 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:01:12,893 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:01:13,237 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L190: havoc property_#t~bitwise17#1;havoc property_#t~short18#1; [2025-03-17 03:01:13,267 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-17 03:01:13,267 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:01:13,277 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:01:13,279 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:01:13,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:01:13 BoogieIcfgContainer [2025-03-17 03:01:13,279 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:01:13,281 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:01:13,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:01:13,285 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:01:13,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:01:12" (1/3) ... [2025-03-17 03:01:13,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f75842f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:01:13, skipping insertion in model container [2025-03-17 03:01:13,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:12" (2/3) ... [2025-03-17 03:01:13,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f75842f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:01:13, skipping insertion in model container [2025-03-17 03:01:13,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:01:13" (3/3) ... [2025-03-17 03:01:13,287 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-12.i [2025-03-17 03:01:13,298 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:01:13,299 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-12.i that has 2 procedures, 78 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:01:13,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:01:13,354 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;@3eacf4d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:01:13,354 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:01:13,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 55 states have internal predecessors, (82), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 03:01:13,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 03:01:13,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:01:13,368 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:01:13,369 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:01:13,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:01:13,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1502040554, now seen corresponding path program 1 times [2025-03-17 03:01:13,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:01:13,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239746720] [2025-03-17 03:01:13,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:01:13,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:01:13,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 03:01:13,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 03:01:13,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:13,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:01:13,627 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-17 03:01:13,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:01:13,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239746720] [2025-03-17 03:01:13,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239746720] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:01:13,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238017546] [2025-03-17 03:01:13,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:01:13,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:01:13,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:01:13,631 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:01:13,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 03:01:13,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 03:01:13,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 03:01:13,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:13,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:01:13,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:01:13,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:01:13,789 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-17 03:01:13,790 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:01:13,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238017546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:01:13,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:01:13,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:01:13,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687733709] [2025-03-17 03:01:13,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:01:13,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:01:13,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:01:13,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:01:13,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:01:13,809 INFO L87 Difference]: Start difference. First operand has 78 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 55 states have internal predecessors, (82), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 03:01:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:01:13,835 INFO L93 Difference]: Finished difference Result 155 states and 268 transitions. [2025-03-17 03:01:13,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:01:13,836 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2025-03-17 03:01:13,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:01:13,841 INFO L225 Difference]: With dead ends: 155 [2025-03-17 03:01:13,841 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 03:01:13,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:01:13,844 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:01:13,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:01:13,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 03:01:13,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-17 03:01:13,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.471698113207547) internal successors, (78), 53 states have internal predecessors, (78), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 03:01:13,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 120 transitions. [2025-03-17 03:01:13,871 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 120 transitions. Word has length 139 [2025-03-17 03:01:13,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:01:13,871 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 120 transitions. [2025-03-17 03:01:13,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 03:01:13,872 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 120 transitions. [2025-03-17 03:01:13,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 03:01:13,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:01:13,874 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:01:13,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 03:01:14,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 03:01:14,075 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:01:14,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:01:14,076 INFO L85 PathProgramCache]: Analyzing trace with hash 67387927, now seen corresponding path program 1 times [2025-03-17 03:01:14,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:01:14,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393790437] [2025-03-17 03:01:14,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:01:14,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:01:14,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 03:01:14,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 03:01:14,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:14,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:01:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 03:01:14,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:01:14,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393790437] [2025-03-17 03:01:14,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393790437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:01:14,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:01:14,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:01:14,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822968325] [2025-03-17 03:01:14,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:01:14,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:01:14,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:01:14,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:01:14,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:01:14,294 INFO L87 Difference]: Start difference. First operand 76 states and 120 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 03:01:14,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:01:14,340 INFO L93 Difference]: Finished difference Result 179 states and 284 transitions. [2025-03-17 03:01:14,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:01:14,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 139 [2025-03-17 03:01:14,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:01:14,342 INFO L225 Difference]: With dead ends: 179 [2025-03-17 03:01:14,342 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 03:01:14,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:01:14,343 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 40 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:01:14,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 225 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:01:14,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 03:01:14,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 82. [2025-03-17 03:01:14,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.5084745762711864) internal successors, (89), 59 states have internal predecessors, (89), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 03:01:14,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 131 transitions. [2025-03-17 03:01:14,357 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 131 transitions. Word has length 139 [2025-03-17 03:01:14,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:01:14,358 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 131 transitions. [2025-03-17 03:01:14,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 03:01:14,358 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 131 transitions. [2025-03-17 03:01:14,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 03:01:14,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:01:14,361 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:01:14,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:01:14,362 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:01:14,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:01:14,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1729563432, now seen corresponding path program 1 times [2025-03-17 03:01:14,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:01:14,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417754915] [2025-03-17 03:01:14,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:01:14,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:01:14,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 03:01:14,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 03:01:14,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:14,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:01:14,500 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 03:01:14,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:01:14,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417754915] [2025-03-17 03:01:14,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417754915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:01:14,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:01:14,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:01:14,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526047586] [2025-03-17 03:01:14,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:01:14,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:01:14,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:01:14,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:01:14,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:01:14,503 INFO L87 Difference]: Start difference. First operand 82 states and 131 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 03:01:14,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:01:14,566 INFO L93 Difference]: Finished difference Result 202 states and 317 transitions. [2025-03-17 03:01:14,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:01:14,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 139 [2025-03-17 03:01:14,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:01:14,569 INFO L225 Difference]: With dead ends: 202 [2025-03-17 03:01:14,569 INFO L226 Difference]: Without dead ends: 121 [2025-03-17 03:01:14,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:01:14,570 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 48 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:01:14,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 228 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:01:14,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-17 03:01:14,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2025-03-17 03:01:14,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 82 states have internal predecessors, (113), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 03:01:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 175 transitions. [2025-03-17 03:01:14,584 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 175 transitions. Word has length 139 [2025-03-17 03:01:14,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:01:14,586 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 175 transitions. [2025-03-17 03:01:14,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 03:01:14,586 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 175 transitions. [2025-03-17 03:01:14,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 03:01:14,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:01:14,589 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:01:14,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:01:14,589 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:01:14,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:01:14,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1618695093, now seen corresponding path program 1 times [2025-03-17 03:01:14,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:01:14,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733892872] [2025-03-17 03:01:14,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:01:14,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:01:14,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 03:01:14,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 03:01:14,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:14,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:01:15,170 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 03:01:15,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:01:15,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733892872] [2025-03-17 03:01:15,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733892872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:01:15,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:01:15,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 03:01:15,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451266723] [2025-03-17 03:01:15,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:01:15,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:01:15,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:01:15,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:01:15,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:01:15,172 INFO L87 Difference]: Start difference. First operand 115 states and 175 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 03:01:15,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:01:15,253 INFO L93 Difference]: Finished difference Result 230 states and 350 transitions. [2025-03-17 03:01:15,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:01:15,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 140 [2025-03-17 03:01:15,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:01:15,258 INFO L225 Difference]: With dead ends: 230 [2025-03-17 03:01:15,258 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 03:01:15,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:01:15,259 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 37 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:01:15,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 474 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:01:15,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 03:01:15,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-03-17 03:01:15,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 82 states have internal predecessors, (111), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 03:01:15,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 173 transitions. [2025-03-17 03:01:15,279 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 173 transitions. Word has length 140 [2025-03-17 03:01:15,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:01:15,280 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 173 transitions. [2025-03-17 03:01:15,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 03:01:15,280 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 173 transitions. [2025-03-17 03:01:15,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 03:01:15,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:01:15,281 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:01:15,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:01:15,282 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:01:15,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:01:15,282 INFO L85 PathProgramCache]: Analyzing trace with hash -38576109, now seen corresponding path program 1 times [2025-03-17 03:01:15,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:01:15,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883275446] [2025-03-17 03:01:15,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:01:15,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:01:15,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 03:01:15,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 03:01:15,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:15,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:01:15,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1808054024] [2025-03-17 03:01:15,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:01:15,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:01:15,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:01:15,453 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:01:15,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 03:01:15,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 03:01:15,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 03:01:15,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:15,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:01:15,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 03:01:15,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:01:16,092 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 03:01:16,092 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:01:16,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:01:16,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883275446] [2025-03-17 03:01:16,093 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 03:01:16,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808054024] [2025-03-17 03:01:16,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808054024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:01:16,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:01:16,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:01:16,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905083691] [2025-03-17 03:01:16,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:01:16,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:01:16,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:01:16,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:01:16,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:01:16,094 INFO L87 Difference]: Start difference. First operand 115 states and 173 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 03:01:16,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:01:16,244 INFO L93 Difference]: Finished difference Result 338 states and 510 transitions. [2025-03-17 03:01:16,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:01:16,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 142 [2025-03-17 03:01:16,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:01:16,248 INFO L225 Difference]: With dead ends: 338 [2025-03-17 03:01:16,249 INFO L226 Difference]: Without dead ends: 224 [2025-03-17 03:01:16,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:01:16,250 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 111 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:01:16,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 306 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:01:16,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-17 03:01:16,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 154. [2025-03-17 03:01:16,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 99 states have internal predecessors, (128), 52 states have call successors, (52), 3 states have call predecessors, (52), 3 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 03:01:16,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 232 transitions. [2025-03-17 03:01:16,280 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 232 transitions. Word has length 142 [2025-03-17 03:01:16,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:01:16,280 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 232 transitions. [2025-03-17 03:01:16,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 03:01:16,280 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 232 transitions. [2025-03-17 03:01:16,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 03:01:16,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:01:16,282 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:01:16,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 03:01:16,482 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-17 03:01:16,482 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:01:16,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:01:16,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1206188372, now seen corresponding path program 1 times [2025-03-17 03:01:16,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:01:16,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328981269] [2025-03-17 03:01:16,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:01:16,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:01:16,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 03:01:16,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 03:01:16,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:16,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:01:16,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [113058491] [2025-03-17 03:01:16,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:01:16,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:01:16,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:01:16,598 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:01:16,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 03:01:16,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 03:01:16,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 03:01:16,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:16,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:01:16,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 03:01:16,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:01:17,882 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 479 proven. 81 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-17 03:01:17,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:01:18,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:01:18,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328981269] [2025-03-17 03:01:18,045 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 03:01:18,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113058491] [2025-03-17 03:01:18,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113058491] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:01:18,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:01:18,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-03-17 03:01:18,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465968795] [2025-03-17 03:01:18,045 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 03:01:18,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 03:01:18,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:01:18,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 03:01:18,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:01:18,046 INFO L87 Difference]: Start difference. First operand 154 states and 232 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-17 03:01:18,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:01:18,666 INFO L93 Difference]: Finished difference Result 420 states and 625 transitions. [2025-03-17 03:01:18,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 03:01:18,667 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 142 [2025-03-17 03:01:18,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:01:18,669 INFO L225 Difference]: With dead ends: 420 [2025-03-17 03:01:18,669 INFO L226 Difference]: Without dead ends: 306 [2025-03-17 03:01:18,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=499, Unknown=0, NotChecked=0, Total=702 [2025-03-17 03:01:18,670 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 228 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:01:18,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 477 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:01:18,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-17 03:01:18,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 213. [2025-03-17 03:01:18,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 155 states have (on average 1.3741935483870968) internal successors, (213), 156 states have internal predecessors, (213), 52 states have call successors, (52), 5 states have call predecessors, (52), 5 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 03:01:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 317 transitions. [2025-03-17 03:01:18,685 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 317 transitions. Word has length 142 [2025-03-17 03:01:18,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:01:18,686 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 317 transitions. [2025-03-17 03:01:18,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-17 03:01:18,686 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 317 transitions. [2025-03-17 03:01:18,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 03:01:18,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:01:18,687 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:01:18,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 03:01:18,887 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-17 03:01:18,888 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:01:18,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:01:18,888 INFO L85 PathProgramCache]: Analyzing trace with hash -147121325, now seen corresponding path program 1 times [2025-03-17 03:01:18,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:01:18,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652641885] [2025-03-17 03:01:18,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:01:18,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:01:18,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 03:01:18,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 03:01:18,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:18,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:01:18,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [633460670] [2025-03-17 03:01:18,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:01:18,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:01:18,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:01:18,971 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:01:18,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 03:01:19,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 03:01:19,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 03:01:19,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:19,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:01:19,111 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:01:19,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 03:01:19,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 03:01:19,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:19,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:01:19,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:01:19,221 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:01:19,221 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:01:19,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 03:01:19,423 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-17 03:01:19,426 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:01:19,500 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:01:19,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:01:19 BoogieIcfgContainer [2025-03-17 03:01:19,502 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:01:19,503 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:01:19,503 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:01:19,503 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:01:19,504 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:01:13" (3/4) ... [2025-03-17 03:01:19,506 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:01:19,508 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:01:19,509 INFO L158 Benchmark]: Toolchain (without parser) took 7024.20ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 105.4MB in the beginning and 232.5MB in the end (delta: -127.1MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2025-03-17 03:01:19,510 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:01:19,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.58ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 89.8MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:01:19,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.39ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 85.2MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:01:19,511 INFO L158 Benchmark]: Boogie Preprocessor took 53.92ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 78.7MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:01:19,511 INFO L158 Benchmark]: IcfgBuilder took 492.80ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 50.6MB in the end (delta: 28.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 03:01:19,511 INFO L158 Benchmark]: TraceAbstraction took 6221.25ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 49.7MB in the beginning and 232.6MB in the end (delta: -182.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:01:19,512 INFO L158 Benchmark]: Witness Printer took 5.64ms. Allocated memory is still 310.4MB. Free memory was 232.6MB in the beginning and 232.5MB in the end (delta: 97.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:01:19,513 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.58ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 89.8MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.39ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 85.2MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.92ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 78.7MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 492.80ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 50.6MB in the end (delta: 28.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6221.25ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 49.7MB in the beginning and 232.6MB in the end (delta: -182.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.64ms. Allocated memory is still 310.4MB. Free memory was 232.6MB in the beginning and 232.5MB in the end (delta: 97.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 168, overapproximation of someBinaryDOUBLEComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 164, overapproximation of someBinaryDOUBLEComparisonOperation at line 173, overapproximation of someBinaryDOUBLEComparisonOperation at line 190, overapproximation of someBinaryDOUBLEComparisonOperation at line 166, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 155, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 190. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 100; [L23] unsigned char var_1_5 = 0; [L24] double var_1_6 = 4.5; [L25] unsigned char var_1_7 = 2; [L26] unsigned char var_1_8 = 2; [L27] double var_1_12 = 16.4; [L28] signed long int var_1_13 = 32; [L29] signed short int var_1_15 = -10; [L30] signed long int var_1_16 = -5; [L31] unsigned char var_1_17 = 1; [L32] signed short int var_1_18 = 500; [L33] double var_1_19 = 32.5; [L34] signed char var_1_20 = 0; [L35] double var_1_21 = 2.5; [L36] double var_1_22 = 0.0; [L37] double var_1_23 = 9.6; [L38] unsigned char var_1_24 = 64; [L39] unsigned char var_1_25 = 0; [L40] unsigned short int var_1_26 = 8; [L41] unsigned short int var_1_28 = 16; [L42] double var_1_29 = 200.5; [L43] unsigned short int var_1_30 = 20701; [L44] double last_1_var_1_6 = 4.5; [L45] signed long int last_1_var_1_16 = -5; [L46] signed short int last_1_var_1_18 = 500; [L47] signed char last_1_var_1_20 = 0; [L48] double last_1_var_1_21 = 2.5; [L49] unsigned char last_1_var_1_24 = 64; [L50] unsigned short int last_1_var_1_26 = 8; [L51] unsigned short int last_1_var_1_28 = 16; [L194] isInitial = 1 [L195] FCALL initially() [L196] int k_loop; [L197] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L197] COND TRUE k_loop < 1 [L198] CALL updateLastVariables() [L180] last_1_var_1_6 = var_1_6 [L181] last_1_var_1_16 = var_1_16 [L182] last_1_var_1_18 = var_1_18 [L183] last_1_var_1_20 = var_1_20 [L184] last_1_var_1_21 = var_1_21 [L185] last_1_var_1_24 = var_1_24 [L186] last_1_var_1_26 = var_1_26 [L187] last_1_var_1_28 = var_1_28 [L198] RET updateLastVariables() [L199] CALL updateVariables() [L145] var_1_5 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_6=9/2, var_1_7=2, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_6=9/2, var_1_7=2, var_1_8=2] [L146] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_6=9/2, var_1_7=2, var_1_8=2] [L147] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L147] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L148] var_1_7 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_8=2] [L149] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_8=2] [L150] CALL assume_abort_if_not(var_1_7 <= 23) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L150] RET assume_abort_if_not(var_1_7 <= 23) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L151] var_1_8 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2] [L152] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2] [L153] CALL assume_abort_if_not(var_1_8 <= 23) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L153] RET assume_abort_if_not(var_1_8 <= 23) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L154] var_1_12 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L155] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L156] var_1_15 = __VERIFIER_nondet_short() [L157] CALL assume_abort_if_not(var_1_15 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L157] RET assume_abort_if_not(var_1_15 >= -32768) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L158] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L158] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L159] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L159] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L160] var_1_17 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L161] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L162] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L162] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L163] var_1_19 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854776000e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L164] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854776000e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L165] var_1_22 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L166] RET assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L167] var_1_23 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L168] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L169] var_1_25 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L170] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L171] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L171] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L172] var_1_29 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L173] RET assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L174] CALL assume_abort_if_not(var_1_29 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L174] RET assume_abort_if_not(var_1_29 != 0.0F) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L175] var_1_30 = __VERIFIER_nondet_ushort() [L176] CALL assume_abort_if_not(var_1_30 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L176] RET assume_abort_if_not(var_1_30 >= 16383) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L177] CALL assume_abort_if_not(var_1_30 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L177] RET assume_abort_if_not(var_1_30 <= 32767) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L199] RET updateVariables() [L200] CALL step() [L55] unsigned char stepLocal_0 = ! var_1_5; VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_0=1, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L56] COND FALSE !(((last_1_var_1_26 * last_1_var_1_20) >= last_1_var_1_28) && stepLocal_0) [L59] var_1_1 = last_1_var_1_26 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L61] EXPR (last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L61] signed long int stepLocal_1 = (last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))); [L62] COND FALSE !(last_1_var_1_18 <= stepLocal_1) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L69] signed long int stepLocal_3 = last_1_var_1_26 + var_1_8; VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L70] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L81] COND TRUE ! (last_1_var_1_18 <= (var_1_7 / var_1_15)) [L82] var_1_21 = ((((((var_1_22 - 7.5) - var_1_23)) > (var_1_12)) ? (((var_1_22 - 7.5) - var_1_23)) : (var_1_12))) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_12=0, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L86] COND FALSE !(var_1_17 || (var_1_8 >= last_1_var_1_24)) [L91] var_1_24 = var_1_7 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_12=0, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L93] COND FALSE !(var_1_19 == var_1_21) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_12=0, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L100] COND FALSE !(var_1_5 && var_1_17) [L103] var_1_16 = (var_1_8 - var_1_7) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_12=0, var_1_13=32, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L105] unsigned char stepLocal_2 = var_1_24; VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_2=2, stepLocal_3=8, var_1_12=0, var_1_13=32, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L106] COND TRUE var_1_21 > var_1_21 [L107] var_1_13 = (var_1_7 - var_1_24) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_2=2, stepLocal_3=8, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L115] COND FALSE !(\read(var_1_17)) [L122] var_1_28 = var_1_1 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_2=2, stepLocal_3=8, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=8, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L124] COND TRUE ! var_1_17 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_2=2, stepLocal_3=8, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=8, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L125] COND FALSE !(\read(var_1_17)) [L138] var_1_26 = var_1_18 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_2=2, stepLocal_3=8, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L200] RET step() [L201] CALL, EXPR property() [L190] EXPR ((((last_1_var_1_26 * last_1_var_1_20) >= last_1_var_1_28) && (! var_1_5)) ? (var_1_1 == ((signed short int) last_1_var_1_26)) : (var_1_1 == ((signed short int) last_1_var_1_26))) && ((last_1_var_1_18 <= ((last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) ? (((- last_1_var_1_21) > (last_1_var_1_6 + (- last_1_var_1_21))) ? (var_1_6 == ((double) var_1_12)) : (var_1_6 == ((double) var_1_12))) : 1) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L190] EXPR (last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L190] EXPR ((((last_1_var_1_26 * last_1_var_1_20) >= last_1_var_1_28) && (! var_1_5)) ? (var_1_1 == ((signed short int) last_1_var_1_26)) : (var_1_1 == ((signed short int) last_1_var_1_26))) && ((last_1_var_1_18 <= ((last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) ? (((- last_1_var_1_21) > (last_1_var_1_6 + (- last_1_var_1_21))) ? (var_1_6 == ((double) var_1_12)) : (var_1_6 == ((double) var_1_12))) : 1) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L190-L191] return ((((((((((((last_1_var_1_26 * last_1_var_1_20) >= last_1_var_1_28) && (! var_1_5)) ? (var_1_1 == ((signed short int) last_1_var_1_26)) : (var_1_1 == ((signed short int) last_1_var_1_26))) && ((last_1_var_1_18 <= ((last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) ? (((- last_1_var_1_21) > (last_1_var_1_6 + (- last_1_var_1_21))) ? (var_1_6 == ((double) var_1_12)) : (var_1_6 == ((double) var_1_12))) : 1)) && ((var_1_21 > var_1_21) ? (var_1_13 == ((signed long int) (var_1_7 - var_1_24))) : (((var_1_16 / var_1_15) < var_1_24) ? (var_1_13 == ((signed long int) var_1_7)) : (var_1_13 == ((signed long int) var_1_15))))) && ((var_1_5 && var_1_17) ? (var_1_16 == ((signed long int) ((((last_1_var_1_16) > (var_1_15)) ? (last_1_var_1_16) : (var_1_15))))) : (var_1_16 == ((signed long int) (var_1_8 - var_1_7))))) && (var_1_5 ? ((((((last_1_var_1_6) < ((1.0000000075E8 - var_1_19))) ? (last_1_var_1_6) : ((1.0000000075E8 - var_1_19)))) > var_1_12) ? (((last_1_var_1_26 + var_1_8) >= last_1_var_1_24) ? (var_1_18 == ((signed short int) var_1_7)) : (var_1_18 == ((signed short int) last_1_var_1_24))) : (var_1_18 == ((signed short int) var_1_8))) : 1)) && ((var_1_19 == var_1_21) ? ((! var_1_17) ? (var_1_20 == ((signed char) ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) : (var_1_20 == ((signed char) var_1_7))) : 1)) && ((! (last_1_var_1_18 <= (var_1_7 / var_1_15))) ? (var_1_21 == ((double) ((((((var_1_22 - 7.5) - var_1_23)) > (var_1_12)) ? (((var_1_22 - 7.5) - var_1_23)) : (var_1_12))))) : (var_1_21 == ((double) var_1_22)))) && ((var_1_17 || (var_1_8 >= last_1_var_1_24)) ? ((var_1_17 && (var_1_21 != var_1_23)) ? (var_1_24 == ((unsigned char) ((((var_1_7) < (var_1_25)) ? (var_1_7) : (var_1_25))))) : 1) : (var_1_24 == ((unsigned char) var_1_7)))) && ((! var_1_17) ? (var_1_17 ? ((var_1_6 <= ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) ? ((var_1_19 <= ((var_1_12 + var_1_6) / var_1_22)) ? (((~ var_1_24) > var_1_1) ? (var_1_26 == ((unsigned short int) var_1_13)) : (var_1_26 == ((unsigned short int) var_1_7))) : 1) : (var_1_26 == ((unsigned short int) var_1_18))) : (var_1_26 == ((unsigned short int) var_1_18))) : (var_1_26 == ((unsigned short int) var_1_8)))) && (var_1_17 ? ((var_1_21 <= ((var_1_6 / var_1_22) + (var_1_21 / var_1_29))) ? (var_1_28 == ((unsigned short int) ((59265 - ((((var_1_8) > (var_1_18)) ? (var_1_8) : (var_1_18)))) - (var_1_30 - var_1_13)))) : (var_1_28 == ((unsigned short int) var_1_13))) : (var_1_28 == ((unsigned short int) var_1_1))) ; [L201] RET, EXPR property() [L201] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=-49153, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 145 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 7, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 464 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 464 mSDsluCounter, 1830 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1183 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 604 IncrementalHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 647 mSDtfsCounter, 604 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 538 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=6, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 192 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1548 NumberOfCodeBlocks, 1548 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 973 ConstructedInterpolants, 0 QuantifiedInterpolants, 4060 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1088 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 5759/5880 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 03:01:19,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-12.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 86a1ef4c3b49651577789848313528c73796bc9c822bd00ff46ecebbbdb382d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:01:21,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:01:21,429 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:01:21,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:01:21,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:01:21,457 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:01:21,457 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:01:21,458 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:01:21,458 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:01:21,458 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:01:21,459 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:01:21,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:01:21,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:01:21,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:01:21,460 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:01:21,460 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:01:21,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:01:21,460 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:01:21,461 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:01:21,461 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:01:21,461 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:01:21,461 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:01:21,461 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:01:21,461 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:01:21,461 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:01:21,461 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:01:21,461 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:01:21,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:01:21,461 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:01:21,461 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:01:21,462 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:01:21,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:01:21,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:01:21,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:01:21,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:01:21,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:01:21,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:01:21,462 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:01:21,462 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:01:21,462 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:01:21,462 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:01:21,462 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:01:21,462 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:01:21,462 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:01:21,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:01:21,462 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 -> 86a1ef4c3b49651577789848313528c73796bc9c822bd00ff46ecebbbdb382d5 [2025-03-17 03:01:21,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:01:21,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:01:21,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:01:21,696 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:01:21,696 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:01:21,697 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-12.i [2025-03-17 03:01:22,865 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/759756aa0/77b76d9fbfc4449aafa3d441f466e57f/FLAG641844b2b [2025-03-17 03:01:23,034 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:01:23,035 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-12.i [2025-03-17 03:01:23,041 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/759756aa0/77b76d9fbfc4449aafa3d441f466e57f/FLAG641844b2b [2025-03-17 03:01:23,051 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/759756aa0/77b76d9fbfc4449aafa3d441f466e57f [2025-03-17 03:01:23,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:01:23,055 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:01:23,056 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:01:23,056 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:01:23,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:01:23,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:01:23" (1/1) ... [2025-03-17 03:01:23,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a2375d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:23, skipping insertion in model container [2025-03-17 03:01:23,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:01:23" (1/1) ... [2025-03-17 03:01:23,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:01:23,175 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-12.i[916,929] [2025-03-17 03:01:23,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:01:23,264 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:01:23,273 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-12.i[916,929] [2025-03-17 03:01:23,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:01:23,323 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:01:23,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:23 WrapperNode [2025-03-17 03:01:23,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:01:23,324 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:01:23,324 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:01:23,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:01:23,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:23" (1/1) ... [2025-03-17 03:01:23,339 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:23" (1/1) ... [2025-03-17 03:01:23,368 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2025-03-17 03:01:23,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:01:23,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:01:23,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:01:23,369 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:01:23,375 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:23" (1/1) ... [2025-03-17 03:01:23,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:23" (1/1) ... [2025-03-17 03:01:23,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:23" (1/1) ... [2025-03-17 03:01:23,392 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:01:23,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:23" (1/1) ... [2025-03-17 03:01:23,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:23" (1/1) ... [2025-03-17 03:01:23,411 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:23" (1/1) ... [2025-03-17 03:01:23,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:23" (1/1) ... [2025-03-17 03:01:23,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:23" (1/1) ... [2025-03-17 03:01:23,419 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:23" (1/1) ... [2025-03-17 03:01:23,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:01:23,426 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:01:23,426 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:01:23,426 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:01:23,427 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:23" (1/1) ... [2025-03-17 03:01:23,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:01:23,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:01:23,455 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:01:23,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:01:23,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:01:23,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:01:23,478 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:01:23,478 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:01:23,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:01:23,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:01:23,561 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:01:23,563 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:01:48,757 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-17 03:01:48,758 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:01:48,765 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:01:48,765 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:01:48,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:01:48 BoogieIcfgContainer [2025-03-17 03:01:48,765 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:01:48,767 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:01:48,767 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:01:48,771 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:01:48,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:01:23" (1/3) ... [2025-03-17 03:01:48,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37fd34f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:01:48, skipping insertion in model container [2025-03-17 03:01:48,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:23" (2/3) ... [2025-03-17 03:01:48,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37fd34f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:01:48, skipping insertion in model container [2025-03-17 03:01:48,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:01:48" (3/3) ... [2025-03-17 03:01:48,772 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-12.i [2025-03-17 03:01:48,782 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:01:48,784 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-12.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:01:48,822 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:01:48,829 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;@69b619f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:01:48,830 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:01:48,833 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 03:01:48,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 03:01:48,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:01:48,842 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:01:48,842 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:01:48,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:01:48,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1570849606, now seen corresponding path program 1 times [2025-03-17 03:01:48,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:01:48,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197942302] [2025-03-17 03:01:48,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:01:48,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:01:48,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:01:48,858 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:01:48,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 03:01:48,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 03:01:50,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 03:01:50,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:50,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:01:50,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:01:50,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:01:50,408 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2025-03-17 03:01:50,409 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:01:50,409 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:01:50,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197942302] [2025-03-17 03:01:50,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197942302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:01:50,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:01:50,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:01:50,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516171384] [2025-03-17 03:01:50,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:01:50,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:01:50,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:01:50,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:01:50,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:01:50,431 INFO L87 Difference]: Start difference. First operand has 70 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 03:01:50,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:01:50,447 INFO L93 Difference]: Finished difference Result 139 states and 246 transitions. [2025-03-17 03:01:50,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:01:50,448 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2025-03-17 03:01:50,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:01:50,454 INFO L225 Difference]: With dead ends: 139 [2025-03-17 03:01:50,454 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 03:01:50,457 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-17 03:01:50,460 INFO L435 NwaCegarLoop]: 110 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, 110 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:01:50,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:01:50,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 03:01:50,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-17 03:01:50,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 45 states have internal predecessors, (66), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 03:01:50,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 108 transitions. [2025-03-17 03:01:50,495 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 108 transitions. Word has length 135 [2025-03-17 03:01:50,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:01:50,496 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 108 transitions. [2025-03-17 03:01:50,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 03:01:50,496 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 108 transitions. [2025-03-17 03:01:50,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 03:01:50,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:01:50,499 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:01:50,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 03:01:50,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:01:50,701 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:01:50,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:01:50,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1545817672, now seen corresponding path program 1 times [2025-03-17 03:01:50,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:01:50,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920270331] [2025-03-17 03:01:50,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:01:50,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:01:50,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:01:50,706 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:01:50,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 03:01:50,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 03:01:52,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 03:01:52,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:01:52,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:01:52,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 03:01:52,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:02:05,768 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 03:02:05,769 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:02:05,769 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:02:05,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920270331] [2025-03-17 03:02:05,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920270331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:02:05,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:02:05,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:02:05,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798658469] [2025-03-17 03:02:05,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:02:05,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:02:05,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:02:05,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:02:05,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:02:05,772 INFO L87 Difference]: Start difference. First operand 68 states and 108 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 03:02:10,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.42s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:02:15,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.51s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:02:19,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.54s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:02:24,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.52s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:02:29,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.79s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:02:33,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:02:38,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:02:42,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.54s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:02:47,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.86s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:02:51,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:02:51,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:02:51,481 INFO L93 Difference]: Finished difference Result 209 states and 333 transitions. [2025-03-17 03:02:51,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:02:51,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 136 [2025-03-17 03:02:51,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:02:51,785 INFO L225 Difference]: With dead ends: 209 [2025-03-17 03:02:51,785 INFO L226 Difference]: Without dead ends: 142 [2025-03-17 03:02:51,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:02:51,786 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 102 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 43 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:02:51,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 307 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 11 Invalid, 10 Unknown, 0 Unchecked, 45.4s Time] [2025-03-17 03:02:51,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-17 03:02:51,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 107. [2025-03-17 03:02:51,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 03:02:51,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 167 transitions. [2025-03-17 03:02:51,820 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 167 transitions. Word has length 136 [2025-03-17 03:02:51,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:02:51,820 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 167 transitions. [2025-03-17 03:02:51,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 03:02:51,820 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 167 transitions. [2025-03-17 03:02:51,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 03:02:51,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:02:51,822 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:02:51,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 03:02:52,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:02:52,023 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:02:52,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:02:52,023 INFO L85 PathProgramCache]: Analyzing trace with hash -192507975, now seen corresponding path program 1 times [2025-03-17 03:02:52,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:02:52,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412827506] [2025-03-17 03:02:52,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:02:52,024 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:02:52,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:02:52,026 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:02:52,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 03:02:52,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 03:02:53,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 03:02:53,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:02:53,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:02:53,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 03:02:53,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:02:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 03:02:54,078 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:02:54,078 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:02:54,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412827506] [2025-03-17 03:02:54,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412827506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:02:54,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:02:54,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:02:54,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36640132] [2025-03-17 03:02:54,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:02:54,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:02:54,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:02:54,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:02:54,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:02:54,081 INFO L87 Difference]: Start difference. First operand 107 states and 167 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21)