./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/heap-data/cart.i --full-output --preprocessor.use.memory.slicer true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 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 ../../../trunk/examples/svcomp/heap-data/cart.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 22:29:47,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 22:29:47,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 22:29:47,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 22:29:47,652 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 22:29:47,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 22:29:47,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 22:29:47,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 22:29:47,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 22:29:47,672 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 22:29:47,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 22:29:47,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 22:29:47,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 22:29:47,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 22:29:47,673 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 22:29:47,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 22:29:47,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 22:29:47,674 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 22:29:47,674 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 22:29:47,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 22:29:47,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 22:29:47,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 22:29:47,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 22:29:47,676 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 22:29:47,676 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 22:29:47,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 22:29:47,677 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 22:29:47,677 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 22:29:47,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 22:29:47,678 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 22:29:47,678 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 22:29:47,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 22:29:47,679 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 22:29:47,679 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 22:29:47,679 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 22:29:47,679 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 22:29:47,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 22:29:47,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 22:29:47,680 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 22:29:47,680 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 22:29:47,680 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 22:29:47,681 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 22:29:47,681 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 -> 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 22:29:47,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 22:29:47,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 22:29:47,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 22:29:47,945 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 22:29:47,945 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 22:29:47,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/cart.i [2023-11-22 22:29:48,902 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 22:29:49,133 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 22:29:49,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/cart.i [2023-11-22 22:29:49,144 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/377630db5/9bfa4758fea142a5ab6816d36c3c1b8e/FLAG2a55b5662 [2023-11-22 22:29:49,154 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/377630db5/9bfa4758fea142a5ab6816d36c3c1b8e [2023-11-22 22:29:49,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 22:29:49,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 22:29:49,159 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 22:29:49,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 22:29:49,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 22:29:49,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:29:49" (1/1) ... [2023-11-22 22:29:49,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@436253db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:49, skipping insertion in model container [2023-11-22 22:29:49,165 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:29:49" (1/1) ... [2023-11-22 22:29:49,198 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 22:29:49,412 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-data/cart.i[23713,23726] [2023-11-22 22:29:49,416 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 22:29:49,425 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 22:29:49,459 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-data/cart.i[23713,23726] [2023-11-22 22:29:49,466 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 22:29:49,486 INFO L206 MainTranslator]: Completed translation [2023-11-22 22:29:49,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:49 WrapperNode [2023-11-22 22:29:49,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 22:29:49,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 22:29:49,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 22:29:49,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 22:29:49,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:49" (1/1) ... [2023-11-22 22:29:49,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:49" (1/1) ... [2023-11-22 22:29:49,519 INFO L138 Inliner]: procedures = 121, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2023-11-22 22:29:49,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 22:29:49,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 22:29:49,520 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 22:29:49,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 22:29:49,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:49" (1/1) ... [2023-11-22 22:29:49,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:49" (1/1) ... [2023-11-22 22:29:49,532 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:49" (1/1) ... [2023-11-22 22:29:49,541 INFO L189 HeapSplitter]: Split 20 memory accesses to 3 slices as follows [2, 7, 11] [2023-11-22 22:29:49,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:49" (1/1) ... [2023-11-22 22:29:49,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:49" (1/1) ... [2023-11-22 22:29:49,547 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:49" (1/1) ... [2023-11-22 22:29:49,549 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:49" (1/1) ... [2023-11-22 22:29:49,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:49" (1/1) ... [2023-11-22 22:29:49,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:49" (1/1) ... [2023-11-22 22:29:49,553 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 22:29:49,553 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 22:29:49,560 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 22:29:49,560 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 22:29:49,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:49" (1/1) ... [2023-11-22 22:29:49,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 22:29:49,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:29:49,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 22:29:49,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 22:29:49,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-22 22:29:49,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-22 22:29:49,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-22 22:29:49,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-22 22:29:49,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-22 22:29:49,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-22 22:29:49,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 22:29:49,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 22:29:49,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-22 22:29:49,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-22 22:29:49,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-22 22:29:49,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-22 22:29:49,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-22 22:29:49,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-22 22:29:49,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-22 22:29:49,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-22 22:29:49,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-22 22:29:49,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 22:29:49,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 22:29:49,750 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 22:29:49,751 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 22:29:49,947 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 22:29:49,960 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 22:29:49,965 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-22 22:29:49,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:29:49 BoogieIcfgContainer [2023-11-22 22:29:49,967 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 22:29:49,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 22:29:49,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 22:29:49,971 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 22:29:49,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:29:49" (1/3) ... [2023-11-22 22:29:49,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67929db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:29:49, skipping insertion in model container [2023-11-22 22:29:49,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:29:49" (2/3) ... [2023-11-22 22:29:49,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67929db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:29:49, skipping insertion in model container [2023-11-22 22:29:49,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:29:49" (3/3) ... [2023-11-22 22:29:49,974 INFO L112 eAbstractionObserver]: Analyzing ICFG cart.i [2023-11-22 22:29:49,988 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 22:29:49,989 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 22:29:50,029 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 22:29:50,034 INFO L357 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, mHoare=true, 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;@5becd578, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 22:29:50,034 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 22:29:50,044 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 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) [2023-11-22 22:29:50,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-22 22:29:50,048 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:29:50,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:29:50,050 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:29:50,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:29:50,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1487606993, now seen corresponding path program 1 times [2023-11-22 22:29:50,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:29:50,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563777227] [2023-11-22 22:29:50,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:29:50,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:29:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:29:50,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:29:50,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:29:50,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563777227] [2023-11-22 22:29:50,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563777227] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:29:50,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:29:50,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 22:29:50,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788887231] [2023-11-22 22:29:50,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:29:50,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 22:29:50,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:29:50,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 22:29:50,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 22:29:50,239 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 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) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2023-11-22 22:29:50,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:29:50,257 INFO L93 Difference]: Finished difference Result 31 states and 46 transitions. [2023-11-22 22:29:50,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 22:29:50,259 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2023-11-22 22:29:50,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:29:50,264 INFO L225 Difference]: With dead ends: 31 [2023-11-22 22:29:50,264 INFO L226 Difference]: Without dead ends: 16 [2023-11-22 22:29:50,266 INFO L412 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 [2023-11-22 22:29:50,269 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 22:29:50,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 22:29:50,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-11-22 22:29:50,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-11-22 22:29:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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) [2023-11-22 22:29:50,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2023-11-22 22:29:50,297 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 8 [2023-11-22 22:29:50,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:29:50,298 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2023-11-22 22:29:50,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2023-11-22 22:29:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2023-11-22 22:29:50,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-22 22:29:50,299 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:29:50,299 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:29:50,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 22:29:50,300 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:29:50,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:29:50,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2098913187, now seen corresponding path program 1 times [2023-11-22 22:29:50,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:29:50,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195738393] [2023-11-22 22:29:50,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:29:50,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:29:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:29:50,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:29:50,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:29:50,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195738393] [2023-11-22 22:29:50,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195738393] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:29:50,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:29:50,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 22:29:50,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958481541] [2023-11-22 22:29:50,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:29:50,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 22:29:50,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:29:50,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 22:29:50,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 22:29:50,455 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2023-11-22 22:29:50,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:29:50,511 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2023-11-22 22:29:50,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 22:29:50,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2023-11-22 22:29:50,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:29:50,512 INFO L225 Difference]: With dead ends: 35 [2023-11-22 22:29:50,512 INFO L226 Difference]: Without dead ends: 20 [2023-11-22 22:29:50,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 22:29:50,514 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 22:29:50,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 44 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 22:29:50,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-22 22:29:50,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-22 22:29:50,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 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) [2023-11-22 22:29:50,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2023-11-22 22:29:50,521 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 11 [2023-11-22 22:29:50,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:29:50,521 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2023-11-22 22:29:50,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2023-11-22 22:29:50,521 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2023-11-22 22:29:50,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-22 22:29:50,522 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:29:50,522 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:29:50,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 22:29:50,522 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:29:50,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:29:50,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2087693085, now seen corresponding path program 1 times [2023-11-22 22:29:50,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:29:50,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061897247] [2023-11-22 22:29:50,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:29:50,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:29:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:29:50,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:29:50,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:29:50,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061897247] [2023-11-22 22:29:50,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061897247] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:29:50,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:29:50,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 22:29:50,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576013034] [2023-11-22 22:29:50,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:29:50,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 22:29:50,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:29:50,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 22:29:50,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 22:29:50,609 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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) [2023-11-22 22:29:50,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:29:50,641 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2023-11-22 22:29:50,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 22:29:50,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 [2023-11-22 22:29:50,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:29:50,646 INFO L225 Difference]: With dead ends: 35 [2023-11-22 22:29:50,646 INFO L226 Difference]: Without dead ends: 29 [2023-11-22 22:29:50,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 22:29:50,649 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 22:29:50,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 36 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 22:29:50,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-22 22:29:50,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2023-11-22 22:29:50,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 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) [2023-11-22 22:29:50,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2023-11-22 22:29:50,660 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 15 [2023-11-22 22:29:50,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:29:50,660 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2023-11-22 22:29:50,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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) [2023-11-22 22:29:50,660 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2023-11-22 22:29:50,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 22:29:50,661 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:29:50,662 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:29:50,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 22:29:50,662 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:29:50,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:29:50,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1239572016, now seen corresponding path program 1 times [2023-11-22 22:29:50,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:29:50,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630938931] [2023-11-22 22:29:50,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:29:50,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:29:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:29:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 22:29:50,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:29:50,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630938931] [2023-11-22 22:29:50,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630938931] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:29:50,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:29:50,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 22:29:50,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887638393] [2023-11-22 22:29:50,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:29:50,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 22:29:50,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:29:50,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 22:29:50,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 22:29:50,742 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2023-11-22 22:29:50,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:29:50,752 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2023-11-22 22:29:50,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 22:29:50,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2023-11-22 22:29:50,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:29:50,753 INFO L225 Difference]: With dead ends: 36 [2023-11-22 22:29:50,753 INFO L226 Difference]: Without dead ends: 26 [2023-11-22 22:29:50,754 INFO L412 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 [2023-11-22 22:29:50,755 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 22:29:50,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 22:29:50,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-22 22:29:50,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-22 22:29:50,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 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) [2023-11-22 22:29:50,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2023-11-22 22:29:50,763 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 19 [2023-11-22 22:29:50,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:29:50,763 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2023-11-22 22:29:50,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2023-11-22 22:29:50,763 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2023-11-22 22:29:50,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 22:29:50,765 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:29:50,766 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:29:50,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 22:29:50,766 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:29:50,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:29:50,767 INFO L85 PathProgramCache]: Analyzing trace with hash 430225390, now seen corresponding path program 1 times [2023-11-22 22:29:50,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:29:50,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142790225] [2023-11-22 22:29:50,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:29:50,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:29:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:29:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:29:51,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:29:51,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142790225] [2023-11-22 22:29:51,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142790225] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 22:29:51,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761420641] [2023-11-22 22:29:51,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:29:51,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:29:51,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:29:51,177 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) [2023-11-22 22:29:51,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-22 22:29:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:29:51,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-22 22:29:51,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:29:51,414 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 45 treesize of output 15 [2023-11-22 22:29:51,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:29:51,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2023-11-22 22:29:51,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:29:51,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:29:51,587 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-22 22:29:51,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1596 treesize of output 1405 [2023-11-22 22:29:51,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 22:29:51,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761420641] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:29:51,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 22:29:51,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 12 [2023-11-22 22:29:51,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901824172] [2023-11-22 22:29:51,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 22:29:51,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-22 22:29:51,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:29:51,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-22 22:29:51,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-22 22:29:51,738 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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) [2023-11-22 22:29:51,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:29:51,926 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2023-11-22 22:29:51,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 22:29:51,926 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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 19 [2023-11-22 22:29:51,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:29:51,927 INFO L225 Difference]: With dead ends: 47 [2023-11-22 22:29:51,927 INFO L226 Difference]: Without dead ends: 45 [2023-11-22 22:29:51,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2023-11-22 22:29:51,930 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 69 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 22:29:51,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 117 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 22:29:51,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-22 22:29:51,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2023-11-22 22:29:51,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 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) [2023-11-22 22:29:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2023-11-22 22:29:51,943 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 19 [2023-11-22 22:29:51,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:29:51,946 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2023-11-22 22:29:51,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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) [2023-11-22 22:29:51,946 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2023-11-22 22:29:51,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-22 22:29:51,946 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:29:51,947 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:29:51,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-22 22:29:52,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:29:52,158 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:29:52,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:29:52,159 INFO L85 PathProgramCache]: Analyzing trace with hash 666078984, now seen corresponding path program 1 times [2023-11-22 22:29:52,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:29:52,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799214354] [2023-11-22 22:29:52,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:29:52,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:29:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:29:52,287 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 22:29:52,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:29:52,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799214354] [2023-11-22 22:29:52,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799214354] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 22:29:52,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285991877] [2023-11-22 22:29:52,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:29:52,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:29:52,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:29:52,289 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) [2023-11-22 22:29:52,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-22 22:29:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:29:52,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-22 22:29:52,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:29:52,403 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 8 treesize of output 1 [2023-11-22 22:29:52,408 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 8 treesize of output 1 [2023-11-22 22:29:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:29:52,466 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:29:52,512 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 33 treesize of output 29 [2023-11-22 22:29:52,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:29:52,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2023-11-22 22:29:52,522 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 39 treesize of output 35 [2023-11-22 22:29:52,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:29:52,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2023-11-22 22:29:52,551 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 22:29:52,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285991877] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:29:52,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 22:29:52,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 13 [2023-11-22 22:29:52,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667402595] [2023-11-22 22:29:52,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 22:29:52,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-22 22:29:52,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:29:52,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-22 22:29:52,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-11-22 22:29:52,553 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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) [2023-11-22 22:29:52,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:29:52,694 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2023-11-22 22:29:52,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 22:29:52,695 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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 22 [2023-11-22 22:29:52,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:29:52,695 INFO L225 Difference]: With dead ends: 58 [2023-11-22 22:29:52,695 INFO L226 Difference]: Without dead ends: 48 [2023-11-22 22:29:52,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2023-11-22 22:29:52,696 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 79 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 22:29:52,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 114 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 22:29:52,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-22 22:29:52,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2023-11-22 22:29:52,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 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) [2023-11-22 22:29:52,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2023-11-22 22:29:52,700 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 22 [2023-11-22 22:29:52,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:29:52,701 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2023-11-22 22:29:52,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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) [2023-11-22 22:29:52,701 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2023-11-22 22:29:52,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-22 22:29:52,702 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:29:52,702 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:29:52,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-22 22:29:52,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-22 22:29:52,913 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:29:52,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:29:52,913 INFO L85 PathProgramCache]: Analyzing trace with hash -110453383, now seen corresponding path program 2 times [2023-11-22 22:29:52,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:29:52,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402024071] [2023-11-22 22:29:52,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:29:52,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:29:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:29:53,100 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:29:53,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:29:53,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402024071] [2023-11-22 22:29:53,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402024071] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 22:29:53,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670205157] [2023-11-22 22:29:53,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 22:29:53,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:29:53,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:29:53,117 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) [2023-11-22 22:29:53,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-22 22:29:53,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 22:29:53,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 22:29:53,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-22 22:29:53,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:29:53,224 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 [2023-11-22 22:29:53,227 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 [2023-11-22 22:29:53,286 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 18 treesize of output 14 [2023-11-22 22:29:53,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2023-11-22 22:29:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:29:53,301 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:29:53,348 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:29:53,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670205157] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:29:53,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 22:29:53,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-11-22 22:29:53,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490151184] [2023-11-22 22:29:53,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 22:29:53,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 22:29:53,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:29:53,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 22:29:53,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-22 22:29:53,351 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 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) [2023-11-22 22:29:53,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:29:53,418 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2023-11-22 22:29:53,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 22:29:53,418 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 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 23 [2023-11-22 22:29:53,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:29:53,419 INFO L225 Difference]: With dead ends: 66 [2023-11-22 22:29:53,419 INFO L226 Difference]: Without dead ends: 39 [2023-11-22 22:29:53,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-22 22:29:53,419 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 22:29:53,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 95 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 22:29:53,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-22 22:29:53,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-11-22 22:29:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 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) [2023-11-22 22:29:53,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2023-11-22 22:29:53,422 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 23 [2023-11-22 22:29:53,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:29:53,422 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2023-11-22 22:29:53,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 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) [2023-11-22 22:29:53,423 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2023-11-22 22:29:53,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-22 22:29:53,423 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:29:53,423 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:29:53,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-22 22:29:53,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:29:53,624 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:29:53,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:29:53,624 INFO L85 PathProgramCache]: Analyzing trace with hash -948094721, now seen corresponding path program 3 times [2023-11-22 22:29:53,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:29:53,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428285712] [2023-11-22 22:29:53,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:29:53,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:29:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:29:54,087 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:29:54,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:29:54,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428285712] [2023-11-22 22:29:54,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428285712] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 22:29:54,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66027421] [2023-11-22 22:29:54,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 22:29:54,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:29:54,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:29:54,113 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) [2023-11-22 22:29:54,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-22 22:29:54,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-22 22:29:54,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 22:29:54,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-22 22:29:54,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:29:54,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2023-11-22 22:29:54,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-22 22:29:54,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-22 22:29:54,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 15 [2023-11-22 22:29:54,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 48 [2023-11-22 22:29:54,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:29:54,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2023-11-22 22:29:54,417 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-22 22:29:54,417 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 1 case distinctions, treesize of input 20 treesize of output 17 [2023-11-22 22:29:54,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2023-11-22 22:29:54,502 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:29:54,502 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:29:54,588 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 38 treesize of output 28 [2023-11-22 22:29:54,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:29:54,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 84 [2023-11-22 22:29:54,651 WARN L854 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_main_#t~short8#1| (let ((.cse5 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4)) (.cse8 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse3 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) (.cse4 (store .cse8 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) |c_ULTIMATE.start_main_~order~0#1|)) (.cse0 (select .cse8 .cse5))) (and (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) |c_ULTIMATE.start_main_~i~0#1.offset|) (forall ((v_arrayElimCell_24 Int) (v_ArrVal_380 Int) (v_ArrVal_386 (Array Int Int))) (or (< v_ArrVal_380 .cse0) (let ((.cse1 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 .cse5 v_ArrVal_380)) v_arrayElimCell_24 v_ArrVal_386) |c_ULTIMATE.start_main_~l~0#1.base|))) (< (select .cse1 .cse2) (+ (select .cse1 .cse3) 1)))))) (forall ((v_ArrVal_380 Int)) (or (forall ((v_ArrVal_386 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 .cse5 v_ArrVal_380)) 0 v_ArrVal_386) |c_ULTIMATE.start_main_~l~0#1.base|))) (< (select .cse6 .cse2) (+ (select .cse6 .cse3) 1)))) (< v_ArrVal_380 .cse0))) (forall ((v_ArrVal_380 Int)) (or (forall ((v_arrayElimCell_24 Int) (v_ArrVal_386 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~i~0#1.base| v_arrayElimCell_24) (let ((.cse7 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 .cse5 v_ArrVal_380)) v_arrayElimCell_24 v_ArrVal_386) |c_ULTIMATE.start_main_~l~0#1.base|))) (< (select .cse7 .cse2) (+ (select .cse7 .cse3) 1))))) (< v_ArrVal_380 .cse0))))))) is different from false [2023-11-22 22:29:54,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:29:54,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 210 treesize of output 183 [2023-11-22 22:29:54,708 INFO L349 Elim1Store]: treesize reduction 35, result has 36.4 percent of original size [2023-11-22 22:29:54,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 163 [2023-11-22 22:29:54,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:29:54,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 108 [2023-11-22 22:29:54,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:29:54,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 319 treesize of output 309 [2023-11-22 22:29:54,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:29:54,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 206 [2023-11-22 22:29:54,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 134 [2023-11-22 22:29:54,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 126 [2023-11-22 22:29:54,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-22 22:29:55,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2023-11-22 22:29:55,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:29:55,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 26 [2023-11-22 22:29:55,103 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-22 22:29:55,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66027421] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:29:55,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 22:29:55,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 25 [2023-11-22 22:29:55,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510275555] [2023-11-22 22:29:55,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 22:29:55,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-22 22:29:55,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:29:55,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-22 22:29:55,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=457, Unknown=1, NotChecked=44, Total=600 [2023-11-22 22:29:55,104 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 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) [2023-11-22 22:29:55,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:29:55,365 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2023-11-22 22:29:55,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 22:29:55,365 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 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 27 [2023-11-22 22:29:55,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:29:55,366 INFO L225 Difference]: With dead ends: 64 [2023-11-22 22:29:55,366 INFO L226 Difference]: Without dead ends: 59 [2023-11-22 22:29:55,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=712, Unknown=1, NotChecked=58, Total=992 [2023-11-22 22:29:55,367 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 268 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 22:29:55,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 220 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 165 Invalid, 0 Unknown, 63 Unchecked, 0.1s Time] [2023-11-22 22:29:55,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-22 22:29:55,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2023-11-22 22:29:55,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 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) [2023-11-22 22:29:55,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2023-11-22 22:29:55,371 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 27 [2023-11-22 22:29:55,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:29:55,371 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2023-11-22 22:29:55,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 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) [2023-11-22 22:29:55,371 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2023-11-22 22:29:55,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-22 22:29:55,372 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:29:55,372 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:29:55,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-22 22:29:55,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:29:55,572 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:29:55,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:29:55,573 INFO L85 PathProgramCache]: Analyzing trace with hash -980998057, now seen corresponding path program 2 times [2023-11-22 22:29:55,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:29:55,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513403827] [2023-11-22 22:29:55,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:29:55,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:29:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:29:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:29:56,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:29:56,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513403827] [2023-11-22 22:29:56,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513403827] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 22:29:56,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500507281] [2023-11-22 22:29:56,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 22:29:56,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:29:56,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:29:56,125 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) [2023-11-22 22:29:56,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-22 22:29:56,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 22:29:56,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 22:29:56,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-22 22:29:56,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:29:56,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-22 22:29:56,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 22:29:56,251 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-22 22:29:56,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-22 22:29:56,254 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 [2023-11-22 22:29:56,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2023-11-22 22:29:56,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2023-11-22 22:29:56,419 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 22:29:56,419 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 128 [2023-11-22 22:29:56,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 23 [2023-11-22 22:29:56,428 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 35 treesize of output 11 [2023-11-22 22:29:56,432 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 35 treesize of output 11 [2023-11-22 22:29:56,500 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 35 treesize of output 19 [2023-11-22 22:29:56,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-22 22:29:56,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:29:56,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2023-11-22 22:29:56,510 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:29:56,510 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:29:56,636 INFO L349 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2023-11-22 22:29:56,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1950 treesize of output 1645 [2023-11-22 22:29:56,730 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_516 (Array Int Int))) (or (not (= v_ArrVal_516 (let ((.cse1 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (store (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|) .cse0 (select v_ArrVal_516 .cse0))) .cse1 (select v_ArrVal_516 .cse1))))) (= |c_ULTIMATE.start_main_~i~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))) (forall ((v_ArrVal_514 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) |c_ULTIMATE.start_main_~i~0#1.base|))) is different from false [2023-11-22 22:29:58,793 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse5 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4)) (.cse1 (select .cse7 |c_ULTIMATE.start_main_~i~0#1.offset|))) (and (forall ((v_ArrVal_511 (Array Int Int))) (or (forall ((v_ArrVal_516 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_511)) (.cse3 (select v_ArrVal_511 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (not (= v_ArrVal_516 (let ((.cse4 (+ .cse3 4))) (store (let ((.cse2 (+ .cse3 8))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_516 .cse2))) .cse4 (select v_ArrVal_516 .cse4))))) (= (select (select (store .cse0 .cse1 v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse3)))) (not (= v_ArrVal_511 (store (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|) .cse5 (select v_ArrVal_511 .cse5)) .cse6 (select v_ArrVal_511 .cse6)))))) (forall ((v_ArrVal_514 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_508 Int)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse7 .cse5 v_ArrVal_509) .cse6 v_ArrVal_508)) .cse1 v_ArrVal_514) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse1))))) is different from false [2023-11-22 22:29:59,046 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-22 22:29:59,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 133 [2023-11-22 22:29:59,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:29:59,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 95 [2023-11-22 22:29:59,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:29:59,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 80 [2023-11-22 22:29:59,069 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 78 treesize of output 70 [2023-11-22 22:29:59,073 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 57 treesize of output 55 [2023-11-22 22:29:59,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2023-11-22 22:29:59,103 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-22 22:29:59,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500507281] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:29:59,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 22:29:59,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2023-11-22 22:29:59,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710602986] [2023-11-22 22:29:59,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 22:29:59,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-22 22:29:59,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:29:59,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-22 22:29:59,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=427, Unknown=3, NotChecked=86, Total=600 [2023-11-22 22:29:59,109 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 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) [2023-11-22 22:29:59,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:29:59,817 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2023-11-22 22:29:59,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-22 22:29:59,818 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 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 30 [2023-11-22 22:29:59,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:29:59,818 INFO L225 Difference]: With dead ends: 59 [2023-11-22 22:29:59,818 INFO L226 Difference]: Without dead ends: 57 [2023-11-22 22:29:59,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=223, Invalid=904, Unknown=3, NotChecked=130, Total=1260 [2023-11-22 22:29:59,819 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 144 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 22:29:59,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 324 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 297 Invalid, 0 Unknown, 115 Unchecked, 0.3s Time] [2023-11-22 22:29:59,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-22 22:29:59,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2023-11-22 22:29:59,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.32) internal successors, (66), 50 states have internal predecessors, (66), 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) [2023-11-22 22:29:59,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2023-11-22 22:29:59,825 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 30 [2023-11-22 22:29:59,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:29:59,825 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2023-11-22 22:29:59,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 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) [2023-11-22 22:29:59,825 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2023-11-22 22:29:59,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-22 22:29:59,826 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:29:59,826 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:29:59,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-22 22:30:00,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:30:00,037 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:30:00,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:30:00,037 INFO L85 PathProgramCache]: Analyzing trace with hash 369765898, now seen corresponding path program 4 times [2023-11-22 22:30:00,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:30:00,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87246659] [2023-11-22 22:30:00,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:30:00,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:30:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:30:00,469 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:30:00,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:30:00,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87246659] [2023-11-22 22:30:00,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87246659] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 22:30:00,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121490866] [2023-11-22 22:30:00,470 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-22 22:30:00,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:30:00,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:30:00,485 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) [2023-11-22 22:30:00,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-22 22:30:00,703 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-22 22:30:00,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 22:30:00,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-22 22:30:00,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:30:00,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-22 22:30:00,727 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 [2023-11-22 22:30:00,731 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 [2023-11-22 22:30:00,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-22 22:30:00,780 INFO L349 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2023-11-22 22:30:00,781 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 21 treesize of output 31 [2023-11-22 22:30:00,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-22 22:30:00,795 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-22 22:30:00,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-22 22:30:00,800 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 20 treesize of output 15 [2023-11-22 22:30:00,934 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 22:30:00,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 32 [2023-11-22 22:30:00,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2023-11-22 22:30:01,016 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 22:30:01,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 90 [2023-11-22 22:30:01,023 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 22:30:01,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 47 [2023-11-22 22:30:01,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2023-11-22 22:30:01,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-22 22:30:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:30:01,036 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:30:01,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:30:01,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 49 [2023-11-22 22:30:01,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:30:01,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 40 [2023-11-22 22:30:01,185 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 6 treesize of output 4 [2023-11-22 22:30:01,192 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 6 treesize of output 4 [2023-11-22 22:30:01,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:30:01,318 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-11-22 22:30:01,320 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 22:30:01,323 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 16 treesize of output 8 [2023-11-22 22:30:01,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:30:01,330 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2023-11-22 22:30:01,332 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 22:30:01,333 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 20 treesize of output 8 [2023-11-22 22:30:01,342 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:30:01,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121490866] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:30:01,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 22:30:01,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-11-22 22:30:01,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417969392] [2023-11-22 22:30:01,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 22:30:01,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-22 22:30:01,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:30:01,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-22 22:30:01,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-11-22 22:30:01,346 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 14 states have internal predecessors, (61), 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) [2023-11-22 22:30:01,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:30:01,592 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2023-11-22 22:30:01,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 22:30:01,593 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 14 states have internal predecessors, (61), 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 31 [2023-11-22 22:30:01,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:30:01,593 INFO L225 Difference]: With dead ends: 95 [2023-11-22 22:30:01,593 INFO L226 Difference]: Without dead ends: 55 [2023-11-22 22:30:01,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2023-11-22 22:30:01,594 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 82 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 22:30:01,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 206 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 22:30:01,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-22 22:30:01,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-22 22:30:01,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 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) [2023-11-22 22:30:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2023-11-22 22:30:01,598 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 31 [2023-11-22 22:30:01,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:30:01,598 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2023-11-22 22:30:01,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 14 states have internal predecessors, (61), 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) [2023-11-22 22:30:01,598 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2023-11-22 22:30:01,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-22 22:30:01,599 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:30:01,599 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:30:01,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-22 22:30:01,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:30:01,810 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:30:01,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:30:01,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1121721456, now seen corresponding path program 5 times [2023-11-22 22:30:01,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:30:01,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487517893] [2023-11-22 22:30:01,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:30:01,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:30:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:30:02,732 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:30:02,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:30:02,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487517893] [2023-11-22 22:30:02,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487517893] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 22:30:02,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346472741] [2023-11-22 22:30:02,733 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-22 22:30:02,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:30:02,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:30:02,749 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 22:30:02,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-22 22:30:04,180 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-22 22:30:04,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 22:30:04,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-22 22:30:04,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:30:04,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-22 22:30:04,220 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-11-22 22:30:04,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-11-22 22:30:04,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 22:30:04,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-22 22:30:04,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 22:30:04,266 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 22 treesize of output 17 [2023-11-22 22:30:04,276 INFO L349 Elim1Store]: treesize reduction 37, result has 24.5 percent of original size [2023-11-22 22:30:04,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 22 [2023-11-22 22:30:04,281 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 [2023-11-22 22:30:04,413 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 45 treesize of output 15 [2023-11-22 22:30:04,426 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 22:30:04,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 22 [2023-11-22 22:30:04,433 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 18 treesize of output 14 [2023-11-22 22:30:04,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2023-11-22 22:30:04,492 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 22:30:04,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 59 [2023-11-22 22:30:04,500 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-22 22:30:04,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 23 [2023-11-22 22:30:04,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2023-11-22 22:30:04,533 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 20 treesize of output 13 [2023-11-22 22:30:04,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:30:04,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2023-11-22 22:30:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:30:04,551 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:30:04,710 WARN L854 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_main_#t~short8#1| (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_871 Int) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_870 (Array Int Int))) (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse1 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (or (let ((.cse0 (select (let ((.cse4 (select v_ArrVal_870 |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse1 .cse2 |c_ULTIMATE.start_main_~order~0#1|) .cse3 v_ArrVal_871)) .cse4 v_ArrVal_877) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_870) .cse4) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) v_ArrVal_878)) |c_ULTIMATE.start_main_~l~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (+ (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) 1))) (not (= v_ArrVal_870 (store (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|) .cse2 (select v_ArrVal_870 .cse2)) .cse3 (select v_ArrVal_870 .cse3)))) (< v_ArrVal_871 (select .cse1 .cse3)))))) is different from false [2023-11-22 22:30:04,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:30:04,728 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 86 [2023-11-22 22:30:04,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:30:04,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 157 treesize of output 181 [2023-11-22 22:30:04,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 106 [2023-11-22 22:30:04,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2023-11-22 22:30:05,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:30:05,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 46 [2023-11-22 22:30:05,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-22 22:30:05,086 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 6 treesize of output 4 [2023-11-22 22:30:05,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:30:05,158 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2023-11-22 22:30:05,160 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 22:30:05,161 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 21 treesize of output 9 [2023-11-22 22:30:05,162 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 11 treesize of output 9 [2023-11-22 22:30:05,198 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-22 22:30:05,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346472741] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:30:05,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 22:30:05,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2023-11-22 22:30:05,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079261728] [2023-11-22 22:30:05,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 22:30:05,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-22 22:30:05,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:30:05,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-22 22:30:05,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=536, Unknown=16, NotChecked=48, Total=702 [2023-11-22 22:30:05,199 INFO L87 Difference]: Start difference. First operand 55 states and 71 transitions. Second operand has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 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) [2023-11-22 22:30:05,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:30:05,601 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2023-11-22 22:30:05,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 22:30:05,602 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 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 35 [2023-11-22 22:30:05,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:30:05,602 INFO L225 Difference]: With dead ends: 86 [2023-11-22 22:30:05,602 INFO L226 Difference]: Without dead ends: 81 [2023-11-22 22:30:05,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=277, Invalid=971, Unknown=16, NotChecked=68, Total=1332 [2023-11-22 22:30:05,603 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 335 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 22:30:05,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 263 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 160 Invalid, 0 Unknown, 83 Unchecked, 0.2s Time] [2023-11-22 22:30:05,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-22 22:30:05,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 62. [2023-11-22 22:30:05,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 61 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) [2023-11-22 22:30:05,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 81 transitions. [2023-11-22 22:30:05,608 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 81 transitions. Word has length 35 [2023-11-22 22:30:05,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:30:05,608 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 81 transitions. [2023-11-22 22:30:05,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 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) [2023-11-22 22:30:05,608 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2023-11-22 22:30:05,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-22 22:30:05,609 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:30:05,609 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:30:05,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-22 22:30:05,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:30:05,809 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:30:05,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:30:05,810 INFO L85 PathProgramCache]: Analyzing trace with hash -752007675, now seen corresponding path program 3 times [2023-11-22 22:30:05,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:30:05,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517629798] [2023-11-22 22:30:05,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:30:05,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:30:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:30:06,187 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 22:30:06,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:30:06,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517629798] [2023-11-22 22:30:06,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517629798] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 22:30:06,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562353555] [2023-11-22 22:30:06,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 22:30:06,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:30:06,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:30:06,205 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 22:30:06,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-22 22:30:06,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-22 22:30:06,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 22:30:06,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-22 22:30:06,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:30:06,395 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 [2023-11-22 22:30:06,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 22:30:06,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2023-11-22 22:30:06,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2023-11-22 22:30:06,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 59 [2023-11-22 22:30:06,572 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-11-22 22:30:06,573 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 1 case distinctions, treesize of input 24 treesize of output 19 [2023-11-22 22:30:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 22:30:06,764 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:30:36,084 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 91 treesize of output 89 [2023-11-22 22:30:36,121 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-11-22 22:30:36,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 807 treesize of output 785 [2023-11-22 22:30:36,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:30:36,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 6 [2023-11-22 22:30:36,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:30:36,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 6 [2023-11-22 22:30:36,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:30:36,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 6 [2023-11-22 22:30:36,188 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 22:30:36,188 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 22:30:36,189 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 22:30:36,189 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 22:30:36,189 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 22:30:36,190 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 22:30:36,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 1 [2023-11-22 22:30:36,225 INFO L349 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2023-11-22 22:30:36,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2023-11-22 22:30:36,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2023-11-22 22:30:36,234 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 36 treesize of output 24 [2023-11-22 22:30:36,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:30:36,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 6 [2023-11-22 22:30:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 22:30:36,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562353555] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:30:36,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 22:30:36,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 25 [2023-11-22 22:30:36,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394821503] [2023-11-22 22:30:36,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 22:30:36,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-22 22:30:36,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:30:36,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-22 22:30:36,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=495, Unknown=13, NotChecked=0, Total=600 [2023-11-22 22:30:36,273 INFO L87 Difference]: Start difference. First operand 62 states and 81 transitions. Second operand has 25 states, 25 states have (on average 3.0) internal successors, (75), 25 states have internal predecessors, (75), 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) [2023-11-22 22:30:39,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:30:39,080 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2023-11-22 22:30:39,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-22 22:30:39,081 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.0) internal successors, (75), 25 states have internal predecessors, (75), 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 37 [2023-11-22 22:30:39,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:30:39,081 INFO L225 Difference]: With dead ends: 75 [2023-11-22 22:30:39,081 INFO L226 Difference]: Without dead ends: 62 [2023-11-22 22:30:39,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=291, Invalid=1256, Unknown=13, NotChecked=0, Total=1560 [2023-11-22 22:30:39,083 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 132 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-22 22:30:39,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 326 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-22 22:30:39,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-22 22:30:39,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2023-11-22 22:30:39,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 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) [2023-11-22 22:30:39,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2023-11-22 22:30:39,097 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 37 [2023-11-22 22:30:39,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:30:39,098 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2023-11-22 22:30:39,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.0) internal successors, (75), 25 states have internal predecessors, (75), 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) [2023-11-22 22:30:39,098 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2023-11-22 22:30:39,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-22 22:30:39,101 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:30:39,101 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:30:39,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-22 22:30:39,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-22 22:30:39,314 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:30:39,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:30:39,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1940531238, now seen corresponding path program 4 times [2023-11-22 22:30:39,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:30:39,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934650069] [2023-11-22 22:30:39,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:30:39,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:30:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:30:40,276 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:30:40,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:30:40,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934650069] [2023-11-22 22:30:40,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934650069] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 22:30:40,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71406646] [2023-11-22 22:30:40,276 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-22 22:30:40,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:30:40,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:30:40,288 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 22:30:40,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-22 22:30:40,547 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-22 22:30:40,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 22:30:40,549 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 84 conjunts are in the unsatisfiable core [2023-11-22 22:30:40,557 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:30:40,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-22 22:30:40,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 22:30:40,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2023-11-22 22:30:40,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2023-11-22 22:30:40,653 INFO L349 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2023-11-22 22:30:40,653 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 1 case distinctions, treesize of input 21 treesize of output 31 [2023-11-22 22:30:40,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-22 22:30:40,664 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 8 treesize of output 1 [2023-11-22 22:30:40,675 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-22 22:30:40,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-22 22:30:40,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 23 [2023-11-22 22:30:40,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2023-11-22 22:30:41,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 125 [2023-11-22 22:30:41,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 23 [2023-11-22 22:30:41,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2023-11-22 22:30:41,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 15 [2023-11-22 22:30:41,135 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 22:30:41,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 92 [2023-11-22 22:30:41,151 INFO L349 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2023-11-22 22:30:41,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 33 [2023-11-22 22:30:41,186 INFO L349 Elim1Store]: treesize reduction 64, result has 40.2 percent of original size [2023-11-22 22:30:41,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2023-11-22 22:30:41,412 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-22 22:30:41,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 47 [2023-11-22 22:30:41,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-22 22:30:41,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2023-11-22 22:30:41,460 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:30:41,460 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:30:41,680 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1241 Int) (v_DerPreprocessor_37 Int) (v_ArrVal_1245 (Array Int Int)) (v_ArrVal_1234 Int) (v_ArrVal_1237 Int) (v_ArrVal_1248 Int) (v_ArrVal_1247 Int) (v_ArrVal_1239 Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse10 .cse3 v_ArrVal_1241) .cse4 v_ArrVal_1237))) (.cse5 (select .cse10 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse6 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse8 (select .cse7 .cse5)) (.cse9 (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (let ((.cse0 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse6 .cse3 |c_ULTIMATE.start_main_~order~0#1|) .cse4 v_ArrVal_1234)) .cse5 v_ArrVal_1245) (select (select (store .cse7 .cse5 (store (store .cse8 (+ .cse9 8) v_ArrVal_1247) (+ .cse9 4) v_ArrVal_1248)) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (.cse1 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse2 .cse3 v_DerPreprocessor_37) .cse4 v_ArrVal_1239)) .cse5 v_ArrVal_1249) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (< (select .cse0 (+ .cse1 8)) (+ (select .cse0 (+ .cse1 4)) 1))) (< v_ArrVal_1234 (select .cse6 .cse4)) (not (= 0 (select .cse8 .cse9)))))))) |c_ULTIMATE.start_main_#t~short8#1|) is different from false [2023-11-22 22:30:41,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:30:41,702 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 262 treesize of output 240 [2023-11-22 22:30:41,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:30:41,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 427 treesize of output 633 [2023-11-22 22:30:41,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 76 [2023-11-22 22:31:06,547 WARN L293 SmtUtils]: Spent 9.32s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-22 22:31:06,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:31:06,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 969 treesize of output 1079 [2023-11-22 22:31:37,110 WARN L293 SmtUtils]: Spent 30.54s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-22 22:31:37,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:31:37,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 798 treesize of output 1034 [2023-11-22 22:31:37,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-22 22:31:37,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-22 22:31:37,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-22 22:31:37,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-22 22:31:37,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-22 22:31:37,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-22 22:31:38,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-22 22:31:38,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-22 22:31:38,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-22 22:31:38,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-22 22:31:38,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-22 22:31:38,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-22 22:31:38,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 24 [2023-11-22 22:31:38,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 24 [2023-11-22 22:31:38,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 24 [2023-11-22 22:31:38,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 24 [2023-11-22 22:31:38,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-22 22:31:39,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-22 22:31:39,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-22 22:31:39,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-22 22:31:39,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-22 22:31:39,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-22 22:31:39,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-22 22:31:39,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-22 22:31:39,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2023-11-22 22:31:39,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2023-11-22 22:31:39,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2023-11-22 22:31:40,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2023-11-22 22:31:40,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 24 [2023-11-22 22:31:40,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 24 [2023-11-22 22:31:40,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 24 [2023-11-22 22:31:40,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 24 [2023-11-22 22:31:40,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 4 [2023-11-22 22:31:40,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 4 [2023-11-22 22:31:40,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 4 [2023-11-22 22:31:40,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 4 [2023-11-22 22:31:40,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 24 [2023-11-22 22:31:40,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 4 [2023-11-22 22:31:40,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 4 [2023-11-22 22:31:44,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:31:44,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1176 treesize of output 921 [2023-11-22 22:31:44,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:31:44,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 912 treesize of output 769 [2023-11-22 22:31:56,707 WARN L293 SmtUtils]: Spent 12.13s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-22 22:31:56,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:31:56,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 2488 treesize of output 2558 [2023-11-22 22:31:57,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:31:57,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 15 new quantified variables, introduced 45 case distinctions, treesize of input 7799 treesize of output 6168 [2023-11-22 22:31:57,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:31:57,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1129 treesize of output 1089 [2023-11-22 22:31:57,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:31:57,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 903 treesize of output 974 [2023-11-22 22:31:57,636 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 893 treesize of output 891 [2023-11-22 22:31:57,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:31:57,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1054 treesize of output 1014 [2023-11-22 22:31:57,807 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 871 treesize of output 863 [2023-11-22 22:31:57,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:31:57,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1022 treesize of output 986 [2023-11-22 22:31:57,955 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 847 treesize of output 845 [2023-11-22 22:31:58,031 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 845 treesize of output 841 [2023-11-22 22:31:58,098 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 841 treesize of output 839 [2023-11-22 22:31:58,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:31:58,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1032 treesize of output 988 [2023-11-22 22:31:58,305 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 830 treesize of output 828 [2023-11-22 22:31:58,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:31:58,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 979 treesize of output 935 [2023-11-22 22:31:58,496 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 804 treesize of output 796 [2023-11-22 22:31:58,576 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 796 treesize of output 794 [2023-11-22 22:32:19,350 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 5 treesize of output 3 [2023-11-22 22:32:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-22 22:32:19,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71406646] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:32:19,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 22:32:19,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 34 [2023-11-22 22:32:19,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691569129] [2023-11-22 22:32:19,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 22:32:19,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-22 22:32:19,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:32:19,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-22 22:32:19,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=924, Unknown=4, NotChecked=62, Total=1122 [2023-11-22 22:32:19,633 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. Second operand has 34 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 34 states have internal predecessors, (98), 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) [2023-11-22 22:32:23,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-22 22:32:25,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-22 22:32:28,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-22 22:32:31,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-22 22:32:33,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-22 22:32:37,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-22 22:32:40,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:32:40,349 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2023-11-22 22:32:40,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-22 22:32:40,349 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 34 states have internal predecessors, (98), 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 38 [2023-11-22 22:32:40,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:32:40,350 INFO L225 Difference]: With dead ends: 78 [2023-11-22 22:32:40,350 INFO L226 Difference]: Without dead ends: 76 [2023-11-22 22:32:40,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=371, Invalid=1699, Unknown=4, NotChecked=88, Total=2162 [2023-11-22 22:32:40,351 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 208 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 23 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2023-11-22 22:32:40,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 636 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 467 Invalid, 3 Unknown, 82 Unchecked, 18.0s Time] [2023-11-22 22:32:40,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-22 22:32:40,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 60. [2023-11-22 22:32:40,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 59 states have internal predecessors, (78), 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) [2023-11-22 22:32:40,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2023-11-22 22:32:40,355 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 38 [2023-11-22 22:32:40,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:32:40,355 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2023-11-22 22:32:40,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 34 states have internal predecessors, (98), 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) [2023-11-22 22:32:40,355 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2023-11-22 22:32:40,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-22 22:32:40,356 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:32:40,356 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:32:40,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-22 22:32:40,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-22 22:32:40,561 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:32:40,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:32:40,561 INFO L85 PathProgramCache]: Analyzing trace with hash 742860827, now seen corresponding path program 6 times [2023-11-22 22:32:40,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:32:40,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094577089] [2023-11-22 22:32:40,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:32:40,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:32:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:32:41,349 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:32:41,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:32:41,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094577089] [2023-11-22 22:32:41,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094577089] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 22:32:41,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220374552] [2023-11-22 22:32:41,350 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-22 22:32:41,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:32:41,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:32:41,365 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 22:32:41,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-22 22:32:42,186 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-11-22 22:32:42,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 22:32:42,191 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 93 conjunts are in the unsatisfiable core [2023-11-22 22:32:42,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:32:42,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-22 22:32:42,227 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 [2023-11-22 22:32:42,277 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 [2023-11-22 22:32:42,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-22 22:32:42,304 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-11-22 22:32:42,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-11-22 22:32:42,318 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 20 treesize of output 15 [2023-11-22 22:32:42,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-22 22:32:42,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 22:32:42,423 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-22 22:32:42,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 42 [2023-11-22 22:32:42,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 22:32:42,435 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-11-22 22:32:42,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2023-11-22 22:32:42,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 22:32:42,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2023-11-22 22:32:42,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-22 22:32:42,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 15 [2023-11-22 22:32:42,757 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-22 22:32:42,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 46 [2023-11-22 22:32:42,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 22:32:42,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2023-11-22 22:32:42,955 INFO L349 Elim1Store]: treesize reduction 70, result has 13.6 percent of original size [2023-11-22 22:32:42,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 166 treesize of output 131 [2023-11-22 22:32:42,967 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-22 22:32:42,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 25 [2023-11-22 22:32:42,971 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-22 22:32:42,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2023-11-22 22:32:42,987 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-11-22 22:32:42,987 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 1 case distinctions, treesize of input 28 treesize of output 21 [2023-11-22 22:32:43,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 31 [2023-11-22 22:32:43,148 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-22 22:32:43,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 76 [2023-11-22 22:32:43,161 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-11-22 22:32:43,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 30 [2023-11-22 22:32:43,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2023-11-22 22:32:43,227 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 20 treesize of output 13 [2023-11-22 22:32:43,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2023-11-22 22:32:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:32:43,333 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:32:43,596 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1482 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (or (let ((.cse0 (select (let ((.cse1 (select v_ArrVal_1474 |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1477) .cse1 v_ArrVal_1480) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1474) .cse1) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) v_ArrVal_1482)) |c_ULTIMATE.start_main_~l~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (+ (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) 1))) (not (= (let ((.cse3 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (store (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|) .cse2 (select v_ArrVal_1474 .cse2))) .cse3 (select v_ArrVal_1474 .cse3))) v_ArrVal_1474)))) is different from false [2023-11-22 22:32:43,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:32:43,858 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 186 treesize of output 164 [2023-11-22 22:32:43,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:32:43,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 915 treesize of output 927 [2023-11-22 22:32:43,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 126 [2023-11-22 22:32:43,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 118 [2023-11-22 22:32:43,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 117 [2023-11-22 22:32:46,319 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~l~0#1.offset| |c_ULTIMATE.start_main_~i~0#1.offset|) (forall ((v_ArrVal_1471 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1471) (select v_ArrVal_1471 |c_ULTIMATE.start_main_~i~0#1.offset|)) .cse0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= v_ArrVal_1471 (store (store .cse1 .cse2 (select v_ArrVal_1471 .cse2)) .cse3 (select v_ArrVal_1471 .cse3)))))) (= |c_ULTIMATE.start_main_~i~0#1.base| |c_ULTIMATE.start_main_~l~0#1.base|) (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|))) (forall ((v_ArrVal_1471 (Array Int Int))) (or (forall ((v_ArrVal_1474 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1471)) (.cse5 (select v_ArrVal_1471 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (forall ((v_ArrVal_1466 Int) (v_ArrVal_1468 Int)) (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select (select (store .cse4 .cse5 v_ArrVal_1474) (select v_ArrVal_1474 .cse0)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse6 .cse2 v_ArrVal_1468) .cse3 v_ArrVal_1466)) .cse5) .cse0))))) (not (= v_ArrVal_1474 (let ((.cse8 (+ .cse0 4))) (store (let ((.cse7 (+ .cse0 8))) (store (select .cse4 .cse5) .cse7 (select v_ArrVal_1474 .cse7))) .cse8 (select v_ArrVal_1474 .cse8)))))))) (not (= v_ArrVal_1471 (store (store .cse1 .cse2 (select v_ArrVal_1471 .cse2)) .cse3 (select v_ArrVal_1471 .cse3))))))))) is different from false [2023-11-22 22:32:48,435 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse3 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))) (and (forall ((v_ArrVal_1471 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1471) (select v_ArrVal_1471 |c_ULTIMATE.start_main_~l~0#1.offset|)) .cse0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= v_ArrVal_1471 (store (store .cse1 .cse2 (select v_ArrVal_1471 .cse2)) .cse3 (select v_ArrVal_1471 .cse3)))))) (not (= (select .cse1 |c_ULTIMATE.start_main_~l~0#1.offset|) |c_ULTIMATE.start_main_~l~0#1.base|)) (forall ((v_ArrVal_1471 (Array Int Int))) (or (forall ((v_ArrVal_1474 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1471)) (.cse5 (select v_ArrVal_1471 |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (forall ((v_ArrVal_1466 Int) (v_ArrVal_1468 Int)) (not (= (select (select (store .cse4 .cse5 v_ArrVal_1474) (select v_ArrVal_1474 .cse0)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse6 .cse2 v_ArrVal_1468) .cse3 v_ArrVal_1466)) .cse5) .cse0)) |c_ULTIMATE.start_main_~l~0#1.base|))) (not (= v_ArrVal_1474 (let ((.cse8 (+ .cse0 4))) (store (let ((.cse7 (+ 8 .cse0))) (store (select .cse4 .cse5) .cse7 (select v_ArrVal_1474 .cse7))) .cse8 (select v_ArrVal_1474 .cse8)))))))) (not (= v_ArrVal_1471 (store (store .cse1 .cse2 (select v_ArrVal_1471 .cse2)) .cse3 (select v_ArrVal_1471 .cse3))))))))) is different from false [2023-11-22 22:32:48,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:32:48,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 129 [2023-11-22 22:32:48,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:32:48,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 110 treesize of output 148 [2023-11-22 22:32:48,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-22 22:32:48,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-22 22:32:48,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 4 [2023-11-22 22:32:48,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 4 [2023-11-22 22:32:48,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-22 22:32:48,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-22 22:32:48,640 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 6 treesize of output 4 [2023-11-22 22:32:48,653 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 6 treesize of output 4 [2023-11-22 22:32:48,657 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 6 treesize of output 4 [2023-11-22 22:32:48,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:32:48,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 130 [2023-11-22 22:32:48,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:32:48,931 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 124 [2023-11-22 22:32:48,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:32:48,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 158 [2023-11-22 22:32:48,946 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 141 treesize of output 139 [2023-11-22 22:32:49,015 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 5 treesize of output 3 [2023-11-22 22:32:49,090 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_35 (Array Int Int)) (v_arrayElimArr_34 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_prenex_94 Int)) (let ((.cse0 (select v_arrayElimArr_34 0))) (or (not (= (select |c_#valid| .cse0) 0)) (not (= (select v_arrayElimArr_35 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_arrayElimArr_35) v_prenex_94 v_arrayElimArr_34) .cse0) 8 (select v_ArrVal_1474 8)) 4 (select v_ArrVal_1474 4)) v_ArrVal_1474)) (not (= (select (store |c_#valid| .cse0 1) v_prenex_94) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#2.base| v_prenex_94 v_arrayElimArr_34) .cse0 v_ArrVal_1474) (select v_ArrVal_1474 0)) |c_ULTIMATE.start_main_~l~0#1.offset|) v_prenex_94)) (= v_prenex_94 0)))) (forall ((v_arrayElimArr_33 (Array Int Int)) (v_arrayElimArr_35 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_39| Int)) (let ((.cse1 (select v_arrayElimArr_33 0))) (or (not (= |v_ULTIMATE.start_main_~l~0#1.base_39| (select (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_arrayElimArr_35) |v_ULTIMATE.start_main_~l~0#1.base_39| v_arrayElimArr_33) .cse1) 0))) (not (= (select (store |c_#valid| .cse1 1) |v_ULTIMATE.start_main_~l~0#1.base_39|) 0)) (not (= (select |c_#valid| .cse1) 0)) (not (= (select v_arrayElimArr_35 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= |v_ULTIMATE.start_main_~l~0#1.base_39| 0))))) is different from false [2023-11-22 22:32:49,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:32:49,211 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 55 [2023-11-22 22:32:49,213 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 22:32:49,226 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-22 22:32:49,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 95 [2023-11-22 22:32:49,232 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 70 treesize of output 58 [2023-11-22 22:32:49,242 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-22 22:32:49,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2023-11-22 22:32:49,245 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 5 treesize of output 3 [2023-11-22 22:32:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 39 not checked. [2023-11-22 22:32:49,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220374552] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:32:49,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 22:32:49,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 31 [2023-11-22 22:32:49,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43502930] [2023-11-22 22:32:49,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 22:32:49,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-22 22:32:49,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:32:49,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-22 22:32:49,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=661, Unknown=29, NotChecked=220, Total=992 [2023-11-22 22:32:49,255 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. Second operand has 32 states, 32 states have (on average 3.4375) internal successors, (110), 31 states have internal predecessors, (110), 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) [2023-11-22 22:32:51,946 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse0 (select .cse3 0)) (.cse9 (select .cse3 |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse2 (select .cse12 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.offset| .cse9) .cse2)) (.cse8 (= |c_ULTIMATE.start_main_~l~0#1.base| 0)) (.cse4 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse5 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse9) .cse2))) (and (not (= .cse0 .cse1)) (forall ((v_ArrVal_1471 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1471) (select v_ArrVal_1471 |c_ULTIMATE.start_main_~l~0#1.offset|)) .cse2) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= v_ArrVal_1471 (store (store .cse3 .cse4 (select v_ArrVal_1471 .cse4)) .cse5 (select v_ArrVal_1471 .cse5)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) .cse7) 0) (not .cse8) (not (= .cse9 |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= .cse1 |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.base| .cse6) .cse7) 0) (forall ((v_ArrVal_1471 (Array Int Int))) (or (forall ((v_ArrVal_1474 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1471)) (.cse11 (select v_ArrVal_1471 |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (forall ((v_ArrVal_1466 Int) (v_ArrVal_1468 Int)) (not (= (select (select (store .cse10 .cse11 v_ArrVal_1474) (select v_ArrVal_1474 .cse2)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse12 .cse4 v_ArrVal_1468) .cse5 v_ArrVal_1466)) .cse11) .cse2)) |c_ULTIMATE.start_main_~l~0#1.base|))) (not (= v_ArrVal_1474 (let ((.cse14 (+ .cse2 4))) (store (let ((.cse13 (+ 8 .cse2))) (store (select .cse10 .cse11) .cse13 (select v_ArrVal_1474 .cse13))) .cse14 (select v_ArrVal_1474 .cse14)))))))) (not (= v_ArrVal_1471 (store (store .cse3 .cse4 (select v_ArrVal_1471 .cse4)) .cse5 (select v_ArrVal_1471 .cse5)))))) (or .cse8 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~l~0#1.base|) 0))) (= (select .cse12 0) 0) (forall ((|v_ULTIMATE.start_main_~l~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_34 (Array Int Int))) (let ((.cse16 (select v_arrayElimArr_34 0))) (or (forall ((v_arrayElimArr_32 (Array Int Int))) (or (forall ((v_ArrVal_1474 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~l~0#1.base_39| v_arrayElimArr_34))) (or (not (= |v_ULTIMATE.start_main_~l~0#1.base_39| (select (select (store .cse15 .cse16 v_ArrVal_1474) (select v_ArrVal_1474 |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~l~0#1.base_39| v_arrayElimArr_32) .cse16) |c_ULTIMATE.start_main_~l~0#1.offset|)))) (not (= v_ArrVal_1474 (store (store (select .cse15 .cse16) .cse4 (select v_ArrVal_1474 .cse4)) .cse5 (select v_ArrVal_1474 .cse5))))))) (not (= |c_ULTIMATE.start_main_~l~0#1.offset| (select v_arrayElimArr_32 0))))) (not (= |c_ULTIMATE.start_main_~l~0#1.base| .cse16))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_39|) 0)) (= |v_ULTIMATE.start_main_~l~0#1.base_39| 0))) (= |c_ULTIMATE.start_main_~l~0#1.offset| 0) (let ((.cse17 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~l~0#1.base|))) (<= (select .cse17 8) (select .cse17 4))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (forall ((|v_ULTIMATE.start_main_~l~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_39|) 0)) (forall ((v_arrayElimArr_33 (Array Int Int))) (let ((.cse18 (select v_arrayElimArr_33 0))) (or (not (= .cse18 |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~l~0#1.base_39| v_arrayElimArr_33) .cse18) |c_ULTIMATE.start_main_~l~0#1.offset|) |v_ULTIMATE.start_main_~l~0#1.base_39|))))) (= |v_ULTIMATE.start_main_~l~0#1.base_39| 0))) (not (= .cse9 .cse6)) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 0) 0) (not (= |c_ULTIMATE.start_main_~l~0#1.base| .cse6)))))) is different from false [2023-11-22 22:32:54,291 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse0 (select .cse3 0)) (.cse9 (select .cse3 |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse2 (select .cse12 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.offset| .cse9) .cse2)) (.cse8 (= |c_ULTIMATE.start_main_~l~0#1.base| 0)) (.cse4 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse5 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse9) .cse2))) (and (not (= .cse0 .cse1)) (forall ((v_ArrVal_1471 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1471) (select v_ArrVal_1471 |c_ULTIMATE.start_main_~l~0#1.offset|)) .cse2) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= v_ArrVal_1471 (store (store .cse3 .cse4 (select v_ArrVal_1471 .cse4)) .cse5 (select v_ArrVal_1471 .cse5)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) .cse7) 0) (not .cse8) (not (= .cse9 |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= .cse1 |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.base| .cse6) .cse7) 0) (forall ((v_ArrVal_1471 (Array Int Int))) (or (forall ((v_ArrVal_1474 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1471)) (.cse11 (select v_ArrVal_1471 |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (forall ((v_ArrVal_1466 Int) (v_ArrVal_1468 Int)) (not (= (select (select (store .cse10 .cse11 v_ArrVal_1474) (select v_ArrVal_1474 .cse2)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse12 .cse4 v_ArrVal_1468) .cse5 v_ArrVal_1466)) .cse11) .cse2)) |c_ULTIMATE.start_main_~l~0#1.base|))) (not (= v_ArrVal_1474 (let ((.cse14 (+ .cse2 4))) (store (let ((.cse13 (+ 8 .cse2))) (store (select .cse10 .cse11) .cse13 (select v_ArrVal_1474 .cse13))) .cse14 (select v_ArrVal_1474 .cse14)))))))) (not (= v_ArrVal_1471 (store (store .cse3 .cse4 (select v_ArrVal_1471 .cse4)) .cse5 (select v_ArrVal_1471 .cse5)))))) (or .cse8 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~l~0#1.base|) 0))) (= (select .cse12 0) 0) (forall ((|v_ULTIMATE.start_main_~l~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_34 (Array Int Int))) (let ((.cse16 (select v_arrayElimArr_34 0))) (or (forall ((v_arrayElimArr_32 (Array Int Int))) (or (forall ((v_ArrVal_1474 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~l~0#1.base_39| v_arrayElimArr_34))) (or (not (= |v_ULTIMATE.start_main_~l~0#1.base_39| (select (select (store .cse15 .cse16 v_ArrVal_1474) (select v_ArrVal_1474 |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~l~0#1.base_39| v_arrayElimArr_32) .cse16) |c_ULTIMATE.start_main_~l~0#1.offset|)))) (not (= v_ArrVal_1474 (store (store (select .cse15 .cse16) .cse4 (select v_ArrVal_1474 .cse4)) .cse5 (select v_ArrVal_1474 .cse5))))))) (not (= |c_ULTIMATE.start_main_~l~0#1.offset| (select v_arrayElimArr_32 0))))) (not (= |c_ULTIMATE.start_main_~l~0#1.base| .cse16))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_39|) 0)) (= |v_ULTIMATE.start_main_~l~0#1.base_39| 0))) (= |c_ULTIMATE.start_main_~l~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (forall ((|v_ULTIMATE.start_main_~l~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_39|) 0)) (forall ((v_arrayElimArr_33 (Array Int Int))) (let ((.cse17 (select v_arrayElimArr_33 0))) (or (not (= .cse17 |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~l~0#1.base_39| v_arrayElimArr_33) .cse17) |c_ULTIMATE.start_main_~l~0#1.offset|) |v_ULTIMATE.start_main_~l~0#1.base_39|))))) (= |v_ULTIMATE.start_main_~l~0#1.base_39| 0))) (not (= .cse9 .cse6)) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 0) 0) (not (= |c_ULTIMATE.start_main_~l~0#1.base| .cse6)))))) is different from false [2023-11-22 22:32:56,676 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse0 (select .cse3 0)) (.cse8 (select .cse3 |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse2 (select .cse11 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.offset| .cse8) .cse2)) (.cse4 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse5 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse8) .cse2))) (and (not (= .cse0 .cse1)) (forall ((v_ArrVal_1471 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1471) (select v_ArrVal_1471 |c_ULTIMATE.start_main_~l~0#1.offset|)) .cse2) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= v_ArrVal_1471 (store (store .cse3 .cse4 (select v_ArrVal_1471 .cse4)) .cse5 (select v_ArrVal_1471 .cse5)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) .cse7) 0) (not (= |c_ULTIMATE.start_main_~l~0#1.base| 0)) (not (= .cse8 |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= .cse1 |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.base| .cse6) .cse7) 0) (forall ((v_ArrVal_1471 (Array Int Int))) (or (forall ((v_ArrVal_1474 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1471)) (.cse10 (select v_ArrVal_1471 |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (forall ((v_ArrVal_1466 Int) (v_ArrVal_1468 Int)) (not (= (select (select (store .cse9 .cse10 v_ArrVal_1474) (select v_ArrVal_1474 .cse2)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse11 .cse4 v_ArrVal_1468) .cse5 v_ArrVal_1466)) .cse10) .cse2)) |c_ULTIMATE.start_main_~l~0#1.base|))) (not (= v_ArrVal_1474 (let ((.cse13 (+ .cse2 4))) (store (let ((.cse12 (+ 8 .cse2))) (store (select .cse9 .cse10) .cse12 (select v_ArrVal_1474 .cse12))) .cse13 (select v_ArrVal_1474 .cse13)))))))) (not (= v_ArrVal_1471 (store (store .cse3 .cse4 (select v_ArrVal_1471 .cse4)) .cse5 (select v_ArrVal_1471 .cse5)))))) (= (select .cse11 0) 0) (= |c_ULTIMATE.start_main_~l~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (not (= .cse8 .cse6)) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 0) 0) (not (= |c_ULTIMATE.start_main_~l~0#1.base| .cse6)))))) is different from false [2023-11-22 22:32:59,076 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base|) 0)) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse14 (select .cse11 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.offset| .cse4) .cse14)) (.cse5 (select .cse11 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse4) .cse14)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~i~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse3) 0) (not (= |c_ULTIMATE.start_main_~i~0#1.base| .cse2)) (not (= |c_ULTIMATE.start_main_~l~0#1.base| 0)) (not (= .cse1 |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_main_~i~0#1.base| .cse4)) (= |c_ULTIMATE.start_main_~l~0#1.offset| 0) (= |c_ULTIMATE.start_main_~l~0#1.offset| |c_ULTIMATE.start_main_~i~0#1.offset|) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse3) 0) (forall ((v_ArrVal_1471 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1471) (select v_ArrVal_1471 |c_ULTIMATE.start_main_~i~0#1.offset|)) .cse5) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= v_ArrVal_1471 (store (store .cse6 .cse7 (select v_ArrVal_1471 .cse7)) .cse8 (select v_ArrVal_1471 .cse8)))))) (= |c_ULTIMATE.start_main_~i~0#1.base| |c_ULTIMATE.start_main_~l~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select .cse6 |c_ULTIMATE.start_main_~i~0#1.offset|))) (forall ((v_ArrVal_1471 (Array Int Int))) (or (forall ((v_ArrVal_1474 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1471)) (.cse10 (select v_ArrVal_1471 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (forall ((v_ArrVal_1466 Int) (v_ArrVal_1468 Int)) (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select (select (store .cse9 .cse10 v_ArrVal_1474) (select v_ArrVal_1474 .cse5)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse11 .cse7 v_ArrVal_1468) .cse8 v_ArrVal_1466)) .cse10) .cse5))))) (not (= v_ArrVal_1474 (let ((.cse13 (+ .cse5 4))) (store (let ((.cse12 (+ .cse5 8))) (store (select .cse9 .cse10) .cse12 (select v_ArrVal_1474 .cse12))) .cse13 (select v_ArrVal_1474 .cse13)))))))) (not (= v_ArrVal_1471 (store (store .cse6 .cse7 (select v_ArrVal_1471 .cse7)) .cse8 (select v_ArrVal_1471 .cse8)))))) (not (= .cse2 .cse4)) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 0) 0))))) is different from false [2023-11-22 22:33:01,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-22 22:33:04,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-22 22:33:07,120 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse3 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))) (and (forall ((v_ArrVal_1471 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1471) (select v_ArrVal_1471 |c_ULTIMATE.start_main_~l~0#1.offset|)) .cse0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= v_ArrVal_1471 (store (store .cse1 .cse2 (select v_ArrVal_1471 .cse2)) .cse3 (select v_ArrVal_1471 .cse3)))))) (not (= |c_ULTIMATE.start_main_~l~0#1.base| 0)) (not (= (select .cse1 |c_ULTIMATE.start_main_~l~0#1.offset|) |c_ULTIMATE.start_main_~l~0#1.base|)) (forall ((v_ArrVal_1471 (Array Int Int))) (or (forall ((v_ArrVal_1474 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1471)) (.cse5 (select v_ArrVal_1471 |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (forall ((v_ArrVal_1466 Int) (v_ArrVal_1468 Int)) (not (= (select (select (store .cse4 .cse5 v_ArrVal_1474) (select v_ArrVal_1474 .cse0)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse6 .cse2 v_ArrVal_1468) .cse3 v_ArrVal_1466)) .cse5) .cse0)) |c_ULTIMATE.start_main_~l~0#1.base|))) (not (= v_ArrVal_1474 (let ((.cse8 (+ .cse0 4))) (store (let ((.cse7 (+ 8 .cse0))) (store (select .cse4 .cse5) .cse7 (select v_ArrVal_1474 .cse7))) .cse8 (select v_ArrVal_1474 .cse8)))))))) (not (= v_ArrVal_1471 (store (store .cse1 .cse2 (select v_ArrVal_1471 .cse2)) .cse3 (select v_ArrVal_1471 .cse3)))))) (= |c_ULTIMATE.start_main_~l~0#1.offset| 0) (let ((.cse9 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~l~0#1.base|))) (<= (select .cse9 8) (select .cse9 4)))))) is different from false [2023-11-22 22:33:17,503 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse2 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))) (and (forall ((v_ArrVal_1482 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1480) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1482) |c_ULTIMATE.start_main_~l~0#1.base|))) (< (select .cse0 .cse1) (+ (select .cse0 .cse2) 1)))) (forall ((v_ArrVal_1482 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~l~0#1.base|))) (< (select .cse3 .cse1) (+ (select .cse3 .cse2) 1)))))) is different from false [2023-11-22 22:33:22,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:33:22,167 INFO L93 Difference]: Finished difference Result 180 states and 236 transitions. [2023-11-22 22:33:22,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-22 22:33:22,168 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.4375) internal successors, (110), 31 states have internal predecessors, (110), 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 [2023-11-22 22:33:22,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:33:22,169 INFO L225 Difference]: With dead ends: 180 [2023-11-22 22:33:22,169 INFO L226 Difference]: Without dead ends: 156 [2023-11-22 22:33:22,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 27.2s TimeCoverageRelationStatistics Valid=272, Invalid=2072, Unknown=48, NotChecked=1030, Total=3422 [2023-11-22 22:33:22,171 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 241 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 35 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 2067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 1292 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2023-11-22 22:33:22,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 692 Invalid, 2067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 731 Invalid, 9 Unknown, 1292 Unchecked, 10.8s Time] [2023-11-22 22:33:22,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-22 22:33:22,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 118. [2023-11-22 22:33:22,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.3418803418803418) internal successors, (157), 117 states have internal predecessors, (157), 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) [2023-11-22 22:33:22,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 157 transitions. [2023-11-22 22:33:22,182 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 157 transitions. Word has length 39 [2023-11-22 22:33:22,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:33:22,182 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 157 transitions. [2023-11-22 22:33:22,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.4375) internal successors, (110), 31 states have internal predecessors, (110), 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) [2023-11-22 22:33:22,182 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 157 transitions. [2023-11-22 22:33:22,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-22 22:33:22,183 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:33:22,183 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:33:22,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-22 22:33:22,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-22 22:33:22,399 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:33:22,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:33:22,399 INFO L85 PathProgramCache]: Analyzing trace with hash 110203856, now seen corresponding path program 5 times [2023-11-22 22:33:22,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:33:22,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183548415] [2023-11-22 22:33:22,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:33:22,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:33:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:33:25,333 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:33:25,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:33:25,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183548415] [2023-11-22 22:33:25,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183548415] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 22:33:25,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782624403] [2023-11-22 22:33:25,333 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-22 22:33:25,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:33:25,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:33:25,334 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 22:33:25,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-22 22:33:32,911 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-22 22:33:32,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 22:33:32,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 93 conjunts are in the unsatisfiable core [2023-11-22 22:33:32,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:33:32,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-22 22:33:33,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 22:33:33,433 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-11-22 22:33:33,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 29 [2023-11-22 22:33:33,497 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 [2023-11-22 22:33:34,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-22 22:33:34,130 INFO L349 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2023-11-22 22:33:34,130 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 21 treesize of output 31 [2023-11-22 22:33:34,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-22 22:33:34,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 22:33:34,236 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 50 treesize of output 33 [2023-11-22 22:33:34,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 22:33:34,314 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-11-22 22:33:34,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2023-11-22 22:33:35,627 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 22:33:35,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 37 [2023-11-22 22:33:35,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 22:33:35,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-22 22:33:35,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 22:33:35,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-22 22:33:36,575 INFO L349 Elim1Store]: treesize reduction 26, result has 16.1 percent of original size [2023-11-22 22:33:36,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 97 [2023-11-22 22:33:36,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 28 [2023-11-22 22:33:36,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 22:33:36,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2023-11-22 22:33:36,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 15 [2023-11-22 22:33:37,953 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-22 22:33:37,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 238 treesize of output 149 [2023-11-22 22:33:37,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 22:33:38,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2023-11-22 22:33:38,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 31 [2023-11-22 22:33:40,944 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-22 22:33:40,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 58 [2023-11-22 22:33:40,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-22 22:33:41,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2023-11-22 22:33:41,273 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:33:41,273 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:33:44,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:33:44,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 7841 treesize of output 6887 Killed by 15