./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr3.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 4885a4fffd0288753086daaa59bdb12816a7be62636dc49311bbb97ad277d866 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 22:10:38,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 22:10:39,006 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 22:10:39,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 22:10:39,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 22:10:39,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 22:10:39,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 22:10:39,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 22:10:39,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 22:10:39,025 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 22:10:39,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 22:10:39,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 22:10:39,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 22:10:39,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 22:10:39,027 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 22:10:39,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 22:10:39,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 22:10:39,031 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 22:10:39,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 22:10:39,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 22:10:39,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 22:10:39,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 22:10:39,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 22:10:39,033 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 22:10:39,033 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 22:10:39,033 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 22:10:39,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 22:10:39,034 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 22:10:39,034 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 22:10:39,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 22:10:39,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 22:10:39,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 22:10:39,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:10:39,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 22:10:39,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 22:10:39,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 22:10:39,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 22:10:39,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 22:10:39,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 22:10:39,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 22:10:39,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 22:10:39,039 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 22:10:39,039 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 4885a4fffd0288753086daaa59bdb12816a7be62636dc49311bbb97ad277d866 [2024-10-13 22:10:39,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 22:10:39,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 22:10:39,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 22:10:39,278 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 22:10:39,279 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 22:10:39,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr3.c [2024-10-13 22:10:40,603 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 22:10:40,767 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 22:10:40,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr3.c [2024-10-13 22:10:40,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6ea797f0/0c08ed59a6774f3897292d7f7f156767/FLAGb64da88d7 [2024-10-13 22:10:41,170 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6ea797f0/0c08ed59a6774f3897292d7f7f156767 [2024-10-13 22:10:41,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 22:10:41,175 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 22:10:41,177 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 22:10:41,177 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 22:10:41,181 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 22:10:41,183 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:10:41" (1/1) ... [2024-10-13 22:10:41,183 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1394d105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:41, skipping insertion in model container [2024-10-13 22:10:41,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:10:41" (1/1) ... [2024-10-13 22:10:41,200 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 22:10:41,329 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr3.c[394,407] [2024-10-13 22:10:41,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:10:41,353 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 22:10:41,362 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr3.c[394,407] [2024-10-13 22:10:41,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:10:41,378 INFO L204 MainTranslator]: Completed translation [2024-10-13 22:10:41,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:41 WrapperNode [2024-10-13 22:10:41,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 22:10:41,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 22:10:41,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 22:10:41,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 22:10:41,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:41" (1/1) ... [2024-10-13 22:10:41,391 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:41" (1/1) ... [2024-10-13 22:10:41,406 INFO L138 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2024-10-13 22:10:41,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 22:10:41,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 22:10:41,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 22:10:41,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 22:10:41,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:41" (1/1) ... [2024-10-13 22:10:41,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:41" (1/1) ... [2024-10-13 22:10:41,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:41" (1/1) ... [2024-10-13 22:10:41,431 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 4, 6]. 50 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 0, 6]. The 2 writes are split as follows [0, 2, 0]. [2024-10-13 22:10:41,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:41" (1/1) ... [2024-10-13 22:10:41,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:41" (1/1) ... [2024-10-13 22:10:41,435 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:41" (1/1) ... [2024-10-13 22:10:41,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:41" (1/1) ... [2024-10-13 22:10:41,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:41" (1/1) ... [2024-10-13 22:10:41,460 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:41" (1/1) ... [2024-10-13 22:10:41,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 22:10:41,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 22:10:41,463 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 22:10:41,463 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 22:10:41,463 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:41" (1/1) ... [2024-10-13 22:10:41,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:10:41,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:10:41,493 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) [2024-10-13 22:10:41,498 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 [2024-10-13 22:10:41,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 22:10:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 22:10:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 22:10:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 22:10:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 22:10:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 22:10:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 22:10:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 22:10:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 22:10:41,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 22:10:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 22:10:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 22:10:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 22:10:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 22:10:41,605 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 22:10:41,606 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 22:10:41,736 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-13 22:10:41,737 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 22:10:41,755 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 22:10:41,756 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-13 22:10:41,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:10:41 BoogieIcfgContainer [2024-10-13 22:10:41,756 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 22:10:41,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 22:10:41,758 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 22:10:41,760 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 22:10:41,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:10:41" (1/3) ... [2024-10-13 22:10:41,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b36fee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:10:41, skipping insertion in model container [2024-10-13 22:10:41,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:41" (2/3) ... [2024-10-13 22:10:41,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b36fee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:10:41, skipping insertion in model container [2024-10-13 22:10:41,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:10:41" (3/3) ... [2024-10-13 22:10:41,763 INFO L112 eAbstractionObserver]: Analyzing ICFG nr3.c [2024-10-13 22:10:41,784 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 22:10:41,784 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 22:10:41,830 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 22:10:41,836 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;@6aa428e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 22:10:41,836 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 22:10:41,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:41,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 22:10:41,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:10:41,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:10:41,845 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:10:41,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:10:41,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2106680282, now seen corresponding path program 1 times [2024-10-13 22:10:41,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:10:41,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134549563] [2024-10-13 22:10:41,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:10:41,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:10:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:10:42,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:10:42,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:10:42,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134549563] [2024-10-13 22:10:42,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134549563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:10:42,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:10:42,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:10:42,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728062259] [2024-10-13 22:10:42,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:10:42,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 22:10:42,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:10:42,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 22:10:42,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 22:10:42,045 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:42,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:10:42,064 INFO L93 Difference]: Finished difference Result 40 states and 59 transitions. [2024-10-13 22:10:42,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 22:10:42,069 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-13 22:10:42,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:10:42,075 INFO L225 Difference]: With dead ends: 40 [2024-10-13 22:10:42,075 INFO L226 Difference]: Without dead ends: 18 [2024-10-13 22:10:42,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 22:10:42,080 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:10:42,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:10:42,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-13 22:10:42,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-13 22:10:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-10-13 22:10:42,111 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 12 [2024-10-13 22:10:42,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:10:42,111 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-10-13 22:10:42,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:42,111 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-10-13 22:10:42,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 22:10:42,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:10:42,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:10:42,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 22:10:42,112 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:10:42,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:10:42,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1426621912, now seen corresponding path program 1 times [2024-10-13 22:10:42,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:10:42,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055251634] [2024-10-13 22:10:42,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:10:42,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:10:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:10:42,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:10:42,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:10:42,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055251634] [2024-10-13 22:10:42,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055251634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:10:42,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:10:42,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 22:10:42,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439216065] [2024-10-13 22:10:42,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:10:42,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:10:42,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:10:42,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:10:42,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:10:42,298 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:42,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:10:42,324 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-10-13 22:10:42,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:10:42,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-13 22:10:42,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:10:42,325 INFO L225 Difference]: With dead ends: 22 [2024-10-13 22:10:42,325 INFO L226 Difference]: Without dead ends: 20 [2024-10-13 22:10:42,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:10:42,326 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:10:42,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:10:42,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-13 22:10:42,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-13 22:10:42,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-13 22:10:42,334 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 12 [2024-10-13 22:10:42,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:10:42,334 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-13 22:10:42,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:42,335 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-13 22:10:42,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 22:10:42,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:10:42,335 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:10:42,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 22:10:42,336 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:10:42,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:10:42,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1426562330, now seen corresponding path program 1 times [2024-10-13 22:10:42,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:10:42,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063336056] [2024-10-13 22:10:42,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:10:42,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:10:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:10:42,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:10:42,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:10:42,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063336056] [2024-10-13 22:10:42,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063336056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:10:42,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:10:42,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 22:10:42,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756848130] [2024-10-13 22:10:42,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:10:42,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:10:42,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:10:42,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:10:42,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:10:42,570 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:42,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:10:42,617 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-10-13 22:10:42,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 22:10:42,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-13 22:10:42,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:10:42,618 INFO L225 Difference]: With dead ends: 35 [2024-10-13 22:10:42,618 INFO L226 Difference]: Without dead ends: 25 [2024-10-13 22:10:42,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:10:42,619 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:10:42,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 22 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:10:42,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-13 22:10:42,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2024-10-13 22:10:42,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:42,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-10-13 22:10:42,629 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 12 [2024-10-13 22:10:42,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:10:42,630 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-10-13 22:10:42,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:42,630 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-10-13 22:10:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 22:10:42,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:10:42,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:10:42,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 22:10:42,631 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:10:42,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:10:42,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1008841274, now seen corresponding path program 1 times [2024-10-13 22:10:42,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:10:42,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042062146] [2024-10-13 22:10:42,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:10:42,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:10:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:10:42,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:10:42,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:10:42,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042062146] [2024-10-13 22:10:42,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042062146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:10:42,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:10:42,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:10:42,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285130219] [2024-10-13 22:10:42,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:10:42,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:10:42,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:10:42,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:10:42,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:10:42,737 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:42,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:10:42,770 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2024-10-13 22:10:42,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:10:42,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-13 22:10:42,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:10:42,771 INFO L225 Difference]: With dead ends: 39 [2024-10-13 22:10:42,771 INFO L226 Difference]: Without dead ends: 24 [2024-10-13 22:10:42,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:10:42,773 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:10:42,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 29 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:10:42,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-13 22:10:42,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-10-13 22:10:42,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:42,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-10-13 22:10:42,781 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2024-10-13 22:10:42,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:10:42,782 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-10-13 22:10:42,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:42,782 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-10-13 22:10:42,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 22:10:42,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:10:42,782 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:10:42,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 22:10:42,783 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:10:42,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:10:42,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1963751443, now seen corresponding path program 1 times [2024-10-13 22:10:42,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:10:42,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005006230] [2024-10-13 22:10:42,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:10:42,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:10:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:10:42,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:10:42,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:10:42,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005006230] [2024-10-13 22:10:42,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005006230] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:10:42,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111114785] [2024-10-13 22:10:42,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:10:42,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:10:42,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:10:42,857 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) [2024-10-13 22:10:42,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 22:10:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:10:42,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 22:10:42,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:10:42,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:10:42,949 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:10:42,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:10:42,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111114785] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:10:42,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:10:42,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-13 22:10:42,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608114264] [2024-10-13 22:10:42,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:10:42,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 22:10:42,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:10:42,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 22:10:42,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:10:42,981 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:43,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:10:43,044 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2024-10-13 22:10:43,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 22:10:43,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-13 22:10:43,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:10:43,047 INFO L225 Difference]: With dead ends: 44 [2024-10-13 22:10:43,047 INFO L226 Difference]: Without dead ends: 28 [2024-10-13 22:10:43,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:10:43,049 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:10:43,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 55 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:10:43,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-13 22:10:43,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-13 22:10:43,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-10-13 22:10:43,060 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 18 [2024-10-13 22:10:43,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:10:43,060 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-10-13 22:10:43,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:43,061 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-10-13 22:10:43,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 22:10:43,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:10:43,062 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:10:43,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 22:10:43,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:10:43,263 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:10:43,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:10:43,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1711246131, now seen corresponding path program 2 times [2024-10-13 22:10:43,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:10:43,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532428322] [2024-10-13 22:10:43,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:10:43,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:10:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:10:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:10:43,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:10:43,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532428322] [2024-10-13 22:10:43,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532428322] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:10:43,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850564439] [2024-10-13 22:10:43,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 22:10:43,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:10:43,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:10:43,374 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) [2024-10-13 22:10:43,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 22:10:43,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 22:10:43,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 22:10:43,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 22:10:43,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:10:43,484 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:10:43,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:10:43,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850564439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:10:43,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:10:43,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-10-13 22:10:43,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000678354] [2024-10-13 22:10:43,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:10:43,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 22:10:43,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:10:43,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 22:10:43,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-10-13 22:10:43,487 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:43,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:10:43,515 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2024-10-13 22:10:43,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 22:10:43,515 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-13 22:10:43,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:10:43,516 INFO L225 Difference]: With dead ends: 50 [2024-10-13 22:10:43,516 INFO L226 Difference]: Without dead ends: 28 [2024-10-13 22:10:43,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-10-13 22:10:43,517 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:10:43,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 26 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:10:43,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-13 22:10:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-13 22:10:43,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-10-13 22:10:43,523 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 24 [2024-10-13 22:10:43,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:10:43,524 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-10-13 22:10:43,524 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-10-13 22:10:43,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 22:10:43,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:10:43,525 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:10:43,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 22:10:43,725 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,SelfDestructingSolverStorable5 [2024-10-13 22:10:43,726 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:10:43,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:10:43,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1010181553, now seen corresponding path program 1 times [2024-10-13 22:10:43,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:10:43,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508146721] [2024-10-13 22:10:43,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:10:43,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:10:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:10:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:10:44,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:10:44,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508146721] [2024-10-13 22:10:44,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508146721] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:10:44,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109507018] [2024-10-13 22:10:44,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:10:44,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:10:44,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:10:44,306 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) [2024-10-13 22:10:44,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 22:10:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:10:44,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-13 22:10:44,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:10:44,510 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 11 treesize of output 7 [2024-10-13 22:10:44,575 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 19 treesize of output 18 [2024-10-13 22:10:44,656 INFO L349 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2024-10-13 22:10:44,657 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 3 case distinctions, treesize of input 30 treesize of output 40 [2024-10-13 22:10:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:10:44,959 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:10:45,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 63 treesize of output 59 [2024-10-13 22:10:45,160 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 283 treesize of output 275 [2024-10-13 22:10:45,318 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 22:10:45,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109507018] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:10:45,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:10:45,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 37 [2024-10-13 22:10:45,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384515371] [2024-10-13 22:10:45,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:10:45,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-13 22:10:45,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:10:45,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-13 22:10:45,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2024-10-13 22:10:45,320 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 37 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 37 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:47,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:10:47,680 INFO L93 Difference]: Finished difference Result 158 states and 191 transitions. [2024-10-13 22:10:47,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-13 22:10:47,680 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 37 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-13 22:10:47,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:10:47,681 INFO L225 Difference]: With dead ends: 158 [2024-10-13 22:10:47,681 INFO L226 Difference]: Without dead ends: 136 [2024-10-13 22:10:47,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1540, Invalid=6292, Unknown=0, NotChecked=0, Total=7832 [2024-10-13 22:10:47,690 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 422 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 22:10:47,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 128 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 22:10:47,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-13 22:10:47,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 48. [2024-10-13 22:10:47,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 47 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:47,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2024-10-13 22:10:47,705 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 24 [2024-10-13 22:10:47,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:10:47,705 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2024-10-13 22:10:47,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 37 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:47,705 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2024-10-13 22:10:47,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 22:10:47,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:10:47,706 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:10:47,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 22:10:47,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:10:47,907 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:10:47,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:10:47,907 INFO L85 PathProgramCache]: Analyzing trace with hash 469747151, now seen corresponding path program 1 times [2024-10-13 22:10:47,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:10:47,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855269924] [2024-10-13 22:10:47,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:10:47,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:10:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:10:48,236 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:10:48,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:10:48,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855269924] [2024-10-13 22:10:48,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855269924] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:10:48,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330842666] [2024-10-13 22:10:48,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:10:48,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:10:48,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:10:48,239 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) [2024-10-13 22:10:48,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 22:10:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:10:48,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 22:10:48,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:10:48,329 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 13 treesize of output 9 [2024-10-13 22:10:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:10:48,394 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:10:48,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 17 [2024-10-13 22:10:48,441 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 24 treesize of output 20 [2024-10-13 22:10:48,545 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:10:48,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330842666] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:10:48,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:10:48,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 23 [2024-10-13 22:10:48,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576004607] [2024-10-13 22:10:48,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:10:48,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-13 22:10:48,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:10:48,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 22:10:48,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2024-10-13 22:10:48,547 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:48,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:10:48,843 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2024-10-13 22:10:48,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-13 22:10:48,844 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-13 22:10:48,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:10:48,849 INFO L225 Difference]: With dead ends: 113 [2024-10-13 22:10:48,849 INFO L226 Difference]: Without dead ends: 111 [2024-10-13 22:10:48,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=835, Unknown=0, NotChecked=0, Total=992 [2024-10-13 22:10:48,850 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 36 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 22:10:48,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 139 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 22:10:48,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-13 22:10:48,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 75. [2024-10-13 22:10:48,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 74 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:48,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2024-10-13 22:10:48,868 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 34 [2024-10-13 22:10:48,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:10:48,868 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2024-10-13 22:10:48,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:48,868 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2024-10-13 22:10:48,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 22:10:48,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:10:48,869 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:10:48,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 22:10:49,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:10:49,070 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:10:49,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:10:49,072 INFO L85 PathProgramCache]: Analyzing trace with hash 508323451, now seen corresponding path program 2 times [2024-10-13 22:10:49,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:10:49,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731492256] [2024-10-13 22:10:49,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:10:49,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:10:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:10:49,353 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:10:49,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:10:49,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731492256] [2024-10-13 22:10:49,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731492256] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:10:49,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653012197] [2024-10-13 22:10:49,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 22:10:49,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:10:49,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:10:49,356 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) [2024-10-13 22:10:49,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 22:10:49,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 22:10:49,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 22:10:49,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 22:10:49,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:10:49,672 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:10:49,673 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:10:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:10:49,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653012197] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:10:49,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:10:49,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 27 [2024-10-13 22:10:49,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688992571] [2024-10-13 22:10:49,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:10:49,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-13 22:10:49,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:10:49,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-13 22:10:49,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2024-10-13 22:10:49,817 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand has 27 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 27 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:49,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:10:49,991 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2024-10-13 22:10:49,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 22:10:49,991 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 27 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-10-13 22:10:49,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:10:49,992 INFO L225 Difference]: With dead ends: 127 [2024-10-13 22:10:49,992 INFO L226 Difference]: Without dead ends: 101 [2024-10-13 22:10:49,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=273, Invalid=719, Unknown=0, NotChecked=0, Total=992 [2024-10-13 22:10:49,993 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 100 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:10:49,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 132 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:10:49,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-13 22:10:50,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 67. [2024-10-13 22:10:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 66 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2024-10-13 22:10:50,009 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 39 [2024-10-13 22:10:50,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:10:50,010 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2024-10-13 22:10:50,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 27 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:10:50,010 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2024-10-13 22:10:50,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-13 22:10:50,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:10:50,011 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:10:50,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 22:10:50,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:10:50,215 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:10:50,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:10:50,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1285797454, now seen corresponding path program 3 times [2024-10-13 22:10:50,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:10:50,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129868728] [2024-10-13 22:10:50,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:10:50,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:10:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:10:50,918 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 4 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:10:50,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:10:50,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129868728] [2024-10-13 22:10:50,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129868728] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:10:50,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894263984] [2024-10-13 22:10:50,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 22:10:50,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:10:50,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:10:50,920 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) [2024-10-13 22:10:50,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 22:10:50,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-10-13 22:10:50,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 22:10:50,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-13 22:10:50,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:10:51,092 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 11 treesize of output 7 [2024-10-13 22:10:51,135 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-13 22:10:51,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 23 treesize of output 26 [2024-10-13 22:10:51,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 22:10:51,336 INFO L349 Elim1Store]: treesize reduction 38, result has 49.3 percent of original size [2024-10-13 22:10:51,336 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 3 case distinctions, treesize of input 36 treesize of output 56 [2024-10-13 22:10:51,722 INFO L349 Elim1Store]: treesize reduction 96, result has 68.0 percent of original size [2024-10-13 22:10:51,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 120 treesize of output 275 [2024-10-13 22:11:26,050 INFO L190 IndexEqualityManager]: detected not equals via solver