./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-5.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 ea5a8604b55ac7b733e3a58d5b1561195fe1a5472f19acdcc847503296ba06a2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:39:57,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:39:57,973 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:39:57,977 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:39:57,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:39:57,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:39:58,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:39:58,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:39:58,001 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:39:58,001 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:39:58,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:39:58,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:39:58,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:39:58,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:39:58,002 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:39:58,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:39:58,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:39:58,003 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:39:58,003 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:39:58,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:39:58,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:39:58,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:39:58,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:39:58,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:39:58,004 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:39:58,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:39:58,004 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:39:58,004 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:39:58,004 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:39:58,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:39:58,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:39:58,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:39:58,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:39:58,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:39:58,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:39:58,005 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:39:58,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:39:58,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:39:58,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:39:58,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:39:58,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:39:58,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:39:58,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:39:58,005 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 -> ea5a8604b55ac7b733e3a58d5b1561195fe1a5472f19acdcc847503296ba06a2 [2025-03-17 03:39:58,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:39:58,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:39:58,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:39:58,240 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:39:58,241 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:39:58,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-5.i [2025-03-17 03:39:59,397 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/170551aee/97cfee579ef2495b917272e41b82fd25/FLAGcd5a1f674 [2025-03-17 03:39:59,651 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:39:59,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-5.i [2025-03-17 03:39:59,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/170551aee/97cfee579ef2495b917272e41b82fd25/FLAGcd5a1f674 [2025-03-17 03:39:59,963 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/170551aee/97cfee579ef2495b917272e41b82fd25 [2025-03-17 03:39:59,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:39:59,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:39:59,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:39:59,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:39:59,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:39:59,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:39:59" (1/1) ... [2025-03-17 03:39:59,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34ab434f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:39:59, skipping insertion in model container [2025-03-17 03:39:59,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:39:59" (1/1) ... [2025-03-17 03:39:59,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:40:00,081 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-5.i[914,927] [2025-03-17 03:40:00,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:40:00,128 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:40:00,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-5.i[914,927] [2025-03-17 03:40:00,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:40:00,180 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:40:00,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:00 WrapperNode [2025-03-17 03:40:00,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:40:00,182 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:40:00,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:40:00,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:40:00,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:00" (1/1) ... [2025-03-17 03:40:00,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:00" (1/1) ... [2025-03-17 03:40:00,227 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2025-03-17 03:40:00,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:40:00,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:40:00,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:40:00,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:40:00,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:00" (1/1) ... [2025-03-17 03:40:00,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:00" (1/1) ... [2025-03-17 03:40:00,236 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:00" (1/1) ... [2025-03-17 03:40:00,245 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:40:00,246 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:00" (1/1) ... [2025-03-17 03:40:00,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:00" (1/1) ... [2025-03-17 03:40:00,249 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:00" (1/1) ... [2025-03-17 03:40:00,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:00" (1/1) ... [2025-03-17 03:40:00,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:00" (1/1) ... [2025-03-17 03:40:00,251 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:00" (1/1) ... [2025-03-17 03:40:00,253 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:40:00,258 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:40:00,260 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:40:00,260 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:40:00,261 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:00" (1/1) ... [2025-03-17 03:40:00,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:40:00,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:40:00,287 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:40:00,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:40:00,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:40:00,308 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:40:00,308 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:40:00,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:40:00,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:40:00,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:40:00,365 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:40:00,366 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:40:00,569 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 03:40:00,572 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:40:00,580 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:40:00,582 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:40:00,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:40:00 BoogieIcfgContainer [2025-03-17 03:40:00,582 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:40:00,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:40:00,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:40:00,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:40:00,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:39:59" (1/3) ... [2025-03-17 03:40:00,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6014bd0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:40:00, skipping insertion in model container [2025-03-17 03:40:00,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:00" (2/3) ... [2025-03-17 03:40:00,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6014bd0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:40:00, skipping insertion in model container [2025-03-17 03:40:00,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:40:00" (3/3) ... [2025-03-17 03:40:00,590 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-5.i [2025-03-17 03:40:00,599 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:40:00,600 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-5.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:40:00,634 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:40:00,641 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;@49bb08bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:40:00,642 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:40:00,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 03:40:00,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 03:40:00,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:40:00,651 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:40:00,651 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:40:00,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:40:00,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1543599449, now seen corresponding path program 1 times [2025-03-17 03:40:00,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:40:00,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225021620] [2025-03-17 03:40:00,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:40:00,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:40:00,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 03:40:00,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 03:40:00,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:40:00,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:40:00,817 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 03:40:00,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:40:00,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225021620] [2025-03-17 03:40:00,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225021620] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:40:00,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516498078] [2025-03-17 03:40:00,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:40:00,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:40:00,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:40:00,822 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:40:00,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 03:40:00,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 03:40:00,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 03:40:00,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:40:00,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:40:00,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:40:00,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:40:00,948 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 03:40:00,951 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:40:00,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516498078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:40:00,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:40:00,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:40:00,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625615602] [2025-03-17 03:40:00,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:40:00,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:40:00,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:40:00,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:40:00,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:40:00,977 INFO L87 Difference]: Start difference. First operand has 43 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 03:40:00,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:40:00,993 INFO L93 Difference]: Finished difference Result 83 states and 140 transitions. [2025-03-17 03:40:00,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:40:00,994 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 89 [2025-03-17 03:40:00,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:40:00,998 INFO L225 Difference]: With dead ends: 83 [2025-03-17 03:40:00,998 INFO L226 Difference]: Without dead ends: 41 [2025-03-17 03:40:01,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:40:01,002 INFO L435 NwaCegarLoop]: 60 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, 60 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:40:01,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:40:01,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-17 03:40:01,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-17 03:40:01,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 03:40:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2025-03-17 03:40:01,029 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 89 [2025-03-17 03:40:01,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:40:01,029 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2025-03-17 03:40:01,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 03:40:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2025-03-17 03:40:01,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 03:40:01,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:40:01,033 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:40:01,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 03:40:01,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 03:40:01,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:40:01,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:40:01,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1454879929, now seen corresponding path program 1 times [2025-03-17 03:40:01,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:40:01,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298196242] [2025-03-17 03:40:01,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:40:01,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:40:01,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 03:40:01,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 03:40:01,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:40:01,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:40:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 03:40:02,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:40:02,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298196242] [2025-03-17 03:40:02,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298196242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:40:02,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:40:02,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:40:02,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467559324] [2025-03-17 03:40:02,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:40:02,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:40:02,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:40:02,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:40:02,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:40:02,078 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 03:40:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:40:02,180 INFO L93 Difference]: Finished difference Result 110 states and 159 transitions. [2025-03-17 03:40:02,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:40:02,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2025-03-17 03:40:02,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:40:02,182 INFO L225 Difference]: With dead ends: 110 [2025-03-17 03:40:02,183 INFO L226 Difference]: Without dead ends: 70 [2025-03-17 03:40:02,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:40:02,185 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 35 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:40:02,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 185 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:40:02,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-17 03:40:02,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2025-03-17 03:40:02,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:40:02,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 97 transitions. [2025-03-17 03:40:02,223 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 97 transitions. Word has length 89 [2025-03-17 03:40:02,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:40:02,225 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 97 transitions. [2025-03-17 03:40:02,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 03:40:02,225 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 97 transitions. [2025-03-17 03:40:02,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 03:40:02,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:40:02,226 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:40:02,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:40:02,227 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:40:02,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:40:02,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1454909720, now seen corresponding path program 1 times [2025-03-17 03:40:02,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:40:02,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811363062] [2025-03-17 03:40:02,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:40:02,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:40:02,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 03:40:02,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 03:40:02,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:40:02,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:40:04,057 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 03:40:04,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:40:04,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811363062] [2025-03-17 03:40:04,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811363062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:40:04,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:40:04,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 03:40:04,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851909184] [2025-03-17 03:40:04,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:40:04,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:40:04,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:40:04,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:40:04,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:40:04,059 INFO L87 Difference]: Start difference. First operand 67 states and 97 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 03:40:04,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:40:04,603 INFO L93 Difference]: Finished difference Result 143 states and 202 transitions. [2025-03-17 03:40:04,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 03:40:04,603 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2025-03-17 03:40:04,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:40:04,607 INFO L225 Difference]: With dead ends: 143 [2025-03-17 03:40:04,607 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 03:40:04,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:40:04,609 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 89 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:40:04,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 172 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:40:04,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 03:40:04,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2025-03-17 03:40:04,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 80 states have (on average 1.2) internal successors, (96), 82 states have internal predecessors, (96), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 03:40:04,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 192 transitions. [2025-03-17 03:40:04,634 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 192 transitions. Word has length 89 [2025-03-17 03:40:04,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:40:04,635 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 192 transitions. [2025-03-17 03:40:04,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 03:40:04,635 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 192 transitions. [2025-03-17 03:40:04,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 03:40:04,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:40:04,636 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:40:04,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:40:04,636 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:40:04,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:40:04,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1483538871, now seen corresponding path program 1 times [2025-03-17 03:40:04,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:40:04,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821212563] [2025-03-17 03:40:04,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:40:04,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:40:04,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 03:40:04,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 03:40:04,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:40:04,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:40:04,698 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 03:40:04,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:40:04,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821212563] [2025-03-17 03:40:04,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821212563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:40:04,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:40:04,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:40:04,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986000331] [2025-03-17 03:40:04,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:40:04,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:40:04,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:40:04,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:40:04,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:40:04,701 INFO L87 Difference]: Start difference. First operand 133 states and 192 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 03:40:04,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:40:04,723 INFO L93 Difference]: Finished difference Result 261 states and 378 transitions. [2025-03-17 03:40:04,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:40:04,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2025-03-17 03:40:04,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:40:04,725 INFO L225 Difference]: With dead ends: 261 [2025-03-17 03:40:04,725 INFO L226 Difference]: Without dead ends: 129 [2025-03-17 03:40:04,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:40:04,726 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 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-17 03:40:04,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:40:04,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-17 03:40:04,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-17 03:40:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 76 states have (on average 1.144736842105263) internal successors, (87), 78 states have internal predecessors, (87), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 03:40:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 183 transitions. [2025-03-17 03:40:04,745 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 183 transitions. Word has length 89 [2025-03-17 03:40:04,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:40:04,745 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 183 transitions. [2025-03-17 03:40:04,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 03:40:04,745 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 183 transitions. [2025-03-17 03:40:04,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 03:40:04,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:40:04,746 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:40:04,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:40:04,747 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:40:04,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:40:04,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1097277032, now seen corresponding path program 1 times [2025-03-17 03:40:04,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:40:04,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434073599] [2025-03-17 03:40:04,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:40:04,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:40:04,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 03:40:04,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 03:40:04,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:40:04,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:40:04,805 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 03:40:04,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:40:04,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434073599] [2025-03-17 03:40:04,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434073599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:40:04,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:40:04,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:40:04,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556454] [2025-03-17 03:40:04,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:40:04,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:40:04,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:40:04,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:40:04,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:40:04,808 INFO L87 Difference]: Start difference. First operand 129 states and 183 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 03:40:04,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:40:04,829 INFO L93 Difference]: Finished difference Result 228 states and 322 transitions. [2025-03-17 03:40:04,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:40:04,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2025-03-17 03:40:04,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:40:04,834 INFO L225 Difference]: With dead ends: 228 [2025-03-17 03:40:04,834 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 03:40:04,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:40:04,836 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 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-17 03:40:04,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:40:04,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 03:40:04,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-17 03:40:04,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 57 states have (on average 1.087719298245614) internal successors, (62), 58 states have internal predecessors, (62), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 03:40:04,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2025-03-17 03:40:04,857 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 89 [2025-03-17 03:40:04,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:40:04,858 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2025-03-17 03:40:04,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 03:40:04,859 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2025-03-17 03:40:04,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 03:40:04,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:40:04,860 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:40:04,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 03:40:04,860 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:40:04,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:40:04,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1002505111, now seen corresponding path program 1 times [2025-03-17 03:40:04,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:40:04,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481421439] [2025-03-17 03:40:04,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:40:04,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:40:04,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 03:40:04,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 03:40:04,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:40:04,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:40:05,925 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 03:40:05,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:40:05,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481421439] [2025-03-17 03:40:05,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481421439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:40:05,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:40:05,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 03:40:05,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586977440] [2025-03-17 03:40:05,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:40:05,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:40:05,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:40:05,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:40:05,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:40:05,927 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 03:40:06,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:40:06,218 INFO L93 Difference]: Finished difference Result 119 states and 157 transitions. [2025-03-17 03:40:06,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 03:40:06,219 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 90 [2025-03-17 03:40:06,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:40:06,220 INFO L225 Difference]: With dead ends: 119 [2025-03-17 03:40:06,220 INFO L226 Difference]: Without dead ends: 117 [2025-03-17 03:40:06,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:40:06,220 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 18 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:40:06,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 332 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:40:06,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-17 03:40:06,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2025-03-17 03:40:06,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 66 states have internal predecessors, (70), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 03:40:06,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2025-03-17 03:40:06,240 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 146 transitions. Word has length 90 [2025-03-17 03:40:06,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:40:06,241 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 146 transitions. [2025-03-17 03:40:06,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 03:40:06,241 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 146 transitions. [2025-03-17 03:40:06,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 03:40:06,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:40:06,244 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:40:06,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 03:40:06,244 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:40:06,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:40:06,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1221138044, now seen corresponding path program 1 times [2025-03-17 03:40:06,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:40:06,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513123450] [2025-03-17 03:40:06,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:40:06,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:40:06,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 03:40:06,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 03:40:06,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:40:06,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:40:07,081 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 03:40:07,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:40:07,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513123450] [2025-03-17 03:40:07,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513123450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:40:07,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:40:07,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 03:40:07,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666164604] [2025-03-17 03:40:07,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:40:07,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 03:40:07,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:40:07,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 03:40:07,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:40:07,083 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 03:40:07,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:40:07,234 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2025-03-17 03:40:07,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 03:40:07,234 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2025-03-17 03:40:07,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:40:07,235 INFO L225 Difference]: With dead ends: 132 [2025-03-17 03:40:07,235 INFO L226 Difference]: Without dead ends: 130 [2025-03-17 03:40:07,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-17 03:40:07,236 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 36 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:40:07,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 226 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:40:07,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-17 03:40:07,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 108. [2025-03-17 03:40:07,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 66 states have internal predecessors, (70), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 03:40:07,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2025-03-17 03:40:07,248 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 146 transitions. Word has length 91 [2025-03-17 03:40:07,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:40:07,250 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 146 transitions. [2025-03-17 03:40:07,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 03:40:07,250 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 146 transitions. [2025-03-17 03:40:07,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 03:40:07,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:40:07,251 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:40:07,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 03:40:07,252 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:40:07,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:40:07,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1024624539, now seen corresponding path program 1 times [2025-03-17 03:40:07,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:40:07,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843029857] [2025-03-17 03:40:07,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:40:07,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:40:07,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 03:40:07,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 03:40:07,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:40:07,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:40:08,768 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 03:40:08,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:40:08,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843029857] [2025-03-17 03:40:08,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843029857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:40:08,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:40:08,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 03:40:08,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834825771] [2025-03-17 03:40:08,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:40:08,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 03:40:08,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:40:08,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 03:40:08,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:40:08,770 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 03:40:09,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:40:09,262 INFO L93 Difference]: Finished difference Result 128 states and 167 transitions. [2025-03-17 03:40:09,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 03:40:09,264 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2025-03-17 03:40:09,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:40:09,266 INFO L225 Difference]: With dead ends: 128 [2025-03-17 03:40:09,266 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 03:40:09,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2025-03-17 03:40:09,267 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 22 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:40:09,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 238 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:40:09,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 03:40:09,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 03:40:09,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 03:40:09,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 03:40:09,268 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2025-03-17 03:40:09,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:40:09,268 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 03:40:09,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 03:40:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 03:40:09,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 03:40:09,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:40:09,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 03:40:09,274 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:40:09,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 03:40:09,813 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:40:09,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:40:09 BoogieIcfgContainer [2025-03-17 03:40:09,828 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:40:09,828 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:40:09,828 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:40:09,828 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:40:09,829 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:40:00" (3/4) ... [2025-03-17 03:40:09,830 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 03:40:09,835 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 03:40:09,838 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-17 03:40:09,838 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 03:40:09,838 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 03:40:09,838 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 03:40:09,900 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 03:40:09,900 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 03:40:09,900 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:40:09,901 INFO L158 Benchmark]: Toolchain (without parser) took 9934.72ms. Allocated memory was 167.8MB in the beginning and 494.9MB in the end (delta: 327.2MB). Free memory was 132.5MB in the beginning and 388.5MB in the end (delta: -256.0MB). Peak memory consumption was 66.8MB. Max. memory is 16.1GB. [2025-03-17 03:40:09,901 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:40:09,901 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.81ms. Allocated memory is still 167.8MB. Free memory was 132.5MB in the beginning and 119.9MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:40:09,902 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.31ms. Allocated memory is still 167.8MB. Free memory was 119.9MB in the beginning and 117.3MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:40:09,902 INFO L158 Benchmark]: Boogie Preprocessor took 25.53ms. Allocated memory is still 167.8MB. Free memory was 117.3MB in the beginning and 113.4MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:40:09,903 INFO L158 Benchmark]: IcfgBuilder took 324.74ms. Allocated memory is still 167.8MB. Free memory was 113.4MB in the beginning and 96.4MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:40:09,903 INFO L158 Benchmark]: TraceAbstraction took 9244.04ms. Allocated memory was 167.8MB in the beginning and 494.9MB in the end (delta: 327.2MB). Free memory was 95.6MB in the beginning and 392.5MB in the end (delta: -296.9MB). Peak memory consumption was 176.9MB. Max. memory is 16.1GB. [2025-03-17 03:40:09,903 INFO L158 Benchmark]: Witness Printer took 71.89ms. Allocated memory is still 494.9MB. Free memory was 392.5MB in the beginning and 388.5MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:40:09,904 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.15ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.81ms. Allocated memory is still 167.8MB. Free memory was 132.5MB in the beginning and 119.9MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.31ms. Allocated memory is still 167.8MB. Free memory was 119.9MB in the beginning and 117.3MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.53ms. Allocated memory is still 167.8MB. Free memory was 117.3MB in the beginning and 113.4MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 324.74ms. Allocated memory is still 167.8MB. Free memory was 113.4MB in the beginning and 96.4MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9244.04ms. Allocated memory was 167.8MB in the beginning and 494.9MB in the end (delta: 327.2MB). Free memory was 95.6MB in the beginning and 392.5MB in the end (delta: -296.9MB). Peak memory consumption was 176.9MB. Max. memory is 16.1GB. * Witness Printer took 71.89ms. Allocated memory is still 494.9MB. Free memory was 392.5MB in the beginning and 388.5MB in the end (delta: 4.0MB). 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 78 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 8, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 200 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 200 mSDsluCounter, 1435 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 957 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 581 IncrementalHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 478 mSDtfsCounter, 581 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=3, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 42 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 806 NumberOfCodeBlocks, 806 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 797 ConstructedInterpolants, 0 QuantifiedInterpolants, 3108 SizeOfPredicates, 0 NumberOfNonLiveVariables, 217 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 3250/3276 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 95]: Location Invariant Derived location invariant: (((((0 <= 0) && (var_1_8 <= 10)) && ((((var_1_13 == var_1_8) || (var_1_11 != 0)) && ((var_1_11 == 0) || (((var_1_8 == var_1_12) || (((int) var_1_7 + var_1_10) < (((long long) last_1_var_1_8 + var_1_4) + 1))) && ((var_1_13 == var_1_8) || (((long long) last_1_var_1_8 + var_1_4) < ((int) var_1_7 + var_1_10)))))) || (var_1_9 == 0))) || ((var_1_8 == var_1_15) && (var_1_12 <= var_1_8))) || (((var_1_8 + 1) <= var_1_12) && (var_1_15 == var_1_12))) RESULT: Ultimate proved your program to be correct! [2025-03-17 03:40:09,922 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 Writing output log to file Ultimate.log Result: TRUE