./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/prefixsum_rec.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/prefixsum_rec.c -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 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:00:26,393 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:00:26,454 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:00:26,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:00:26,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:00:26,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:00:26,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:00:26,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:00:26,481 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:00:26,481 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:00:26,481 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:00:26,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:00:26,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:00:26,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:00:26,483 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:00:26,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:00:26,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:00:26,483 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:00:26,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:00:26,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:00:26,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:00:26,484 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:00:26,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:00:26,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:00:26,485 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:00:26,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:00:26,485 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:00:26,485 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:00:26,485 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:00:26,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:00:26,486 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:00:26,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:00:26,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:00:26,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:00:26,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:00:26,486 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:00:26,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:00:26,486 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:00:26,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:00:26,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:00:26,487 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:00:26,487 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:00:26,487 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:00:26,487 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 -> 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab [2025-03-16 19:00:26,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:00:26,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:00:26,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:00:26,734 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:00:26,734 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:00:26,735 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/prefixsum_rec.c [2025-03-16 19:00:27,940 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b973bb0c2/14dca940fa3c4bc69f62fc2bc572bf85/FLAG7e7e0b918 [2025-03-16 19:00:28,242 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:00:28,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c [2025-03-16 19:00:28,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b973bb0c2/14dca940fa3c4bc69f62fc2bc572bf85/FLAG7e7e0b918 [2025-03-16 19:00:28,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b973bb0c2/14dca940fa3c4bc69f62fc2bc572bf85 [2025-03-16 19:00:28,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:00:28,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:00:28,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:00:28,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:00:28,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:00:28,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:00:28" (1/1) ... [2025-03-16 19:00:28,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@942d2f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:00:28, skipping insertion in model container [2025-03-16 19:00:28,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:00:28" (1/1) ... [2025-03-16 19:00:28,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:00:28,643 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/verifythis/prefixsum_rec.c[525,538] [2025-03-16 19:00:28,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:00:28,664 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:00:28,670 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/verifythis/prefixsum_rec.c[525,538] [2025-03-16 19:00:28,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:00:28,687 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:00:28,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:00:28 WrapperNode [2025-03-16 19:00:28,688 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:00:28,688 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:00:28,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:00:28,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:00:28,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:00:28" (1/1) ... [2025-03-16 19:00:28,698 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:00:28" (1/1) ... [2025-03-16 19:00:28,711 INFO L138 Inliner]: procedures = 22, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2025-03-16 19:00:28,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:00:28,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:00:28,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:00:28,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:00:28,718 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:00:28" (1/1) ... [2025-03-16 19:00:28,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:00:28" (1/1) ... [2025-03-16 19:00:28,720 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:00:28" (1/1) ... [2025-03-16 19:00:28,730 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2025-03-16 19:00:28,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:00:28" (1/1) ... [2025-03-16 19:00:28,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:00:28" (1/1) ... [2025-03-16 19:00:28,737 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:00:28" (1/1) ... [2025-03-16 19:00:28,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:00:28" (1/1) ... [2025-03-16 19:00:28,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:00:28" (1/1) ... [2025-03-16 19:00:28,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:00:28" (1/1) ... [2025-03-16 19:00:28,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:00:28,740 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:00:28,740 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:00:28,740 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:00:28,743 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:00:28" (1/1) ... [2025-03-16 19:00:28,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:00:28,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:00:28,764 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-16 19:00:28,770 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-16 19:00:28,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:00:28,784 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 19:00:28,784 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 19:00:28,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:00:28,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 19:00:28,784 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2025-03-16 19:00:28,784 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2025-03-16 19:00:28,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 19:00:28,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 19:00:28,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-16 19:00:28,785 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2025-03-16 19:00:28,785 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2025-03-16 19:00:28,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:00:28,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:00:28,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 19:00:28,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 19:00:28,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-16 19:00:28,785 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-16 19:00:28,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 19:00:28,858 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:00:28,860 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:00:29,057 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-03-16 19:00:29,057 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:00:29,063 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:00:29,063 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:00:29,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:00:29 BoogieIcfgContainer [2025-03-16 19:00:29,064 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:00:29,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:00:29,066 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:00:29,068 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:00:29,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:00:28" (1/3) ... [2025-03-16 19:00:29,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4c3403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:00:29, skipping insertion in model container [2025-03-16 19:00:29,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:00:28" (2/3) ... [2025-03-16 19:00:29,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4c3403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:00:29, skipping insertion in model container [2025-03-16 19:00:29,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:00:29" (3/3) ... [2025-03-16 19:00:29,070 INFO L128 eAbstractionObserver]: Analyzing ICFG prefixsum_rec.c [2025-03-16 19:00:29,082 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:00:29,083 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG prefixsum_rec.c that has 5 procedures, 44 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-16 19:00:29,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:00:29,127 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;@371c0da5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:00:29,127 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:00:29,129 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 19:00:29,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 19:00:29,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:00:29,134 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:00:29,135 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:00:29,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:00:29,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1485085245, now seen corresponding path program 1 times [2025-03-16 19:00:29,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:00:29,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286280644] [2025-03-16 19:00:29,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:00:29,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:00:29,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 19:00:29,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 19:00:29,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:00:29,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:00:29,295 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 19:00:29,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:00:29,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286280644] [2025-03-16 19:00:29,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286280644] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:00:29,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338675845] [2025-03-16 19:00:29,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:00:29,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:00:29,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:00:29,301 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-16 19:00:29,302 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-16 19:00:29,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 19:00:29,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 19:00:29,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:00:29,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:00:29,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 19:00:29,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:00:29,432 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 19:00:29,433 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:00:29,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338675845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:00:29,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:00:29,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 19:00:29,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370815789] [2025-03-16 19:00:29,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:00:29,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 19:00:29,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:00:29,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 19:00:29,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 19:00:29,450 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 19:00:29,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:00:29,462 INFO L93 Difference]: Finished difference Result 86 states and 111 transitions. [2025-03-16 19:00:29,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 19:00:29,463 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2025-03-16 19:00:29,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:00:29,468 INFO L225 Difference]: With dead ends: 86 [2025-03-16 19:00:29,468 INFO L226 Difference]: Without dead ends: 42 [2025-03-16 19:00:29,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 19:00:29,471 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:00:29,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:00:29,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-16 19:00:29,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-16 19:00:29,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 19:00:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2025-03-16 19:00:29,494 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 41 [2025-03-16 19:00:29,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:00:29,494 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2025-03-16 19:00:29,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 19:00:29,494 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2025-03-16 19:00:29,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 19:00:29,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:00:29,496 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:00:29,501 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-16 19:00:29,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 19:00:29,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:00:29,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:00:29,697 INFO L85 PathProgramCache]: Analyzing trace with hash 498518691, now seen corresponding path program 1 times [2025-03-16 19:00:29,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:00:29,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858807839] [2025-03-16 19:00:29,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:00:29,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:00:29,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 19:00:29,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 19:00:29,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:00:29,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:00:30,065 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 19:00:30,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:00:30,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858807839] [2025-03-16 19:00:30,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858807839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:00:30,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:00:30,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:00:30,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956435358] [2025-03-16 19:00:30,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:00:30,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:00:30,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:00:30,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:00:30,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:00:30,069 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 19:00:30,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:00:30,132 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2025-03-16 19:00:30,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:00:30,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2025-03-16 19:00:30,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:00:30,134 INFO L225 Difference]: With dead ends: 54 [2025-03-16 19:00:30,135 INFO L226 Difference]: Without dead ends: 44 [2025-03-16 19:00:30,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:00:30,136 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:00:30,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 228 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:00:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-16 19:00:30,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2025-03-16 19:00:30,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 19:00:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2025-03-16 19:00:30,146 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 41 [2025-03-16 19:00:30,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:00:30,148 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2025-03-16 19:00:30,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 19:00:30,148 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2025-03-16 19:00:30,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 19:00:30,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:00:30,150 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:00:30,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:00:30,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:00:30,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:00:30,150 INFO L85 PathProgramCache]: Analyzing trace with hash 874237915, now seen corresponding path program 1 times [2025-03-16 19:00:30,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:00:30,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155156296] [2025-03-16 19:00:30,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:00:30,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:00:30,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 19:00:30,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 19:00:30,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:00:30,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:00:30,415 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 19:00:30,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:00:30,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155156296] [2025-03-16 19:00:30,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155156296] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:00:30,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802094040] [2025-03-16 19:00:30,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:00:30,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:00:30,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:00:30,419 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-16 19:00:30,420 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-16 19:00:30,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 19:00:30,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 19:00:30,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:00:30,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:00:30,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 19:00:30,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:00:30,608 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 19:00:30,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:00:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 19:00:30,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802094040] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:00:30,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:00:30,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-16 19:00:30,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432662950] [2025-03-16 19:00:30,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:00:30,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:00:30,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:00:30,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:00:30,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:00:30,704 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-16 19:00:30,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:00:30,783 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2025-03-16 19:00:30,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:00:30,785 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 42 [2025-03-16 19:00:30,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:00:30,786 INFO L225 Difference]: With dead ends: 68 [2025-03-16 19:00:30,786 INFO L226 Difference]: Without dead ends: 44 [2025-03-16 19:00:30,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:00:30,787 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 10 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:00:30,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 263 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:00:30,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-16 19:00:30,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-16 19:00:30,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 19:00:30,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2025-03-16 19:00:30,793 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 42 [2025-03-16 19:00:30,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:00:30,793 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2025-03-16 19:00:30,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-16 19:00:30,793 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2025-03-16 19:00:30,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 19:00:30,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:00:30,794 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:00:30,800 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-16 19:00:30,998 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-16 19:00:30,998 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:00:30,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:00:30,999 INFO L85 PathProgramCache]: Analyzing trace with hash -363368029, now seen corresponding path program 2 times [2025-03-16 19:00:30,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:00:30,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221045173] [2025-03-16 19:00:30,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:00:30,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:00:31,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-16 19:00:31,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 19:00:31,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 19:00:31,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:00:32,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 19:00:32,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:00:32,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221045173] [2025-03-16 19:00:32,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221045173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:00:32,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569469441] [2025-03-16 19:00:32,133 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:00:32,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:00:32,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:00:32,135 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-16 19:00:32,137 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-16 19:00:32,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-16 19:00:32,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 19:00:32,230 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 19:00:32,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:00:32,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-16 19:00:32,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:00:32,295 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 16 treesize of output 12 [2025-03-16 19:00:32,398 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_downsweep_~left_9 Int)) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_downsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int#1)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (let ((.cse3 (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_9 4))) (.cse2 (select .cse0 .cse1))) (store (store .cse0 .cse1 (+ .cse2 (select .cse0 .cse3))) .cse3 .cse2))))) (<= |c_downsweep_#in~right| (+ v_downsweep_~left_9 1)) (<= v_downsweep_~left_9 |c_downsweep_#in~left|))) is different from true [2025-03-16 19:00:32,444 INFO L349 Elim1Store]: treesize reduction 36, result has 25.0 percent of original size [2025-03-16 19:00:32,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 27 [2025-03-16 19:00:32,582 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 19:00:32,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:00:32,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569469441] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:00:32,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 19:00:32,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 25 [2025-03-16 19:00:32,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515902044] [2025-03-16 19:00:32,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 19:00:32,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-16 19:00:32,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:00:32,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-16 19:00:32,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=639, Unknown=1, NotChecked=50, Total=756 [2025-03-16 19:00:32,826 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 25 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 21 states have internal predecessors, (47), 6 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-16 19:00:33,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:00:33,621 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2025-03-16 19:00:33,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-16 19:00:33,622 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 21 states have internal predecessors, (47), 6 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) Word has length 43 [2025-03-16 19:00:33,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:00:33,624 INFO L225 Difference]: With dead ends: 58 [2025-03-16 19:00:33,625 INFO L226 Difference]: Without dead ends: 56 [2025-03-16 19:00:33,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=1498, Unknown=1, NotChecked=78, Total=1722 [2025-03-16 19:00:33,626 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:00:33,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 384 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 685 Invalid, 0 Unknown, 70 Unchecked, 0.4s Time] [2025-03-16 19:00:33,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-16 19:00:33,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2025-03-16 19:00:33,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-16 19:00:33,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2025-03-16 19:00:33,641 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 43 [2025-03-16 19:00:33,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:00:33,641 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2025-03-16 19:00:33,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 21 states have internal predecessors, (47), 6 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-16 19:00:33,641 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2025-03-16 19:00:33,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-16 19:00:33,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:00:33,642 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:00:33,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 19:00:33,842 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-16 19:00:33,842 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:00:33,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:00:33,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1778477320, now seen corresponding path program 1 times [2025-03-16 19:00:33,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:00:33,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601473020] [2025-03-16 19:00:33,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:00:33,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:00:33,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-16 19:00:33,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-16 19:00:33,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:00:33,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:00:34,014 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 19:00:34,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:00:34,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601473020] [2025-03-16 19:00:34,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601473020] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:00:34,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133749424] [2025-03-16 19:00:34,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:00:34,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:00:34,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:00:34,016 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-16 19:00:34,018 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-16 19:00:34,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-16 19:00:34,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-16 19:00:34,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:00:34,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:00:34,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 117 conjuncts are in the unsatisfiable core [2025-03-16 19:00:34,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:00:34,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-16 19:00:34,210 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 7 treesize of output 6 [2025-03-16 19:00:34,273 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-16 19:00:34,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-03-16 19:00:34,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2025-03-16 19:00:34,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-16 19:00:34,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 10 [2025-03-16 19:00:34,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2025-03-16 19:00:34,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2025-03-16 19:00:34,471 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 19:00:34,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:00:34,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133749424] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:00:34,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 19:00:34,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17] total 22 [2025-03-16 19:00:34,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790531809] [2025-03-16 19:00:34,772 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 19:00:34,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-16 19:00:34,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:00:34,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-16 19:00:34,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:00:34,775 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 22 states, 20 states have (on average 2.5) internal successors, (50), 18 states have internal predecessors, (50), 6 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-16 19:00:35,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:00:35,345 INFO L93 Difference]: Finished difference Result 97 states and 128 transitions. [2025-03-16 19:00:35,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 19:00:35,346 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.5) internal successors, (50), 18 states have internal predecessors, (50), 6 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 46 [2025-03-16 19:00:35,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:00:35,348 INFO L225 Difference]: With dead ends: 97 [2025-03-16 19:00:35,348 INFO L226 Difference]: Without dead ends: 68 [2025-03-16 19:00:35,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=182, Invalid=1458, Unknown=0, NotChecked=0, Total=1640 [2025-03-16 19:00:35,349 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 59 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:00:35,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 461 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:00:35,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-16 19:00:35,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2025-03-16 19:00:35,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 13 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2025-03-16 19:00:35,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2025-03-16 19:00:35,363 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 46 [2025-03-16 19:00:35,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:00:35,363 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2025-03-16 19:00:35,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.5) internal successors, (50), 18 states have internal predecessors, (50), 6 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-16 19:00:35,363 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2025-03-16 19:00:35,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 19:00:35,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:00:35,364 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:00:35,371 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-16 19:00:35,564 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-16 19:00:35,564 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:00:35,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:00:35,565 INFO L85 PathProgramCache]: Analyzing trace with hash -586705063, now seen corresponding path program 1 times [2025-03-16 19:00:35,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:00:35,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928105357] [2025-03-16 19:00:35,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:00:35,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:00:35,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 19:00:35,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 19:00:35,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:00:35,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:00:37,050 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 19:00:37,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:00:37,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928105357] [2025-03-16 19:00:37,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928105357] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:00:37,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447581857] [2025-03-16 19:00:37,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:00:37,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:00:37,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:00:37,053 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-16 19:00:37,054 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-16 19:00:37,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 19:00:37,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 19:00:37,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:00:37,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:00:37,130 WARN L254 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 129 conjuncts are in the unsatisfiable core [2025-03-16 19:00:37,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:00:37,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-16 19:00:37,311 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 7 treesize of output 6 [2025-03-16 19:00:37,433 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-16 19:00:37,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-03-16 19:00:37,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2025-03-16 19:00:37,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-16 19:00:37,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 10 [2025-03-16 19:00:37,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2025-03-16 19:00:37,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2025-03-16 19:00:37,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2025-03-16 19:00:37,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2025-03-16 19:00:37,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-03-16 19:00:38,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 53 [2025-03-16 19:00:38,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2025-03-16 19:00:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 19:00:38,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:00:38,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447581857] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:00:38,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 19:00:38,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 44 [2025-03-16 19:00:38,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420993906] [2025-03-16 19:00:38,536 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 19:00:38,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-16 19:00:38,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:00:38,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-16 19:00:38,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2097, Unknown=0, NotChecked=0, Total=2256 [2025-03-16 19:00:38,538 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. Second operand has 44 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 36 states have internal predecessors, (62), 8 states have call successors, (11), 3 states have call predecessors, (11), 10 states have return successors, (11), 10 states have call predecessors, (11), 8 states have call successors, (11) [2025-03-16 19:00:40,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:00:40,389 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2025-03-16 19:00:40,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-16 19:00:40,390 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 36 states have internal predecessors, (62), 8 states have call successors, (11), 3 states have call predecessors, (11), 10 states have return successors, (11), 10 states have call predecessors, (11), 8 states have call successors, (11) Word has length 47 [2025-03-16 19:00:40,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:00:40,391 INFO L225 Difference]: With dead ends: 90 [2025-03-16 19:00:40,391 INFO L226 Difference]: Without dead ends: 88 [2025-03-16 19:00:40,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1416 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=393, Invalid=5459, Unknown=0, NotChecked=0, Total=5852 [2025-03-16 19:00:40,393 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 88 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:00:40,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 522 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:00:40,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-16 19:00:40,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 77. [2025-03-16 19:00:40,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 55 states have internal predecessors, (62), 15 states have call successors, (15), 5 states have call predecessors, (15), 7 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2025-03-16 19:00:40,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2025-03-16 19:00:40,405 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 100 transitions. Word has length 47 [2025-03-16 19:00:40,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:00:40,406 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 100 transitions. [2025-03-16 19:00:40,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 36 states have internal predecessors, (62), 8 states have call successors, (11), 3 states have call predecessors, (11), 10 states have return successors, (11), 10 states have call predecessors, (11), 8 states have call successors, (11) [2025-03-16 19:00:40,406 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2025-03-16 19:00:40,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-16 19:00:40,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:00:40,407 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:00:40,415 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-16 19:00:40,607 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-16 19:00:40,607 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:00:40,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:00:40,608 INFO L85 PathProgramCache]: Analyzing trace with hash 949690495, now seen corresponding path program 2 times [2025-03-16 19:00:40,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:00:40,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579871315] [2025-03-16 19:00:40,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:00:40,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:00:40,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-16 19:00:40,631 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-16 19:00:40,632 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 19:00:40,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:00:40,779 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 19:00:40,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:00:40,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579871315] [2025-03-16 19:00:40,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579871315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:00:40,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105604604] [2025-03-16 19:00:40,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:00:40,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:00:40,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:00:40,782 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-16 19:00:40,783 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-16 19:00:40,835 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-16 19:00:40,859 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-16 19:00:40,859 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 19:00:40,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:00:40,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 19:00:40,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:00:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 19:00:40,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:00:41,034 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 19:00:41,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105604604] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:00:41,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:00:41,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 17 [2025-03-16 19:00:41,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829919361] [2025-03-16 19:00:41,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:00:41,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 19:00:41,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:00:41,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 19:00:41,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:00:41,035 INFO L87 Difference]: Start difference. First operand 77 states and 100 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-16 19:00:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:00:41,182 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2025-03-16 19:00:41,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:00:41,183 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 48 [2025-03-16 19:00:41,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:00:41,183 INFO L225 Difference]: With dead ends: 101 [2025-03-16 19:00:41,183 INFO L226 Difference]: Without dead ends: 81 [2025-03-16 19:00:41,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:00:41,184 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:00:41,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 375 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:00:41,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-16 19:00:41,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2025-03-16 19:00:41,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 55 states have internal predecessors, (62), 15 states have call successors, (15), 5 states have call predecessors, (15), 7 states have return successors, (22), 16 states have call predecessors, (22), 15 states have call successors, (22) [2025-03-16 19:00:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2025-03-16 19:00:41,202 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 48 [2025-03-16 19:00:41,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:00:41,203 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2025-03-16 19:00:41,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-16 19:00:41,204 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2025-03-16 19:00:41,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 19:00:41,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:00:41,205 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:00:41,213 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-16 19:00:41,405 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-16 19:00:41,405 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:00:41,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:00:41,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1987251586, now seen corresponding path program 3 times [2025-03-16 19:00:41,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:00:41,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106535544] [2025-03-16 19:00:41,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 19:00:41,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:00:41,414 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 3 equivalence classes. [2025-03-16 19:00:41,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 19:00:41,437 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-16 19:00:41,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:00:41,627 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:00:41,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:00:41,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106535544] [2025-03-16 19:00:41,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106535544] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:00:41,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236885482] [2025-03-16 19:00:41,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 19:00:41,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:00:41,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:00:41,631 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-16 19:00:41,632 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-16 19:00:41,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 3 equivalence classes. [2025-03-16 19:00:41,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 19:00:41,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-16 19:00:41,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:00:41,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 19:00:41,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:00:41,820 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:00:41,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:00:41,897 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:00:41,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236885482] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:00:41,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:00:41,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 18 [2025-03-16 19:00:41,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818378940] [2025-03-16 19:00:41,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:00:41,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 19:00:41,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:00:41,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 19:00:41,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:00:41,899 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 19:00:42,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:00:42,084 INFO L93 Difference]: Finished difference Result 107 states and 134 transitions. [2025-03-16 19:00:42,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:00:42,085 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 50 [2025-03-16 19:00:42,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:00:42,086 INFO L225 Difference]: With dead ends: 107 [2025-03-16 19:00:42,086 INFO L226 Difference]: Without dead ends: 94 [2025-03-16 19:00:42,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 89 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:00:42,086 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 19 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:00:42,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 357 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:00:42,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-16 19:00:42,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2025-03-16 19:00:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 64 states have internal predecessors, (72), 18 states have call successors, (18), 5 states have call predecessors, (18), 8 states have return successors, (27), 20 states have call predecessors, (27), 18 states have call successors, (27) [2025-03-16 19:00:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 117 transitions. [2025-03-16 19:00:42,110 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 117 transitions. Word has length 50 [2025-03-16 19:00:42,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:00:42,110 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 117 transitions. [2025-03-16 19:00:42,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 19:00:42,110 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 117 transitions. [2025-03-16 19:00:42,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 19:00:42,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:00:42,111 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:00:42,118 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-16 19:00:42,316 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-16 19:00:42,316 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:00:42,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:00:42,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1768580605, now seen corresponding path program 1 times [2025-03-16 19:00:42,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:00:42,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532249191] [2025-03-16 19:00:42,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:00:42,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:00:42,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 19:00:42,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 19:00:42,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:00:42,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:00:42,406 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 19:00:42,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:00:42,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532249191] [2025-03-16 19:00:42,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532249191] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:00:42,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886848414] [2025-03-16 19:00:42,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:00:42,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:00:42,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:00:42,409 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-16 19:00:42,410 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-16 19:00:42,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 19:00:42,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 19:00:42,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:00:42,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:00:42,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 19:00:42,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:00:42,577 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 19:00:42,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:00:42,869 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-16 19:00:42,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886848414] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:00:42,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:00:42,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 7] total 19 [2025-03-16 19:00:42,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300749706] [2025-03-16 19:00:42,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:00:42,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 19:00:42,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:00:42,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 19:00:42,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:00:42,871 INFO L87 Difference]: Start difference. First operand 90 states and 117 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 6 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-16 19:00:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:00:43,079 INFO L93 Difference]: Finished difference Result 95 states and 121 transitions. [2025-03-16 19:00:43,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:00:43,079 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 6 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 55 [2025-03-16 19:00:43,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:00:43,080 INFO L225 Difference]: With dead ends: 95 [2025-03-16 19:00:43,080 INFO L226 Difference]: Without dead ends: 82 [2025-03-16 19:00:43,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2025-03-16 19:00:43,081 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:00:43,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 457 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:00:43,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-16 19:00:43,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-16 19:00:43,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 58 states have internal predecessors, (64), 17 states have call successors, (17), 5 states have call predecessors, (17), 7 states have return successors, (24), 18 states have call predecessors, (24), 17 states have call successors, (24) [2025-03-16 19:00:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2025-03-16 19:00:43,094 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 55 [2025-03-16 19:00:43,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:00:43,095 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2025-03-16 19:00:43,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 6 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-16 19:00:43,095 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2025-03-16 19:00:43,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 19:00:43,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:00:43,096 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:00:43,102 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-16 19:00:43,297 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-16 19:00:43,297 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:00:43,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:00:43,298 INFO L85 PathProgramCache]: Analyzing trace with hash 785541736, now seen corresponding path program 1 times [2025-03-16 19:00:43,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:00:43,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879302195] [2025-03-16 19:00:43,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:00:43,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:00:43,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 19:00:43,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 19:00:43,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:00:43,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:00:43,392 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-16 19:00:43,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:00:43,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879302195] [2025-03-16 19:00:43,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879302195] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:00:43,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388950211] [2025-03-16 19:00:43,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:00:43,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:00:43,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:00:43,395 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-16 19:00:43,397 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-16 19:00:43,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 19:00:43,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 19:00:43,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:00:43,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:00:43,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 19:00:43,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:00:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-16 19:00:43,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:00:43,748 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-16 19:00:43,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388950211] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:00:43,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:00:43,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-03-16 19:00:43,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804673167] [2025-03-16 19:00:43,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:00:43,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 19:00:43,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:00:43,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 19:00:43,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-16 19:00:43,750 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand has 16 states, 14 states have (on average 3.642857142857143) internal successors, (51), 16 states have internal predecessors, (51), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-16 19:00:43,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:00:43,837 INFO L93 Difference]: Finished difference Result 93 states and 118 transitions. [2025-03-16 19:00:43,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:00:43,838 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.642857142857143) internal successors, (51), 16 states have internal predecessors, (51), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) Word has length 60 [2025-03-16 19:00:43,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:00:43,839 INFO L225 Difference]: With dead ends: 93 [2025-03-16 19:00:43,839 INFO L226 Difference]: Without dead ends: 65 [2025-03-16 19:00:43,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:00:43,842 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:00:43,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 362 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:00:43,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-16 19:00:43,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2025-03-16 19:00:43,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 13 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (18), 14 states have call predecessors, (18), 13 states have call successors, (18) [2025-03-16 19:00:43,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2025-03-16 19:00:43,853 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 60 [2025-03-16 19:00:43,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:00:43,853 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2025-03-16 19:00:43,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.642857142857143) internal successors, (51), 16 states have internal predecessors, (51), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-16 19:00:43,853 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2025-03-16 19:00:43,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 19:00:43,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:00:43,854 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:00:43,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-16 19:00:44,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-16 19:00:44,055 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:00:44,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:00:44,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1309577470, now seen corresponding path program 2 times [2025-03-16 19:00:44,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:00:44,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602985881] [2025-03-16 19:00:44,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:00:44,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:00:44,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-03-16 19:00:44,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 19:00:44,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 19:00:44,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:00:44,204 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-16 19:00:44,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:00:44,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602985881] [2025-03-16 19:00:44,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602985881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:00:44,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775602151] [2025-03-16 19:00:44,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:00:44,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:00:44,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:00:44,207 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:00:44,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-16 19:00:44,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-03-16 19:00:44,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 19:00:44,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 19:00:44,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:00:44,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 19:00:44,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:00:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 19:00:44,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:00:44,479 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 19:00:44,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775602151] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:00:44,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:00:44,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 17 [2025-03-16 19:00:44,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108190449] [2025-03-16 19:00:44,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:00:44,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 19:00:44,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:00:44,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 19:00:44,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:00:44,480 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 3 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-16 19:00:44,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:00:44,597 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2025-03-16 19:00:44,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:00:44,598 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 3 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 61 [2025-03-16 19:00:44,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:00:44,598 INFO L225 Difference]: With dead ends: 70 [2025-03-16 19:00:44,598 INFO L226 Difference]: Without dead ends: 62 [2025-03-16 19:00:44,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 112 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:00:44,599 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:00:44,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 325 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:00:44,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-16 19:00:44,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2025-03-16 19:00:44,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 13 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-16 19:00:44,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2025-03-16 19:00:44,611 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 61 [2025-03-16 19:00:44,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:00:44,611 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2025-03-16 19:00:44,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 3 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-16 19:00:44,611 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2025-03-16 19:00:44,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:00:44,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:00:44,612 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:00:44,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-16 19:00:44,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-16 19:00:44,813 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:00:44,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:00:44,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1615166298, now seen corresponding path program 1 times [2025-03-16 19:00:44,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:00:44,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713675094] [2025-03-16 19:00:44,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:00:44,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:00:44,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:00:44,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:00:44,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:00:44,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:00:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 19:00:44,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:00:44,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713675094] [2025-03-16 19:00:44,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713675094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:00:44,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705635320] [2025-03-16 19:00:44,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:00:44,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:00:44,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:00:44,937 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:00:44,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-16 19:00:45,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:00:45,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:00:45,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:00:45,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:00:45,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 19:00:45,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:00:45,098 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 19:00:45,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:00:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-16 19:00:45,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705635320] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:00:45,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:00:45,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 21 [2025-03-16 19:00:45,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950778239] [2025-03-16 19:00:45,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:00:45,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 19:00:45,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:00:45,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 19:00:45,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:00:45,383 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. Second operand has 21 states, 20 states have (on average 3.2) internal successors, (64), 21 states have internal predecessors, (64), 6 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 5 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-16 19:00:45,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:00:45,596 INFO L93 Difference]: Finished difference Result 99 states and 129 transitions. [2025-03-16 19:00:45,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:00:45,596 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.2) internal successors, (64), 21 states have internal predecessors, (64), 6 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 5 states have call predecessors, (22), 6 states have call successors, (22) Word has length 69 [2025-03-16 19:00:45,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:00:45,597 INFO L225 Difference]: With dead ends: 99 [2025-03-16 19:00:45,597 INFO L226 Difference]: Without dead ends: 70 [2025-03-16 19:00:45,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:00:45,597 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 23 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:00:45,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 359 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:00:45,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-16 19:00:45,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2025-03-16 19:00:45,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 46 states have internal predecessors, (51), 13 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-16 19:00:45,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2025-03-16 19:00:45,605 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 69 [2025-03-16 19:00:45,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:00:45,605 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2025-03-16 19:00:45,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.2) internal successors, (64), 21 states have internal predecessors, (64), 6 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 5 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-16 19:00:45,605 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2025-03-16 19:00:45,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 19:00:45,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:00:45,606 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:00:45,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-16 19:00:45,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-16 19:00:45,806 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:00:45,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:00:45,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1009423355, now seen corresponding path program 1 times [2025-03-16 19:00:45,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:00:45,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614229992] [2025-03-16 19:00:45,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:00:45,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:00:45,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:00:45,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:00:45,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:00:45,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat