./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_operatoramount_amount50_file-53.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 48ff97b9a3af78a737a84e658c15b8d38a46f0a552b076decd87f4d89ed81dac --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:44:14,544 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:44:14,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:44:14,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:44:14,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:44:14,616 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:44:14,617 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:44:14,617 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:44:14,617 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:44:14,617 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:44:14,617 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:44:14,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:44:14,618 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:44:14,618 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:44:14,618 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:44:14,618 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:44:14,618 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:44:14,618 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:44:14,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:44:14,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:44:14,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:44:14,619 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:44:14,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:44:14,619 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:44:14,619 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:44:14,619 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:44:14,619 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:44:14,619 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:44:14,619 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:44:14,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:44:14,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:44:14,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:44:14,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:44:14,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:44:14,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:44:14,621 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:44:14,621 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:44:14,621 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:44:14,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:44:14,621 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:44:14,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:44:14,621 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:44:14,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:44:14,621 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 -> 48ff97b9a3af78a737a84e658c15b8d38a46f0a552b076decd87f4d89ed81dac [2025-03-04 00:44:14,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:44:14,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:44:14,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:44:14,847 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:44:14,847 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:44:14,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-53.i [2025-03-04 00:44:15,966 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cb37f3f3/a0dcc55b82d24a81b71a7587f0561f3b/FLAGfe6d9d687 [2025-03-04 00:44:16,200 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:44:16,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-53.i [2025-03-04 00:44:16,227 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cb37f3f3/a0dcc55b82d24a81b71a7587f0561f3b/FLAGfe6d9d687 [2025-03-04 00:44:16,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cb37f3f3/a0dcc55b82d24a81b71a7587f0561f3b [2025-03-04 00:44:16,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:44:16,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:44:16,259 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:44:16,260 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:44:16,264 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:44:16,265 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:44:16" (1/1) ... [2025-03-04 00:44:16,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d7f33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:16, skipping insertion in model container [2025-03-04 00:44:16,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:44:16" (1/1) ... [2025-03-04 00:44:16,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:44:16,422 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_operatoramount_amount50_file-53.i[915,928] [2025-03-04 00:44:16,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:44:16,465 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:44:16,478 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_operatoramount_amount50_file-53.i[915,928] [2025-03-04 00:44:16,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:44:16,518 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:44:16,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:16 WrapperNode [2025-03-04 00:44:16,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:44:16,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:44:16,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:44:16,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:44:16,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:16" (1/1) ... [2025-03-04 00:44:16,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:16" (1/1) ... [2025-03-04 00:44:16,562 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2025-03-04 00:44:16,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:44:16,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:44:16,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:44:16,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:44:16,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:16" (1/1) ... [2025-03-04 00:44:16,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:16" (1/1) ... [2025-03-04 00:44:16,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:16" (1/1) ... [2025-03-04 00:44:16,593 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-04 00:44:16,593 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:16" (1/1) ... [2025-03-04 00:44:16,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:16" (1/1) ... [2025-03-04 00:44:16,601 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:16" (1/1) ... [2025-03-04 00:44:16,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:16" (1/1) ... [2025-03-04 00:44:16,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:16" (1/1) ... [2025-03-04 00:44:16,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:16" (1/1) ... [2025-03-04 00:44:16,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:44:16,615 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:44:16,615 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:44:16,615 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:44:16,616 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:16" (1/1) ... [2025-03-04 00:44:16,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:44:16,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:44:16,641 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-04 00:44:16,644 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-04 00:44:16,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:44:16,661 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:44:16,661 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:44:16,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:44:16,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:44:16,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:44:16,722 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:44:16,724 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:44:16,972 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc property_#t~ite16#1;havoc property_#t~bitwise15#1;havoc property_#t~short17#1;havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2025-03-04 00:44:17,005 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-04 00:44:17,005 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:44:17,022 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:44:17,022 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 00:44:17,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:44:17 BoogieIcfgContainer [2025-03-04 00:44:17,022 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:44:17,024 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:44:17,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:44:17,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:44:17,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:44:16" (1/3) ... [2025-03-04 00:44:17,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492d34cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:44:17, skipping insertion in model container [2025-03-04 00:44:17,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:16" (2/3) ... [2025-03-04 00:44:17,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492d34cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:44:17, skipping insertion in model container [2025-03-04 00:44:17,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:44:17" (3/3) ... [2025-03-04 00:44:17,030 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-53.i [2025-03-04 00:44:17,040 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:44:17,041 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-53.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:44:17,085 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:44:17,093 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;@35513e85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:44:17,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:44:17,096 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 00:44:17,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 00:44:17,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:44:17,105 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:44:17,105 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:44:17,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:44:17,109 INFO L85 PathProgramCache]: Analyzing trace with hash -928050765, now seen corresponding path program 1 times [2025-03-04 00:44:17,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:44:17,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133942108] [2025-03-04 00:44:17,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:17,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:44:17,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 00:44:17,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 00:44:17,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:17,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:44:17,335 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-04 00:44:17,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:44:17,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133942108] [2025-03-04 00:44:17,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133942108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:44:17,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889583919] [2025-03-04 00:44:17,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:17,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:44:17,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:44:17,338 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-04 00:44:17,339 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-04 00:44:17,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 00:44:17,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 00:44:17,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:17,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:44:17,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:44:17,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:44:17,498 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-04 00:44:17,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:44:17,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889583919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:44:17,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:44:17,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:44:17,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572848076] [2025-03-04 00:44:17,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:44:17,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:44:17,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:44:17,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:44:17,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:44:17,520 INFO L87 Difference]: Start difference. First operand has 75 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 00:44:17,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:44:17,553 INFO L93 Difference]: Finished difference Result 144 states and 234 transitions. [2025-03-04 00:44:17,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:44:17,556 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 117 [2025-03-04 00:44:17,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:44:17,561 INFO L225 Difference]: With dead ends: 144 [2025-03-04 00:44:17,562 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 00:44:17,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 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-04 00:44:17,569 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:44:17,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:44:17,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 00:44:17,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-04 00:44:17,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 00:44:17,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 106 transitions. [2025-03-04 00:44:17,603 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 106 transitions. Word has length 117 [2025-03-04 00:44:17,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:44:17,603 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 106 transitions. [2025-03-04 00:44:17,603 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 00:44:17,603 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 106 transitions. [2025-03-04 00:44:17,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 00:44:17,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:44:17,606 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:44:17,613 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-04 00:44:17,810 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-04 00:44:17,810 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:44:17,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:44:17,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1676240504, now seen corresponding path program 1 times [2025-03-04 00:44:17,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:44:17,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252914635] [2025-03-04 00:44:17,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:17,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:44:17,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 00:44:17,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 00:44:17,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:17,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:44:17,960 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 00:44:17,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:44:17,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252914635] [2025-03-04 00:44:17,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252914635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:44:17,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:44:17,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:44:17,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408254981] [2025-03-04 00:44:17,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:44:17,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:44:17,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:44:17,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:44:17,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:44:17,962 INFO L87 Difference]: Start difference. First operand 72 states and 106 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 00:44:18,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:44:18,024 INFO L93 Difference]: Finished difference Result 201 states and 297 transitions. [2025-03-04 00:44:18,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:44:18,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 117 [2025-03-04 00:44:18,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:44:18,028 INFO L225 Difference]: With dead ends: 201 [2025-03-04 00:44:18,028 INFO L226 Difference]: Without dead ends: 132 [2025-03-04 00:44:18,028 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-04 00:44:18,030 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 83 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:44:18,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 245 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:44:18,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-04 00:44:18,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2025-03-04 00:44:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 93 states have internal predecessors, (122), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 00:44:18,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 190 transitions. [2025-03-04 00:44:18,053 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 190 transitions. Word has length 117 [2025-03-04 00:44:18,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:44:18,053 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 190 transitions. [2025-03-04 00:44:18,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 00:44:18,054 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 190 transitions. [2025-03-04 00:44:18,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 00:44:18,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:44:18,055 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:44:18,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:44:18,055 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:44:18,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:44:18,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1643955137, now seen corresponding path program 1 times [2025-03-04 00:44:18,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:44:18,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481260599] [2025-03-04 00:44:18,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:18,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:44:18,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 00:44:18,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 00:44:18,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:18,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:44:18,317 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 00:44:18,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:44:18,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481260599] [2025-03-04 00:44:18,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481260599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:44:18,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:44:18,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:44:18,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970816964] [2025-03-04 00:44:18,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:44:18,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:44:18,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:44:18,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:44:18,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:44:18,320 INFO L87 Difference]: Start difference. First operand 130 states and 190 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 00:44:18,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:44:18,493 INFO L93 Difference]: Finished difference Result 437 states and 637 transitions. [2025-03-04 00:44:18,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:44:18,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 118 [2025-03-04 00:44:18,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:44:18,496 INFO L225 Difference]: With dead ends: 437 [2025-03-04 00:44:18,496 INFO L226 Difference]: Without dead ends: 310 [2025-03-04 00:44:18,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:44:18,498 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 122 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:44:18,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 293 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:44:18,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-04 00:44:18,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 292. [2025-03-04 00:44:18,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 219 states have (on average 1.3242009132420092) internal successors, (290), 219 states have internal predecessors, (290), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 00:44:18,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 426 transitions. [2025-03-04 00:44:18,540 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 426 transitions. Word has length 118 [2025-03-04 00:44:18,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:44:18,541 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 426 transitions. [2025-03-04 00:44:18,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 00:44:18,542 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 426 transitions. [2025-03-04 00:44:18,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 00:44:18,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:44:18,543 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:44:18,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:44:18,543 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:44:18,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:44:18,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1505775662, now seen corresponding path program 1 times [2025-03-04 00:44:18,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:44:18,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414158189] [2025-03-04 00:44:18,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:18,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:44:18,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 00:44:18,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 00:44:18,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:18,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:44:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 00:44:18,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:44:18,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414158189] [2025-03-04 00:44:18,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414158189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:44:18,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:44:18,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:44:18,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562451150] [2025-03-04 00:44:18,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:44:18,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:44:18,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:44:18,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:44:18,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:44:18,722 INFO L87 Difference]: Start difference. First operand 292 states and 426 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 00:44:18,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:44:18,787 INFO L93 Difference]: Finished difference Result 737 states and 1082 transitions. [2025-03-04 00:44:18,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:44:18,787 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 119 [2025-03-04 00:44:18,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:44:18,791 INFO L225 Difference]: With dead ends: 737 [2025-03-04 00:44:18,791 INFO L226 Difference]: Without dead ends: 448 [2025-03-04 00:44:18,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-04 00:44:18,793 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 61 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:44:18,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 204 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:44:18,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-03-04 00:44:18,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 446. [2025-03-04 00:44:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 337 states have (on average 1.3204747774480712) internal successors, (445), 337 states have internal predecessors, (445), 102 states have call successors, (102), 6 states have call predecessors, (102), 6 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-04 00:44:18,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 649 transitions. [2025-03-04 00:44:18,840 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 649 transitions. Word has length 119 [2025-03-04 00:44:18,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:44:18,841 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 649 transitions. [2025-03-04 00:44:18,841 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 00:44:18,841 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 649 transitions. [2025-03-04 00:44:18,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 00:44:18,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:44:18,844 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:44:18,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:44:18,844 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:44:18,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:44:18,845 INFO L85 PathProgramCache]: Analyzing trace with hash 471623023, now seen corresponding path program 1 times [2025-03-04 00:44:18,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:44:18,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669578150] [2025-03-04 00:44:18,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:18,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:44:18,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 00:44:18,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 00:44:18,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:18,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:44:19,053 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 00:44:19,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:44:19,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669578150] [2025-03-04 00:44:19,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669578150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:44:19,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:44:19,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:44:19,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747903309] [2025-03-04 00:44:19,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:44:19,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:44:19,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:44:19,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:44:19,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:44:19,057 INFO L87 Difference]: Start difference. First operand 446 states and 649 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 00:44:19,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:44:19,153 INFO L93 Difference]: Finished difference Result 448 states and 650 transitions. [2025-03-04 00:44:19,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:44:19,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 120 [2025-03-04 00:44:19,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:44:19,158 INFO L225 Difference]: With dead ends: 448 [2025-03-04 00:44:19,158 INFO L226 Difference]: Without dead ends: 159 [2025-03-04 00:44:19,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-04 00:44:19,159 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 116 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:44:19,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 88 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:44:19,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-04 00:44:19,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-03-04 00:44:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 00:44:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 225 transitions. [2025-03-04 00:44:19,177 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 225 transitions. Word has length 120 [2025-03-04 00:44:19,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:44:19,177 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 225 transitions. [2025-03-04 00:44:19,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 00:44:19,177 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 225 transitions. [2025-03-04 00:44:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 00:44:19,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:44:19,178 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:44:19,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:44:19,178 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:44:19,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:44:19,179 INFO L85 PathProgramCache]: Analyzing trace with hash -39371828, now seen corresponding path program 1 times [2025-03-04 00:44:19,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:44:19,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128435565] [2025-03-04 00:44:19,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:19,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:44:19,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 00:44:19,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 00:44:19,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:19,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:44:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 00:44:19,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:44:19,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128435565] [2025-03-04 00:44:19,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128435565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:44:19,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:44:19,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:44:19,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197982469] [2025-03-04 00:44:19,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:44:19,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:44:19,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:44:19,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:44:19,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:44:19,261 INFO L87 Difference]: Start difference. First operand 159 states and 225 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 00:44:19,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:44:19,361 INFO L93 Difference]: Finished difference Result 463 states and 658 transitions. [2025-03-04 00:44:19,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:44:19,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 120 [2025-03-04 00:44:19,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:44:19,364 INFO L225 Difference]: With dead ends: 463 [2025-03-04 00:44:19,364 INFO L226 Difference]: Without dead ends: 307 [2025-03-04 00:44:19,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:44:19,364 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 92 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:44:19,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 242 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:44:19,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-04 00:44:19,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 165. [2025-03-04 00:44:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 128 states have (on average 1.2734375) internal successors, (163), 128 states have internal predecessors, (163), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 00:44:19,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 231 transitions. [2025-03-04 00:44:19,388 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 231 transitions. Word has length 120 [2025-03-04 00:44:19,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:44:19,388 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 231 transitions. [2025-03-04 00:44:19,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 00:44:19,389 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 231 transitions. [2025-03-04 00:44:19,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 00:44:19,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:44:19,390 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:44:19,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:44:19,390 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:44:19,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:44:19,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1836323187, now seen corresponding path program 1 times [2025-03-04 00:44:19,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:44:19,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92818176] [2025-03-04 00:44:19,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:19,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:44:19,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 00:44:19,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 00:44:19,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:19,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:44:19,692 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 00:44:19,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:44:19,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92818176] [2025-03-04 00:44:19,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92818176] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:44:19,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74561008] [2025-03-04 00:44:19,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:19,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:44:19,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:44:19,695 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-04 00:44:19,697 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-04 00:44:19,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 00:44:19,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 00:44:19,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:19,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:44:19,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 00:44:19,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:44:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 106 proven. 3 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 00:44:20,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:44:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 00:44:20,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74561008] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:44:20,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:44:20,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 20 [2025-03-04 00:44:20,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370525889] [2025-03-04 00:44:20,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:44:20,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 00:44:20,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:44:20,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 00:44:20,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-03-04 00:44:20,308 INFO L87 Difference]: Start difference. First operand 165 states and 231 transitions. Second operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 5 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (36), 5 states have call predecessors, (36), 5 states have call successors, (36) [2025-03-04 00:44:21,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:44:21,909 INFO L93 Difference]: Finished difference Result 573 states and 779 transitions. [2025-03-04 00:44:21,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-04 00:44:21,910 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 5 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (36), 5 states have call predecessors, (36), 5 states have call successors, (36) Word has length 120 [2025-03-04 00:44:21,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:44:21,912 INFO L225 Difference]: With dead ends: 573 [2025-03-04 00:44:21,912 INFO L226 Difference]: Without dead ends: 411 [2025-03-04 00:44:21,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 231 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=739, Invalid=2683, Unknown=0, NotChecked=0, Total=3422 [2025-03-04 00:44:21,917 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 562 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 2030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:44:21,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1631 Invalid, 2030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 00:44:21,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-03-04 00:44:21,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 167. [2025-03-04 00:44:21,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 128 states have (on average 1.25) internal successors, (160), 128 states have internal predecessors, (160), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 00:44:21,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 228 transitions. [2025-03-04 00:44:21,962 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 228 transitions. Word has length 120 [2025-03-04 00:44:21,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:44:21,962 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 228 transitions. [2025-03-04 00:44:21,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 5 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (36), 5 states have call predecessors, (36), 5 states have call successors, (36) [2025-03-04 00:44:21,962 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 228 transitions. [2025-03-04 00:44:21,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 00:44:21,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:44:21,963 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:44:21,971 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-04 00:44:22,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 00:44:22,164 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:44:22,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:44:22,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1006637419, now seen corresponding path program 1 times [2025-03-04 00:44:22,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:44:22,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101829151] [2025-03-04 00:44:22,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:22,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:44:22,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 00:44:22,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 00:44:22,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:22,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:44:22,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1812966626] [2025-03-04 00:44:22,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:22,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:44:22,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:44:22,265 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-04 00:44:22,267 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-04 00:44:22,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 00:44:22,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 00:44:22,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:22,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:44:22,614 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:44:22,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 00:44:22,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 00:44:22,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:22,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:44:22,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:44:22,749 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:44:22,749 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:44:22,761 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-04 00:44:22,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:44:22,959 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:44:23,024 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:44:23,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:44:23 BoogieIcfgContainer [2025-03-04 00:44:23,029 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:44:23,029 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:44:23,030 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:44:23,030 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:44:23,030 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:44:17" (3/4) ... [2025-03-04 00:44:23,032 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:44:23,032 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:44:23,033 INFO L158 Benchmark]: Toolchain (without parser) took 6776.47ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 113.5MB in the beginning and 321.2MB in the end (delta: -207.7MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. [2025-03-04 00:44:23,033 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:44:23,034 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.01ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 99.5MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:44:23,034 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.11ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 96.1MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:44:23,034 INFO L158 Benchmark]: Boogie Preprocessor took 51.14ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 92.9MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:44:23,034 INFO L158 Benchmark]: IcfgBuilder took 407.31ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 69.1MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 00:44:23,034 INFO L158 Benchmark]: TraceAbstraction took 6004.49ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 68.2MB in the beginning and 321.2MB in the end (delta: -253.0MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2025-03-04 00:44:23,035 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 411.0MB. Free memory was 321.2MB in the beginning and 321.2MB in the end (delta: 81.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:44:23,036 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.48ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.01ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 99.5MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.11ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 96.1MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.14ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 92.9MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 407.31ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 69.1MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6004.49ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 68.2MB in the beginning and 321.2MB in the end (delta: -253.0MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 411.0MB. Free memory was 321.2MB in the beginning and 321.2MB in the end (delta: 81.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 55, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryFLOATComparisonOperation at line 125, overapproximation of someBinaryFLOATComparisonOperation at line 125, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryArithmeticFLOAToperation at line 61, overapproximation of someUnaryFLOAToperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_8 = 0; [L24] unsigned long int var_1_9 = 10; [L25] float var_1_10 = 99.5; [L26] float var_1_11 = 5.6; [L27] float var_1_12 = 255.5; [L28] float var_1_13 = 31.25; [L29] signed short int var_1_14 = 32; [L30] unsigned long int var_1_15 = 16; [L31] unsigned char var_1_16 = 1; [L32] unsigned char var_1_17 = 5; [L33] unsigned char var_1_18 = 50; [L34] unsigned char var_1_19 = 50; [L35] signed char var_1_20 = 1; [L36] signed char var_1_21 = -10; [L37] float var_1_22 = 0.5; [L38] signed char var_1_23 = 100; [L39] unsigned char last_1_var_1_1 = 0; [L40] unsigned long int last_1_var_1_9 = 10; [L41] signed short int last_1_var_1_14 = 32; [L42] unsigned char last_1_var_1_16 = 1; [L43] signed char last_1_var_1_20 = 1; VAL [isInitial=0, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=0, var_1_9=10] [L129] isInitial = 1 [L130] FCALL initially() [L131] COND TRUE 1 [L132] CALL updateLastVariables() [L118] last_1_var_1_1 = var_1_1 [L119] last_1_var_1_9 = var_1_9 [L120] last_1_var_1_14 = var_1_14 [L121] last_1_var_1_16 = var_1_16 [L122] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=0, var_1_9=10] [L132] RET updateLastVariables() [L133] CALL updateVariables() [L90] var_1_8 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L91] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L92] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L92] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L93] var_1_11 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L94] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L95] var_1_12 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L96] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L97] var_1_13 = __VERIFIER_nondet_float() [L98] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L98] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L99] var_1_15 = __VERIFIER_nondet_ulong() [L100] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L100] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L101] CALL assume_abort_if_not(var_1_15 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L101] RET assume_abort_if_not(var_1_15 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L102] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L102] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L103] var_1_17 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L104] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L105] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L105] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L106] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=-254, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=-254, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L106] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=-254, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L107] var_1_18 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=-254, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=-254, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L108] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=-254, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L109] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L109] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L110] var_1_19 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L111] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L112] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L112] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L113] var_1_21 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L114] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L115] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L115] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L133] RET updateVariables() [L134] CALL step() [L47] unsigned char stepLocal_1 = last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16); [L48] signed long int stepLocal_0 = last_1_var_1_20 * last_1_var_1_20; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L49] COND FALSE !(stepLocal_0 == last_1_var_1_14) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L54] unsigned long int stepLocal_6 = ((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=5, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L55] EXPR 256u << last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=5, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L55] COND TRUE stepLocal_6 <= (256u << last_1_var_1_16) [L56] var_1_16 = ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L58] unsigned char stepLocal_5 = var_1_16 != var_1_16; [L59] unsigned char stepLocal_4 = var_1_8; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_4=1, stepLocal_5=0, var_1_10=199/2, var_1_14=32, var_1_15=4294967302, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L60] COND TRUE (! var_1_1) || stepLocal_4 [L61] var_1_10 = (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=4294967302, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L69] var_1_20 = var_1_21 [L70] var_1_22 = var_1_12 [L71] var_1_23 = var_1_21 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=4294967302, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L72] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=4294967302, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L75] EXPR (var_1_16 / var_1_15) & var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=4294967302, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L75] COND TRUE ((var_1_16 / var_1_15) & var_1_16) >= var_1_20 [L76] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=5, var_1_15=4294967302, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L81] unsigned char stepLocal_3 = var_1_20 != var_1_14; [L82] signed long int stepLocal_2 = (((var_1_16) < (0)) ? (var_1_16) : (0)); VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_3=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=5, var_1_15=4294967302, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L83] COND TRUE (var_1_1 || (var_1_16 <= var_1_14)) || stepLocal_3 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=5, var_1_15=4294967302, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L84] COND TRUE stepLocal_2 <= (-5 + var_1_16) [L85] var_1_9 = var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=5, var_1_15=4294967302, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=5] [L134] RET step() [L135] CALL, EXPR property() [L125] EXPR (((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128)))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=5, var_1_15=4294967302, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=5] [L125] EXPR ((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=5, var_1_15=4294967302, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=5] [L125-L126] return (((((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1)) && (var_1_20 == ((signed char) var_1_21))) && (var_1_22 == ((float) var_1_12))) && (var_1_23 == ((signed char) var_1_21)) ; [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=5, var_1_15=4294967302, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=5, var_1_15=4294967302, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 8, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1038 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1036 mSDsluCounter, 2805 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1851 mSDsCounter, 490 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1834 IncrementalHoareTripleChecker+Invalid, 2324 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 490 mSolverCounterUnsat, 954 mSDtfsCounter, 1834 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 433 GetRequests, 365 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=446occurred in iteration=4, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 408 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1310 NumberOfCodeBlocks, 1310 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1178 ConstructedInterpolants, 0 QuantifiedInterpolants, 2103 SizeOfPredicates, 5 NumberOfNonLiveVariables, 601 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 5399/5440 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-04 00:44:23,055 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_operatoramount_amount50_file-53.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 48ff97b9a3af78a737a84e658c15b8d38a46f0a552b076decd87f4d89ed81dac --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:44:24,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:44:24,971 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:44:24,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:44:24,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:44:24,995 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:44:24,996 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:44:24,996 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:44:24,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:44:24,996 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:44:24,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:44:24,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:44:24,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:44:24,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:44:24,997 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:44:24,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:44:24,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:44:24,997 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:44:24,997 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:44:24,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:44:24,997 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:44:24,997 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:44:24,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:44:24,997 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:44:24,997 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:44:24,997 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:44:24,997 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:44:24,997 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:44:24,997 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:44:24,998 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:44:24,998 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:44:24,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:44:24,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:44:24,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:44:24,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:44:24,998 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:44:24,998 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:44:24,998 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:44:24,998 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:44:24,998 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:44:24,998 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:44:24,998 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:44:24,998 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:44:24,998 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:44:24,998 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:44:24,998 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 -> 48ff97b9a3af78a737a84e658c15b8d38a46f0a552b076decd87f4d89ed81dac [2025-03-04 00:44:25,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:44:25,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:44:25,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:44:25,247 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:44:25,247 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:44:25,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-53.i [2025-03-04 00:44:26,438 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/319fd9640/0916062c71ff46649996af89f99d9ff2/FLAG2dde72f04 [2025-03-04 00:44:26,636 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:44:26,636 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-53.i [2025-03-04 00:44:26,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/319fd9640/0916062c71ff46649996af89f99d9ff2/FLAG2dde72f04 [2025-03-04 00:44:26,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/319fd9640/0916062c71ff46649996af89f99d9ff2 [2025-03-04 00:44:26,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:44:26,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:44:26,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:44:26,667 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:44:26,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:44:26,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:44:26" (1/1) ... [2025-03-04 00:44:26,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76411fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:26, skipping insertion in model container [2025-03-04 00:44:26,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:44:26" (1/1) ... [2025-03-04 00:44:26,689 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:44:26,797 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_operatoramount_amount50_file-53.i[915,928] [2025-03-04 00:44:26,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:44:26,869 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:44:26,877 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_operatoramount_amount50_file-53.i[915,928] [2025-03-04 00:44:26,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:44:26,908 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:44:26,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:26 WrapperNode [2025-03-04 00:44:26,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:44:26,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:44:26,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:44:26,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:44:26,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:26" (1/1) ... [2025-03-04 00:44:26,922 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:26" (1/1) ... [2025-03-04 00:44:26,945 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2025-03-04 00:44:26,946 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:44:26,946 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:44:26,946 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:44:26,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:44:26,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:26" (1/1) ... [2025-03-04 00:44:26,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:26" (1/1) ... [2025-03-04 00:44:26,965 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:26" (1/1) ... [2025-03-04 00:44:26,981 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-04 00:44:26,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:26" (1/1) ... [2025-03-04 00:44:26,981 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:26" (1/1) ... [2025-03-04 00:44:26,989 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:26" (1/1) ... [2025-03-04 00:44:26,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:26" (1/1) ... [2025-03-04 00:44:26,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:26" (1/1) ... [2025-03-04 00:44:26,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:26" (1/1) ... [2025-03-04 00:44:26,998 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:44:27,002 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:44:27,002 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:44:27,002 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:44:27,003 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:26" (1/1) ... [2025-03-04 00:44:27,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:44:27,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:44:27,033 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-04 00:44:27,035 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-04 00:44:27,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:44:27,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:44:27,053 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:44:27,053 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:44:27,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:44:27,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:44:27,113 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:44:27,115 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:44:27,671 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-04 00:44:27,671 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:44:27,681 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:44:27,681 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:44:27,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:44:27 BoogieIcfgContainer [2025-03-04 00:44:27,681 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:44:27,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:44:27,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:44:27,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:44:27,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:44:26" (1/3) ... [2025-03-04 00:44:27,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9c1fc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:44:27, skipping insertion in model container [2025-03-04 00:44:27,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:26" (2/3) ... [2025-03-04 00:44:27,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9c1fc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:44:27, skipping insertion in model container [2025-03-04 00:44:27,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:44:27" (3/3) ... [2025-03-04 00:44:27,689 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-53.i [2025-03-04 00:44:27,714 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:44:27,715 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-53.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:44:27,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:44:27,759 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;@980298d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:44:27,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:44:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 00:44:27,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 00:44:27,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:44:27,771 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:44:27,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:44:27,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:44:27,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1675590469, now seen corresponding path program 1 times [2025-03-04 00:44:27,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:44:27,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959828427] [2025-03-04 00:44:27,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:27,784 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-04 00:44:27,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:44:27,787 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-04 00:44:27,790 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-04 00:44:27,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 00:44:28,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 00:44:28,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:28,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:44:28,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:44:28,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:44:28,061 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-03-04 00:44:28,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:44:28,061 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:44:28,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959828427] [2025-03-04 00:44:28,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [959828427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:44:28,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:44:28,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:44:28,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400405160] [2025-03-04 00:44:28,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:44:28,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:44:28,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:44:28,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:44:28,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:44:28,082 INFO L87 Difference]: Start difference. First operand has 57 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 00:44:28,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:44:28,099 INFO L93 Difference]: Finished difference Result 108 states and 180 transitions. [2025-03-04 00:44:28,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:44:28,101 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 112 [2025-03-04 00:44:28,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:44:28,106 INFO L225 Difference]: With dead ends: 108 [2025-03-04 00:44:28,106 INFO L226 Difference]: Without dead ends: 54 [2025-03-04 00:44:28,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 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-04 00:44:28,112 INFO L435 NwaCegarLoop]: 79 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, 79 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-04 00:44:28,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:44:28,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-04 00:44:28,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-04 00:44:28,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 00:44:28,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2025-03-04 00:44:28,145 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 112 [2025-03-04 00:44:28,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:44:28,145 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2025-03-04 00:44:28,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 00:44:28,145 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2025-03-04 00:44:28,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 00:44:28,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:44:28,148 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:44:28,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:44:28,348 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-04 00:44:28,349 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:44:28,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:44:28,349 INFO L85 PathProgramCache]: Analyzing trace with hash 49971040, now seen corresponding path program 1 times [2025-03-04 00:44:28,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:44:28,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038130089] [2025-03-04 00:44:28,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:28,350 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-04 00:44:28,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:44:28,352 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-04 00:44:28,354 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-04 00:44:28,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 00:44:28,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 00:44:28,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:28,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:44:28,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 00:44:28,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:44:28,568 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 00:44:28,568 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:44:28,568 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:44:28,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038130089] [2025-03-04 00:44:28,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038130089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:44:28,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:44:28,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:44:28,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506075192] [2025-03-04 00:44:28,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:44:28,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:44:28,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:44:28,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:44:28,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:44:28,570 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 00:44:28,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:44:28,890 INFO L93 Difference]: Finished difference Result 154 states and 227 transitions. [2025-03-04 00:44:28,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:44:28,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 112 [2025-03-04 00:44:28,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:44:28,893 INFO L225 Difference]: With dead ends: 154 [2025-03-04 00:44:28,893 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 00:44:28,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 110 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-04 00:44:28,894 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 68 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:44:28,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 200 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:44:28,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 00:44:28,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2025-03-04 00:44:28,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 64 states have (on average 1.25) internal successors, (80), 64 states have internal predecessors, (80), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 00:44:28,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 148 transitions. [2025-03-04 00:44:28,910 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 148 transitions. Word has length 112 [2025-03-04 00:44:28,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:44:28,910 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 148 transitions. [2025-03-04 00:44:28,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 00:44:28,911 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 148 transitions. [2025-03-04 00:44:28,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 00:44:28,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:44:28,912 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:44:28,920 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-04 00:44:29,112 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-04 00:44:29,112 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:44:29,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:44:29,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1521458151, now seen corresponding path program 1 times [2025-03-04 00:44:29,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:44:29,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783825700] [2025-03-04 00:44:29,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:29,113 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-04 00:44:29,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:44:29,115 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-04 00:44:29,117 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-04 00:44:29,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 00:44:29,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 00:44:29,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:29,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:44:29,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 00:44:29,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:44:29,483 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 00:44:29,483 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:44:29,483 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:44:29,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783825700] [2025-03-04 00:44:29,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783825700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:44:29,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:44:29,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:44:29,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471976417] [2025-03-04 00:44:29,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:44:29,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:44:29,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:44:29,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:44:29,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:44:29,484 INFO L87 Difference]: Start difference. First operand 101 states and 148 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 00:44:29,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:44:29,753 INFO L93 Difference]: Finished difference Result 207 states and 303 transitions. [2025-03-04 00:44:29,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:44:29,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 113 [2025-03-04 00:44:29,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:44:29,754 INFO L225 Difference]: With dead ends: 207 [2025-03-04 00:44:29,754 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 00:44:29,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 111 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-04 00:44:29,756 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 17 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:44:29,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 142 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:44:29,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 00:44:29,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2025-03-04 00:44:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 00:44:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2025-03-04 00:44:29,766 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 113 [2025-03-04 00:44:29,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:44:29,767 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2025-03-04 00:44:29,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 00:44:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2025-03-04 00:44:29,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 00:44:29,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:44:29,772 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:44:29,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:44:29,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:44:29,973 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:44:29,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:44:29,973 INFO L85 PathProgramCache]: Analyzing trace with hash -5009209, now seen corresponding path program 1 times [2025-03-04 00:44:29,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:44:29,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491428333] [2025-03-04 00:44:29,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:29,974 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-04 00:44:29,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:44:29,975 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:44:29,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 00:44:30,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 00:44:30,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 00:44:30,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:30,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:44:30,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 00:44:30,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:44:30,180 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 00:44:30,181 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:44:30,181 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:44:30,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491428333] [2025-03-04 00:44:30,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1491428333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:44:30,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:44:30,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:44:30,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817098217] [2025-03-04 00:44:30,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:44:30,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:44:30,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:44:30,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:44:30,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:44:30,184 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 00:44:30,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:44:30,495 INFO L93 Difference]: Finished difference Result 270 states and 392 transitions. [2025-03-04 00:44:30,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:44:30,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 113 [2025-03-04 00:44:30,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:44:30,499 INFO L225 Difference]: With dead ends: 270 [2025-03-04 00:44:30,499 INFO L226 Difference]: Without dead ends: 166 [2025-03-04 00:44:30,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 111 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-04 00:44:30,500 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 70 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:44:30,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 212 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:44:30,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-04 00:44:30,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 109. [2025-03-04 00:44:30,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 72 states have internal predecessors, (89), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 00:44:30,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-03-04 00:44:30,514 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 113 [2025-03-04 00:44:30,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:44:30,514 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-03-04 00:44:30,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 00:44:30,514 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-03-04 00:44:30,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 00:44:30,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:44:30,519 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:44:30,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 00:44:30,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:44:30,719 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:44:30,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:44:30,720 INFO L85 PathProgramCache]: Analyzing trace with hash 882494472, now seen corresponding path program 1 times [2025-03-04 00:44:30,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:44:30,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218966354] [2025-03-04 00:44:30,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:30,720 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-04 00:44:30,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:44:30,722 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:44:30,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-04 00:44:30,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 00:44:30,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 00:44:30,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:30,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:44:30,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 00:44:30,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:44:30,999 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 106 proven. 3 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 00:44:31,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:44:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 00:44:31,217 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:44:31,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218966354] [2025-03-04 00:44:31,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218966354] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:44:31,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:44:31,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2025-03-04 00:44:31,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007408098] [2025-03-04 00:44:31,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:44:31,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 00:44:31,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:44:31,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 00:44:31,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:44:31,219 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 00:44:32,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:44:32,567 INFO L93 Difference]: Finished difference Result 342 states and 481 transitions. [2025-03-04 00:44:32,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 00:44:32,571 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 113 [2025-03-04 00:44:32,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:44:32,573 INFO L225 Difference]: With dead ends: 342 [2025-03-04 00:44:32,573 INFO L226 Difference]: Without dead ends: 236 [2025-03-04 00:44:32,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=724, Unknown=0, NotChecked=0, Total=992 [2025-03-04 00:44:32,579 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 197 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:44:32,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 407 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 00:44:32,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-04 00:44:32,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 115. [2025-03-04 00:44:32,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 76 states have (on average 1.2105263157894737) internal successors, (92), 76 states have internal predecessors, (92), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 00:44:32,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 160 transitions. [2025-03-04 00:44:32,613 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 160 transitions. Word has length 113 [2025-03-04 00:44:32,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:44:32,613 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 160 transitions. [2025-03-04 00:44:32,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 00:44:32,613 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 160 transitions. [2025-03-04 00:44:32,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 00:44:32,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:44:32,614 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:44:32,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-04 00:44:32,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:44:32,815 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:44:32,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:44:32,815 INFO L85 PathProgramCache]: Analyzing trace with hash -703445148, now seen corresponding path program 1 times [2025-03-04 00:44:32,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:44:32,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243077115] [2025-03-04 00:44:32,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:32,816 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-04 00:44:32,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:44:32,818 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:44:32,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-04 00:44:32,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 00:44:32,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 00:44:32,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:32,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:44:32,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:44:32,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:44:33,341 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 00:44:33,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:44:33,341 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:44:33,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243077115] [2025-03-04 00:44:33,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243077115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:44:33,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:44:33,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:44:33,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111192429] [2025-03-04 00:44:33,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:44:33,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:44:33,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:44:33,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:44:33,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:44:33,342 INFO L87 Difference]: Start difference. First operand 115 states and 160 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 00:44:34,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:44:34,019 INFO L93 Difference]: Finished difference Result 281 states and 390 transitions. [2025-03-04 00:44:34,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:44:34,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 114 [2025-03-04 00:44:34,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:44:34,031 INFO L225 Difference]: With dead ends: 281 [2025-03-04 00:44:34,031 INFO L226 Difference]: Without dead ends: 169 [2025-03-04 00:44:34,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:44:34,032 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 43 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:44:34,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 249 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:44:34,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-04 00:44:34,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2025-03-04 00:44:34,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 94 states have (on average 1.1702127659574468) internal successors, (110), 94 states have internal predecessors, (110), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 00:44:34,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 212 transitions. [2025-03-04 00:44:34,060 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 212 transitions. Word has length 114 [2025-03-04 00:44:34,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:44:34,060 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 212 transitions. [2025-03-04 00:44:34,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 00:44:34,061 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 212 transitions. [2025-03-04 00:44:34,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 00:44:34,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:44:34,062 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:44:34,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-04 00:44:34,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:44:34,262 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:44:34,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:44:34,263 INFO L85 PathProgramCache]: Analyzing trace with hash -182929568, now seen corresponding path program 1 times [2025-03-04 00:44:34,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:44:34,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785616047] [2025-03-04 00:44:34,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:34,263 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-04 00:44:34,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:44:34,265 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:44:34,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-04 00:44:34,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 00:44:34,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 00:44:34,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:34,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:44:34,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 00:44:34,429 INFO L279 TraceCheckSpWp]: Computing forward predicates...