./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/sum10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/reducercommutativity/sum10-1.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 f341d659968a9193c951bd8eec2bcf2a384f8494a1f57cb579da98ce5ebdb030 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:23:04,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:23:04,360 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:23:04,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:23:04,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:23:04,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:23:04,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:23:04,389 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:23:04,389 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:23:04,389 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:23:04,390 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:23:04,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:23:04,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:23:04,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:23:04,390 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:23:04,391 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:23:04,391 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:23:04,391 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:23:04,391 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:23:04,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:23:04,391 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:23:04,391 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:23:04,391 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:23:04,391 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:23:04,392 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:23:04,392 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:23:04,392 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:23:04,392 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:23:04,392 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:23:04,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:23:04,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:23:04,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:23:04,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:23:04,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:23:04,393 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:23:04,393 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:23:04,393 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:23:04,393 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:23:04,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:23:04,393 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:23:04,393 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:23:04,393 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:23:04,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:23:04,393 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 -> f341d659968a9193c951bd8eec2bcf2a384f8494a1f57cb579da98ce5ebdb030 [2025-03-08 00:23:04,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:23:04,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:23:04,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:23:04,638 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:23:04,638 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:23:04,639 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sum10-1.i [2025-03-08 00:23:05,856 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48f85771a/9a7ebad05000408486660294c669b2ce/FLAG7030309bd [2025-03-08 00:23:06,089 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:23:06,091 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum10-1.i [2025-03-08 00:23:06,118 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48f85771a/9a7ebad05000408486660294c669b2ce/FLAG7030309bd [2025-03-08 00:23:06,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48f85771a/9a7ebad05000408486660294c669b2ce [2025-03-08 00:23:06,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:23:06,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:23:06,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:23:06,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:23:06,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:23:06,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:23:06" (1/1) ... [2025-03-08 00:23:06,144 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f8d0687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:06, skipping insertion in model container [2025-03-08 00:23:06,144 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:23:06" (1/1) ... [2025-03-08 00:23:06,158 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:23:06,273 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum10-1.i[1277,1290] [2025-03-08 00:23:06,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:23:06,284 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:23:06,304 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/reducercommutativity/sum10-1.i[1277,1290] [2025-03-08 00:23:06,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:23:06,316 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:23:06,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:06 WrapperNode [2025-03-08 00:23:06,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:23:06,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:23:06,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:23:06,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:23:06,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:06" (1/1) ... [2025-03-08 00:23:06,328 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:06" (1/1) ... [2025-03-08 00:23:06,341 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 63 [2025-03-08 00:23:06,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:23:06,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:23:06,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:23:06,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:23:06,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:06" (1/1) ... [2025-03-08 00:23:06,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:06" (1/1) ... [2025-03-08 00:23:06,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:06" (1/1) ... [2025-03-08 00:23:06,362 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-03-08 00:23:06,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:06" (1/1) ... [2025-03-08 00:23:06,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:06" (1/1) ... [2025-03-08 00:23:06,365 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:06" (1/1) ... [2025-03-08 00:23:06,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:06" (1/1) ... [2025-03-08 00:23:06,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:06" (1/1) ... [2025-03-08 00:23:06,367 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:06" (1/1) ... [2025-03-08 00:23:06,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:23:06,369 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:23:06,369 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:23:06,369 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:23:06,370 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:06" (1/1) ... [2025-03-08 00:23:06,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:23:06,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:06,397 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:23:06,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:23:06,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:23:06,419 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2025-03-08 00:23:06,419 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2025-03-08 00:23:06,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:23:06,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:23:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:23:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:23:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:23:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:23:06,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:23:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:23:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:23:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:23:06,476 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:23:06,477 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:23:06,577 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset; [2025-03-08 00:23:06,601 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 00:23:06,601 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:23:06,607 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:23:06,608 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:23:06,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:23:06 BoogieIcfgContainer [2025-03-08 00:23:06,608 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:23:06,611 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:23:06,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:23:06,617 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:23:06,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:23:06" (1/3) ... [2025-03-08 00:23:06,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a433bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:23:06, skipping insertion in model container [2025-03-08 00:23:06,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:06" (2/3) ... [2025-03-08 00:23:06,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a433bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:23:06, skipping insertion in model container [2025-03-08 00:23:06,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:23:06" (3/3) ... [2025-03-08 00:23:06,620 INFO L128 eAbstractionObserver]: Analyzing ICFG sum10-1.i [2025-03-08 00:23:06,635 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:23:06,638 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sum10-1.i that has 2 procedures, 21 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 00:23:06,687 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:23:06,696 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;@42aff7d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:23:06,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:23:06,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:23:06,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:23:06,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:06,703 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:06,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:06,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:06,708 INFO L85 PathProgramCache]: Analyzing trace with hash -871894356, now seen corresponding path program 1 times [2025-03-08 00:23:06,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:06,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399142641] [2025-03-08 00:23:06,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:23:06,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:06,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:23:06,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:23:06,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:23:06,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:06,948 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:23:06,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:06,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399142641] [2025-03-08 00:23:06,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399142641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:23:06,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:23:06,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:23:06,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286234164] [2025-03-08 00:23:06,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:23:06,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:23:06,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:06,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:23:06,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:23:06,975 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:23:07,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:07,004 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2025-03-08 00:23:07,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:23:07,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2025-03-08 00:23:07,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:07,010 INFO L225 Difference]: With dead ends: 40 [2025-03-08 00:23:07,010 INFO L226 Difference]: Without dead ends: 18 [2025-03-08 00:23:07,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:23:07,017 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:07,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:07,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-08 00:23:07,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-08 00:23:07,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:23:07,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-08 00:23:07,049 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 24 [2025-03-08 00:23:07,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:07,049 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-08 00:23:07,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:23:07,050 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-08 00:23:07,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:23:07,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:07,051 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:07,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:23:07,052 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:07,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:07,053 INFO L85 PathProgramCache]: Analyzing trace with hash -753694787, now seen corresponding path program 1 times [2025-03-08 00:23:07,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:07,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619512261] [2025-03-08 00:23:07,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:23:07,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:07,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:23:07,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:23:07,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:23:07,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:07,163 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:23:07,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:07,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619512261] [2025-03-08 00:23:07,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619512261] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:07,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767662216] [2025-03-08 00:23:07,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:23:07,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:07,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:07,169 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:23:07,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:23:07,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:23:07,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:23:07,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:23:07,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:07,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:23:07,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:07,314 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 00:23:07,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:23:07,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767662216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:23:07,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:23:07,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:23:07,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935069880] [2025-03-08 00:23:07,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:23:07,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:23:07,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:07,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:23:07,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:23:07,319 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:23:07,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:07,329 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2025-03-08 00:23:07,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:23:07,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-03-08 00:23:07,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:07,331 INFO L225 Difference]: With dead ends: 32 [2025-03-08 00:23:07,331 INFO L226 Difference]: Without dead ends: 19 [2025-03-08 00:23:07,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:23:07,332 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:07,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:07,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-08 00:23:07,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-08 00:23:07,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:23:07,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-08 00:23:07,339 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 25 [2025-03-08 00:23:07,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:07,339 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-08 00:23:07,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:23:07,339 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-03-08 00:23:07,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 00:23:07,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:07,342 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:07,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 00:23:07,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:07,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:07,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:07,544 INFO L85 PathProgramCache]: Analyzing trace with hash 319447963, now seen corresponding path program 1 times [2025-03-08 00:23:07,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:07,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125916271] [2025-03-08 00:23:07,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:23:07,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:07,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 00:23:07,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:23:07,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:23:07,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 00:23:07,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:07,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125916271] [2025-03-08 00:23:07,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125916271] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:07,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89660896] [2025-03-08 00:23:07,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:23:07,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:07,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:07,668 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:23:07,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:23:07,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 00:23:07,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:23:07,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:23:07,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:07,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:23:07,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:07,759 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:23:07,760 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:23:07,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89660896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:23:07,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:23:07,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:23:07,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869607431] [2025-03-08 00:23:07,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:23:07,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:23:07,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:07,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:23:07,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:23:07,766 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:23:07,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:07,773 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2025-03-08 00:23:07,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:23:07,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2025-03-08 00:23:07,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:07,774 INFO L225 Difference]: With dead ends: 30 [2025-03-08 00:23:07,774 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 00:23:07,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:23:07,775 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:07,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:07,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 00:23:07,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-08 00:23:07,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:23:07,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-03-08 00:23:07,781 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 28 [2025-03-08 00:23:07,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:07,786 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-03-08 00:23:07,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:23:07,786 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-03-08 00:23:07,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 00:23:07,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:07,787 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:07,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 00:23:07,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 00:23:07,988 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:07,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:07,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1391912268, now seen corresponding path program 1 times [2025-03-08 00:23:07,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:07,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028988406] [2025-03-08 00:23:07,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:23:07,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:07,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 00:23:07,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:23:07,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:23:07,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:08,073 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:23:08,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:08,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028988406] [2025-03-08 00:23:08,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028988406] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:08,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812860082] [2025-03-08 00:23:08,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:23:08,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:08,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:08,078 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:23:08,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:23:08,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 00:23:08,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:23:08,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:23:08,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:08,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:23:08,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:08,203 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:23:08,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:23:08,238 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:23:08,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812860082] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:23:08,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:23:08,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 00:23:08,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482915171] [2025-03-08 00:23:08,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:23:08,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:23:08,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:08,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:23:08,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:23:08,240 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:23:08,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:08,256 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2025-03-08 00:23:08,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:23:08,256 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 29 [2025-03-08 00:23:08,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:08,257 INFO L225 Difference]: With dead ends: 39 [2025-03-08 00:23:08,257 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 00:23:08,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:23:08,258 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:08,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:08,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 00:23:08,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-08 00:23:08,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:23:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-03-08 00:23:08,265 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 29 [2025-03-08 00:23:08,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:08,265 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-08 00:23:08,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:23:08,266 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-03-08 00:23:08,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 00:23:08,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:08,266 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:08,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 00:23:08,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:08,467 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:08,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:08,468 INFO L85 PathProgramCache]: Analyzing trace with hash 739990779, now seen corresponding path program 2 times [2025-03-08 00:23:08,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:08,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998669865] [2025-03-08 00:23:08,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:23:08,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:08,480 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-08 00:23:08,494 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 00:23:08,494 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:23:08,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:08,564 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:23:08,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:08,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998669865] [2025-03-08 00:23:08,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998669865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:08,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567202927] [2025-03-08 00:23:08,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:23:08,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:08,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:08,566 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:23:08,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 00:23:08,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-08 00:23:08,631 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 00:23:08,631 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:23:08,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:08,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:23:08,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:08,675 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:23:08,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:23:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:23:08,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567202927] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:23:08,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:23:08,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-03-08 00:23:08,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143815253] [2025-03-08 00:23:08,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:23:08,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:23:08,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:08,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:23:08,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:23:08,758 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:23:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:08,791 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2025-03-08 00:23:08,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 00:23:08,793 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 32 [2025-03-08 00:23:08,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:08,794 INFO L225 Difference]: With dead ends: 46 [2025-03-08 00:23:08,794 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 00:23:08,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:23:08,795 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:08,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:08,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 00:23:08,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-08 00:23:08,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:23:08,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-03-08 00:23:08,801 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 32 [2025-03-08 00:23:08,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:08,801 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-03-08 00:23:08,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:23:08,802 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2025-03-08 00:23:08,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 00:23:08,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:08,802 INFO L218 NwaCegarLoop]: trace histogram [10, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:08,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 00:23:09,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:09,003 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:09,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:09,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1065502521, now seen corresponding path program 3 times [2025-03-08 00:23:09,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:09,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576500574] [2025-03-08 00:23:09,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:23:09,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:09,022 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 6 equivalence classes. [2025-03-08 00:23:09,034 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 41 statements. [2025-03-08 00:23:09,034 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:23:09,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:09,088 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-08 00:23:09,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:09,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576500574] [2025-03-08 00:23:09,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576500574] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:09,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331531740] [2025-03-08 00:23:09,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:23:09,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:09,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:09,092 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:23:09,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 00:23:09,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 6 equivalence classes. [2025-03-08 00:23:09,158 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 41 statements. [2025-03-08 00:23:09,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:23:09,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:09,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:23:09,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:09,181 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-08 00:23:09,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:23:09,245 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-08 00:23:09,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331531740] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:23:09,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:23:09,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-08 00:23:09,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214123188] [2025-03-08 00:23:09,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:23:09,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 00:23:09,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:09,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 00:23:09,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:23:09,247 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:23:09,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:09,261 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2025-03-08 00:23:09,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:23:09,262 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2025-03-08 00:23:09,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:09,263 INFO L225 Difference]: With dead ends: 50 [2025-03-08 00:23:09,263 INFO L226 Difference]: Without dead ends: 34 [2025-03-08 00:23:09,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:23:09,263 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:09,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:09,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-08 00:23:09,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-08 00:23:09,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:23:09,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-03-08 00:23:09,269 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 41 [2025-03-08 00:23:09,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:09,269 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-03-08 00:23:09,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:23:09,269 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-03-08 00:23:09,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 00:23:09,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:09,270 INFO L218 NwaCegarLoop]: trace histogram [18, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:09,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 00:23:09,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:09,471 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:09,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:09,471 INFO L85 PathProgramCache]: Analyzing trace with hash 571879865, now seen corresponding path program 4 times [2025-03-08 00:23:09,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:09,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568952979] [2025-03-08 00:23:09,472 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:23:09,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:09,486 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-03-08 00:23:09,508 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 00:23:09,508 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:23:09,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 51 proven. 72 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-03-08 00:23:09,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:09,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568952979] [2025-03-08 00:23:09,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568952979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:09,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643878547] [2025-03-08 00:23:09,657 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:23:09,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:09,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:09,662 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:23:09,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 00:23:09,728 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-03-08 00:23:09,814 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 00:23:09,815 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:23:09,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:09,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:23:09,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:09,841 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 100 proven. 21 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-08 00:23:09,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:23:09,939 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-03-08 00:23:09,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643878547] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:23:09,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:23:09,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-03-08 00:23:09,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581900342] [2025-03-08 00:23:09,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:23:09,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 00:23:09,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:09,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 00:23:09,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:23:09,940 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:23:09,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:09,966 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2025-03-08 00:23:09,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:23:09,967 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2025-03-08 00:23:09,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:09,967 INFO L225 Difference]: With dead ends: 58 [2025-03-08 00:23:09,967 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 00:23:09,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 99 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:23:09,969 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:09,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:09,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 00:23:09,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-08 00:23:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:23:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-03-08 00:23:09,974 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 53 [2025-03-08 00:23:09,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:09,974 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-03-08 00:23:09,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:23:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-03-08 00:23:09,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 00:23:09,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:09,978 INFO L218 NwaCegarLoop]: trace histogram [30, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:09,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 00:23:10,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:10,179 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:10,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:10,179 INFO L85 PathProgramCache]: Analyzing trace with hash 628022329, now seen corresponding path program 5 times [2025-03-08 00:23:10,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:10,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370269670] [2025-03-08 00:23:10,179 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:23:10,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:10,202 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 65 statements into 13 equivalence classes. [2025-03-08 00:23:10,344 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 54 of 65 statements. [2025-03-08 00:23:10,344 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-08 00:23:10,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:10,438 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2025-03-08 00:23:10,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:10,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370269670] [2025-03-08 00:23:10,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370269670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:10,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057877819] [2025-03-08 00:23:10,439 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:23:10,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:10,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:10,443 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:23:10,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 00:23:10,524 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 65 statements into 13 equivalence classes. [2025-03-08 00:23:10,661 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 54 of 65 statements. [2025-03-08 00:23:10,661 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-08 00:23:10,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:10,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:23:10,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:10,673 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 248 proven. 1 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2025-03-08 00:23:10,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:23:10,704 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2025-03-08 00:23:10,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057877819] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:23:10,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:23:10,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-08 00:23:10,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302703817] [2025-03-08 00:23:10,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:23:10,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 00:23:10,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:10,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 00:23:10,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:23:10,707 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:23:10,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:10,720 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2025-03-08 00:23:10,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:23:10,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 65 [2025-03-08 00:23:10,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:10,722 INFO L225 Difference]: With dead ends: 60 [2025-03-08 00:23:10,722 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 00:23:10,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:23:10,723 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:10,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:10,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 00:23:10,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-08 00:23:10,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:23:10,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2025-03-08 00:23:10,728 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 65 [2025-03-08 00:23:10,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:10,728 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2025-03-08 00:23:10,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:23:10,729 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2025-03-08 00:23:10,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 00:23:10,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:10,730 INFO L218 NwaCegarLoop]: trace histogram [30, 10, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:10,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 00:23:10,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:10,931 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:10,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:10,931 INFO L85 PathProgramCache]: Analyzing trace with hash 486684556, now seen corresponding path program 6 times [2025-03-08 00:23:10,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:10,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529236694] [2025-03-08 00:23:10,931 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:23:10,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:10,945 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 68 statements into 13 equivalence classes. [2025-03-08 00:23:11,003 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 48 of 68 statements. [2025-03-08 00:23:11,003 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-08 00:23:11,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:11,102 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2025-03-08 00:23:11,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:11,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529236694] [2025-03-08 00:23:11,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529236694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:11,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670016616] [2025-03-08 00:23:11,103 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:23:11,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:11,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:11,105 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:23:11,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 00:23:11,164 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 68 statements into 13 equivalence classes. [2025-03-08 00:23:11,217 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 48 of 68 statements. [2025-03-08 00:23:11,217 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-08 00:23:11,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:11,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:23:11,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:11,249 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 248 proven. 10 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2025-03-08 00:23:11,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:23:11,302 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2025-03-08 00:23:11,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670016616] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:23:11,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:23:11,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-08 00:23:11,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794317043] [2025-03-08 00:23:11,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:23:11,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 00:23:11,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:11,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 00:23:11,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:23:11,306 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:23:11,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:11,328 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2025-03-08 00:23:11,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 00:23:11,329 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 68 [2025-03-08 00:23:11,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:11,329 INFO L225 Difference]: With dead ends: 65 [2025-03-08 00:23:11,329 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 00:23:11,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:23:11,330 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:11,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:11,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 00:23:11,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-08 00:23:11,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:23:11,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2025-03-08 00:23:11,335 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 68 [2025-03-08 00:23:11,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:11,335 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2025-03-08 00:23:11,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:23:11,335 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2025-03-08 00:23:11,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 00:23:11,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:11,336 INFO L218 NwaCegarLoop]: trace histogram [30, 10, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:11,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 00:23:11,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-08 00:23:11,537 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:11,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:11,538 INFO L85 PathProgramCache]: Analyzing trace with hash 221324729, now seen corresponding path program 7 times [2025-03-08 00:23:11,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:11,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418507168] [2025-03-08 00:23:11,538 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:23:11,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:11,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 00:23:12,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 00:23:12,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:23:12,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:29,700 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 5 proven. 596 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 00:23:29,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:29,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418507168] [2025-03-08 00:23:29,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418507168] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:29,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942844572] [2025-03-08 00:23:29,701 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:23:29,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:29,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:29,703 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:23:29,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 00:23:29,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 00:23:30,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 00:23:30,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:23:30,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:30,083 WARN L254 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 238 conjuncts are in the unsatisfiable core [2025-03-08 00:23:30,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:30,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:23:31,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:23:31,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 248 treesize of output 136 [2025-03-08 00:23:31,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:23:31,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 307 treesize of output 158 [2025-03-08 00:23:31,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:23:31,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 291 treesize of output 158 [2025-03-08 00:23:32,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:23:32,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 291 treesize of output 158 [2025-03-08 00:23:32,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:23:32,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 291 treesize of output 158 [2025-03-08 00:23:32,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:23:32,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 291 treesize of output 158 [2025-03-08 00:23:32,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:23:32,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 291 treesize of output 158 [2025-03-08 00:23:32,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:23:32,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 291 treesize of output 158 [2025-03-08 00:23:32,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:23:32,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 291 treesize of output 158 [2025-03-08 00:23:33,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:23:33,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 291 treesize of output 158 [2025-03-08 00:23:33,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:23:33,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 311 treesize of output 171 [2025-03-08 00:23:33,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:23:33,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 510 treesize of output 150