./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 18:25:35,231 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 18:25:35,282 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 18:25:35,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 18:25:35,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 18:25:35,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 18:25:35,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 18:25:35,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 18:25:35,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 18:25:35,345 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 18:25:35,345 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 18:25:35,345 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 18:25:35,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 18:25:35,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 18:25:35,348 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 18:25:35,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 18:25:35,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 18:25:35,349 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 18:25:35,349 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 18:25:35,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 18:25:35,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 18:25:35,350 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 18:25:35,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 18:25:35,351 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 18:25:35,351 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 18:25:35,351 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 18:25:35,352 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 18:25:35,352 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 18:25:35,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 18:25:35,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 18:25:35,354 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 18:25:35,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 18:25:35,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 18:25:35,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 18:25:35,355 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 18:25:35,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 18:25:35,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 18:25:35,355 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 18:25:35,356 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 18:25:35,356 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 18:25:35,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 18:25:35,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 18:25:35,357 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 18:25:35,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 18:25:35,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 18:25:35,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 18:25:35,642 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 18:25:35,642 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 18:25:35,643 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 18:25:36,838 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 18:25:37,048 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 18:25:37,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/cart.i [2023-11-22 18:25:37,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c6a00942/a5084014d7bd4ca19a52b26dfe294f73/FLAG3588b8e24 [2023-11-22 18:25:37,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c6a00942/a5084014d7bd4ca19a52b26dfe294f73 [2023-11-22 18:25:37,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 18:25:37,081 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 18:25:37,082 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 18:25:37,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 18:25:37,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 18:25:37,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:25:37" (1/1) ... [2023-11-22 18:25:37,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76bb0852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:25:37, skipping insertion in model container [2023-11-22 18:25:37,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:25:37" (1/1) ... [2023-11-22 18:25:37,134 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 18:25:37,386 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 18:25:37,391 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 18:25:37,400 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 18:25:37,452 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 18:25:37,457 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 18:25:37,482 INFO L206 MainTranslator]: Completed translation [2023-11-22 18:25:37,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:25:37 WrapperNode [2023-11-22 18:25:37,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 18:25:37,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 18:25:37,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 18:25:37,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 18:25:37,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:25:37" (1/1) ... [2023-11-22 18:25:37,501 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:25:37" (1/1) ... [2023-11-22 18:25:37,519 INFO L138 Inliner]: procedures = 121, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2023-11-22 18:25:37,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 18:25:37,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 18:25:37,520 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 18:25:37,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 18:25:37,531 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:25:37" (1/1) ... [2023-11-22 18:25:37,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:25:37" (1/1) ... [2023-11-22 18:25:37,534 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:25:37" (1/1) ... [2023-11-22 18:25:37,549 INFO L189 HeapSplitter]: Split 20 memory accesses to 3 slices as follows [2, 7, 11] [2023-11-22 18:25:37,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:25:37" (1/1) ... [2023-11-22 18:25:37,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:25:37" (1/1) ... [2023-11-22 18:25:37,556 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:25:37" (1/1) ... [2023-11-22 18:25:37,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:25:37" (1/1) ... [2023-11-22 18:25:37,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:25:37" (1/1) ... [2023-11-22 18:25:37,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:25:37" (1/1) ... [2023-11-22 18:25:37,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 18:25:37,575 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 18:25:37,575 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 18:25:37,576 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 18:25:37,576 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:25:37" (1/1) ... [2023-11-22 18:25:37,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 18:25:37,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:25:37,609 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 18:25:37,616 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 18:25:37,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-22 18:25:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-22 18:25:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-22 18:25:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-22 18:25:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-22 18:25:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-22 18:25:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 18:25:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 18:25:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-22 18:25:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-22 18:25:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-22 18:25:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-22 18:25:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-22 18:25:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-22 18:25:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-22 18:25:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-22 18:25:37,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-22 18:25:37,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 18:25:37,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 18:25:37,769 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 18:25:37,772 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 18:25:37,959 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 18:25:37,987 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 18:25:37,988 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-22 18:25:37,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:25:37 BoogieIcfgContainer [2023-11-22 18:25:37,988 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 18:25:37,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 18:25:37,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 18:25:37,996 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 18:25:37,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:25:37" (1/3) ... [2023-11-22 18:25:37,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347c9eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:25:37, skipping insertion in model container [2023-11-22 18:25:37,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:25:37" (2/3) ... [2023-11-22 18:25:37,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347c9eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:25:37, skipping insertion in model container [2023-11-22 18:25:37,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:25:37" (3/3) ... [2023-11-22 18:25:37,999 INFO L112 eAbstractionObserver]: Analyzing ICFG cart.i [2023-11-22 18:25:38,013 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 18:25:38,013 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 18:25:38,050 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 18:25:38,055 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;@61542cae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 18:25:38,056 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 18:25:38,061 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 18:25:38,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-22 18:25:38,066 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:25:38,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:25:38,067 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:25:38,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:25:38,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1487606993, now seen corresponding path program 1 times [2023-11-22 18:25:38,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:25:38,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540773805] [2023-11-22 18:25:38,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:25:38,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:25:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:25:38,236 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 18:25:38,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:25:38,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540773805] [2023-11-22 18:25:38,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540773805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:25:38,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:25:38,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 18:25:38,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198590399] [2023-11-22 18:25:38,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:25:38,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 18:25:38,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:25:38,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 18:25:38,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 18:25:38,265 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 18:25:38,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:25:38,280 INFO L93 Difference]: Finished difference Result 31 states and 46 transitions. [2023-11-22 18:25:38,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 18:25:38,285 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 18:25:38,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:25:38,291 INFO L225 Difference]: With dead ends: 31 [2023-11-22 18:25:38,294 INFO L226 Difference]: Without dead ends: 16 [2023-11-22 18:25:38,297 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 18:25:38,301 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 18:25:38,302 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 18:25:38,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-11-22 18:25:38,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-11-22 18:25:38,327 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 18:25:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2023-11-22 18:25:38,329 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 8 [2023-11-22 18:25:38,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:25:38,330 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2023-11-22 18:25:38,330 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 18:25:38,330 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2023-11-22 18:25:38,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-22 18:25:38,331 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:25:38,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:25:38,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 18:25:38,333 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:25:38,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:25:38,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2098913187, now seen corresponding path program 1 times [2023-11-22 18:25:38,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:25:38,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239378921] [2023-11-22 18:25:38,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:25:38,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:25:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:25:38,488 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 18:25:38,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:25:38,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239378921] [2023-11-22 18:25:38,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239378921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:25:38,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:25:38,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 18:25:38,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005052504] [2023-11-22 18:25:38,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:25:38,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 18:25:38,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:25:38,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 18:25:38,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 18:25:38,497 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 18:25:38,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:25:38,588 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2023-11-22 18:25:38,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 18:25:38,589 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 18:25:38,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:25:38,590 INFO L225 Difference]: With dead ends: 35 [2023-11-22 18:25:38,590 INFO L226 Difference]: Without dead ends: 20 [2023-11-22 18:25:38,592 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 18:25:38,612 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 18:25:38,612 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 18:25:38,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-22 18:25:38,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-22 18:25:38,621 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 18:25:38,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2023-11-22 18:25:38,621 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 11 [2023-11-22 18:25:38,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:25:38,622 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2023-11-22 18:25:38,622 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 18:25:38,622 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2023-11-22 18:25:38,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-22 18:25:38,623 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:25:38,623 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:25:38,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 18:25:38,624 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:25:38,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:25:38,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2087693085, now seen corresponding path program 1 times [2023-11-22 18:25:38,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:25:38,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946364103] [2023-11-22 18:25:38,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:25:38,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:25:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:25:38,760 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 18:25:38,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:25:38,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946364103] [2023-11-22 18:25:38,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946364103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:25:38,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:25:38,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 18:25:38,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823834616] [2023-11-22 18:25:38,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:25:38,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 18:25:38,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:25:38,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 18:25:38,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 18:25:38,763 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 18:25:38,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:25:38,823 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2023-11-22 18:25:38,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 18:25:38,824 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 18:25:38,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:25:38,831 INFO L225 Difference]: With dead ends: 35 [2023-11-22 18:25:38,831 INFO L226 Difference]: Without dead ends: 29 [2023-11-22 18:25:38,831 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 18:25:38,832 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 18:25:38,832 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 18:25:38,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-22 18:25:38,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2023-11-22 18:25:38,836 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 18:25:38,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2023-11-22 18:25:38,836 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 15 [2023-11-22 18:25:38,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:25:38,837 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2023-11-22 18:25:38,837 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 18:25:38,837 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2023-11-22 18:25:38,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 18:25:38,838 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:25:38,838 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:25:38,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 18:25:38,838 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:25:38,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:25:38,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1239572016, now seen corresponding path program 1 times [2023-11-22 18:25:38,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:25:38,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154518275] [2023-11-22 18:25:38,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:25:38,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:25:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:25:38,933 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 18:25:38,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:25:38,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154518275] [2023-11-22 18:25:38,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154518275] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:25:38,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:25:38,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 18:25:38,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467410356] [2023-11-22 18:25:38,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:25:38,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 18:25:38,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:25:38,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 18:25:38,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 18:25:38,938 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 18:25:38,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:25:38,960 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2023-11-22 18:25:38,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 18:25:38,961 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 18:25:38,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:25:38,962 INFO L225 Difference]: With dead ends: 36 [2023-11-22 18:25:38,962 INFO L226 Difference]: Without dead ends: 26 [2023-11-22 18:25:38,963 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 18:25:38,966 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 18:25:38,968 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 18:25:38,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-22 18:25:38,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-22 18:25:38,976 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 18:25:38,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2023-11-22 18:25:38,977 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 19 [2023-11-22 18:25:38,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:25:38,977 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2023-11-22 18:25:38,977 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 18:25:38,977 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2023-11-22 18:25:38,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 18:25:38,978 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:25:38,978 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:25:38,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 18:25:38,978 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:25:38,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:25:38,979 INFO L85 PathProgramCache]: Analyzing trace with hash 430225390, now seen corresponding path program 1 times [2023-11-22 18:25:38,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:25:38,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900126765] [2023-11-22 18:25:38,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:25:38,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:25:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:25:39,564 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 18:25:39,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:25:39,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900126765] [2023-11-22 18:25:39,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900126765] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:25:39,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521243800] [2023-11-22 18:25:39,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:25:39,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:25:39,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:25:39,572 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 18:25:39,598 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 18:25:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:25:39,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-22 18:25:39,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:25:39,862 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 18:25:39,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:25:39,900 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 18:25:39,907 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 18:25:39,907 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:25:40,084 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-22 18:25:40,085 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 18:25:40,270 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 18:25:40,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521243800] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:25:40,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:25:40,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 12 [2023-11-22 18:25:40,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345228990] [2023-11-22 18:25:40,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:25:40,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-22 18:25:40,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:25:40,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-22 18:25:40,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-22 18:25:40,273 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 18:25:40,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:25:40,486 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2023-11-22 18:25:40,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 18:25:40,486 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 18:25:40,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:25:40,487 INFO L225 Difference]: With dead ends: 47 [2023-11-22 18:25:40,488 INFO L226 Difference]: Without dead ends: 45 [2023-11-22 18:25:40,488 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 18:25:40,489 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 18:25:40,489 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 18:25:40,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-22 18:25:40,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2023-11-22 18:25:40,499 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 18:25:40,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2023-11-22 18:25:40,500 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 19 [2023-11-22 18:25:40,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:25:40,503 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2023-11-22 18:25:40,503 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 18:25:40,504 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2023-11-22 18:25:40,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-22 18:25:40,505 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:25:40,505 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 18:25:40,523 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 18:25:40,719 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 18:25:40,720 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:25:40,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:25:40,721 INFO L85 PathProgramCache]: Analyzing trace with hash 666078984, now seen corresponding path program 1 times [2023-11-22 18:25:40,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:25:40,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861620166] [2023-11-22 18:25:40,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:25:40,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:25:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:25:40,903 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 18:25:40,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:25:40,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861620166] [2023-11-22 18:25:40,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861620166] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:25:40,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029322559] [2023-11-22 18:25:40,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:25:40,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:25:40,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:25:40,905 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 18:25:40,934 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 18:25:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:25:41,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-22 18:25:41,013 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:25:41,074 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 18:25:41,080 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 18:25:41,162 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 18:25:41,163 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:25:41,235 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 18:25:41,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:25:41,244 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 18:25:41,251 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 18:25:41,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:25:41,259 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 18:25:41,290 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 18:25:41,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029322559] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:25:41,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:25:41,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 13 [2023-11-22 18:25:41,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911315590] [2023-11-22 18:25:41,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:25:41,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-22 18:25:41,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:25:41,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-22 18:25:41,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-11-22 18:25:41,293 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 18:25:41,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:25:41,476 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2023-11-22 18:25:41,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 18:25:41,476 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 18:25:41,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:25:41,477 INFO L225 Difference]: With dead ends: 58 [2023-11-22 18:25:41,477 INFO L226 Difference]: Without dead ends: 48 [2023-11-22 18:25:41,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2023-11-22 18:25:41,478 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 18:25:41,479 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 18:25:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-22 18:25:41,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2023-11-22 18:25:41,483 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 18:25:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2023-11-22 18:25:41,486 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 22 [2023-11-22 18:25:41,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:25:41,486 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2023-11-22 18:25:41,487 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 18:25:41,487 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2023-11-22 18:25:41,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-22 18:25:41,487 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:25:41,488 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:25:41,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-22 18:25:41,703 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 18:25:41,703 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:25:41,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:25:41,703 INFO L85 PathProgramCache]: Analyzing trace with hash -110453383, now seen corresponding path program 2 times [2023-11-22 18:25:41,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:25:41,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042752971] [2023-11-22 18:25:41,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:25:41,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:25:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:25:42,025 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 18:25:42,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:25:42,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042752971] [2023-11-22 18:25:42,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042752971] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:25:42,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834596940] [2023-11-22 18:25:42,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 18:25:42,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:25:42,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:25:42,028 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 18:25:42,050 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 18:25:42,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 18:25:42,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 18:25:42,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-22 18:25:42,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:25:42,165 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 18:25:42,169 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 18:25:42,240 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 18:25:42,251 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 18:25:42,257 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 18:25:42,257 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:25:42,318 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 18:25:42,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834596940] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:25:42,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:25:42,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-11-22 18:25:42,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549510953] [2023-11-22 18:25:42,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:25:42,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 18:25:42,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:25:42,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 18:25:42,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-22 18:25:42,321 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 18:25:42,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:25:42,413 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2023-11-22 18:25:42,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 18:25:42,413 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 18:25:42,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:25:42,414 INFO L225 Difference]: With dead ends: 66 [2023-11-22 18:25:42,414 INFO L226 Difference]: Without dead ends: 39 [2023-11-22 18:25:42,414 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 18:25:42,415 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:25:42,415 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.1s Time] [2023-11-22 18:25:42,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-22 18:25:42,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-11-22 18:25:42,418 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 18:25:42,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2023-11-22 18:25:42,419 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 23 [2023-11-22 18:25:42,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:25:42,419 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2023-11-22 18:25:42,419 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 18:25:42,419 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2023-11-22 18:25:42,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-22 18:25:42,420 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:25:42,420 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:25:42,440 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 18:25:42,620 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 18:25:42,621 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:25:42,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:25:42,621 INFO L85 PathProgramCache]: Analyzing trace with hash -948094721, now seen corresponding path program 3 times [2023-11-22 18:25:42,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:25:42,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293315952] [2023-11-22 18:25:42,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:25:42,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:25:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:25:43,460 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 18:25:43,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:25:43,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293315952] [2023-11-22 18:25:43,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293315952] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:25:43,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907172389] [2023-11-22 18:25:43,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 18:25:43,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:25:43,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:25:43,464 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 18:25:43,469 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 18:25:43,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-22 18:25:43,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 18:25:43,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-22 18:25:43,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:25:43,621 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 18:25:43,767 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 18:25:43,780 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 18:25:43,786 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 18:25:43,851 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 18:25:43,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:25:43,859 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 18:25:43,873 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-22 18:25:43,873 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 18:25:43,956 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 18:25:43,959 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 18:25:43,959 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:25:44,072 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 18:25:44,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:25:44,082 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 18:25:44,155 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 18:25:44,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:25:44,231 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 18:25:44,264 INFO L349 Elim1Store]: treesize reduction 35, result has 36.4 percent of original size [2023-11-22 18:25:44,265 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 18:25:44,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:25:44,277 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 18:25:44,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:25:44,306 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 18:25:44,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:25:44,342 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 18:25:44,364 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 18:25:44,377 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 18:25:44,467 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 18:25:44,700 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 18:25:44,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:25:44,713 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 18:25:44,787 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 18:25:44,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907172389] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:25:44,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:25:44,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 25 [2023-11-22 18:25:44,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653500838] [2023-11-22 18:25:44,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:25:44,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-22 18:25:44,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:25:44,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-22 18:25:44,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=457, Unknown=1, NotChecked=44, Total=600 [2023-11-22 18:25:44,794 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 18:25:45,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:25:45,187 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2023-11-22 18:25:45,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 18:25:45,187 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 18:25:45,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:25:45,188 INFO L225 Difference]: With dead ends: 64 [2023-11-22 18:25:45,188 INFO L226 Difference]: Without dead ends: 59 [2023-11-22 18:25:45,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=712, Unknown=1, NotChecked=58, Total=992 [2023-11-22 18:25:45,189 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 268 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2023-11-22 18:25:45,189 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.2s Time] [2023-11-22 18:25:45,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-22 18:25:45,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2023-11-22 18:25:45,194 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 18:25:45,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2023-11-22 18:25:45,194 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 27 [2023-11-22 18:25:45,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:25:45,194 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2023-11-22 18:25:45,194 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 18:25:45,195 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2023-11-22 18:25:45,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-22 18:25:45,195 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:25:45,195 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 18:25:45,212 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 18:25:45,412 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 18:25:45,413 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:25:45,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:25:45,413 INFO L85 PathProgramCache]: Analyzing trace with hash -980998057, now seen corresponding path program 2 times [2023-11-22 18:25:45,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:25:45,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780085980] [2023-11-22 18:25:45,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:25:45,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:25:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:25:46,136 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 18:25:46,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:25:46,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780085980] [2023-11-22 18:25:46,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780085980] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:25:46,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120046153] [2023-11-22 18:25:46,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 18:25:46,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:25:46,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:25:46,140 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 18:25:46,167 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 18:25:46,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 18:25:46,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 18:25:46,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-22 18:25:46,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:25:46,278 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 18:25:46,296 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 18:25:46,302 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-22 18:25:46,303 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 18:25:46,306 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 18:25:46,414 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 18:25:46,424 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 18:25:46,524 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 18:25:46,525 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 18:25:46,528 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 18:25:46,535 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 18:25:46,541 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 18:25:46,618 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 18:25:46,623 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 18:25:46,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:25:46,628 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 18:25:46,631 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 18:25:46,631 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:25:46,785 INFO L349 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2023-11-22 18:25:46,785 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 18:25:46,891 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 18:25:48,959 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 18:25:49,296 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-22 18:25:49,296 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 18:25:49,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:25:49,311 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 18:25:49,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:25:49,327 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 18:25:49,332 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 18:25:49,338 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 18:25:49,352 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 18:25:49,378 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 18:25:49,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120046153] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:25:49,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:25:49,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2023-11-22 18:25:49,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410704177] [2023-11-22 18:25:49,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:25:49,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-22 18:25:49,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:25:49,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-22 18:25:49,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=427, Unknown=3, NotChecked=86, Total=600 [2023-11-22 18:25:49,381 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 18:25:50,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:25:50,298 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2023-11-22 18:25:50,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-22 18:25:50,300 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 18:25:50,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:25:50,300 INFO L225 Difference]: With dead ends: 59 [2023-11-22 18:25:50,300 INFO L226 Difference]: Without dead ends: 57 [2023-11-22 18:25:50,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=223, Invalid=904, Unknown=3, NotChecked=130, Total=1260 [2023-11-22 18:25:50,301 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 144 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2023-11-22 18:25:50,302 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.4s Time] [2023-11-22 18:25:50,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-22 18:25:50,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2023-11-22 18:25:50,306 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 18:25:50,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2023-11-22 18:25:50,306 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 30 [2023-11-22 18:25:50,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:25:50,306 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2023-11-22 18:25:50,307 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 18:25:50,307 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2023-11-22 18:25:50,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-22 18:25:50,307 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:25:50,307 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:25:50,321 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 18:25:50,508 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 18:25:50,508 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:25:50,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:25:50,509 INFO L85 PathProgramCache]: Analyzing trace with hash 369765898, now seen corresponding path program 4 times [2023-11-22 18:25:50,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:25:50,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405761230] [2023-11-22 18:25:50,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:25:50,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:25:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:25:51,120 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 18:25:51,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:25:51,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405761230] [2023-11-22 18:25:51,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405761230] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:25:51,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198966381] [2023-11-22 18:25:51,121 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-22 18:25:51,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:25:51,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:25:51,132 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 18:25:51,154 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 18:25:51,416 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-22 18:25:51,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 18:25:51,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-22 18:25:51,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:25:51,439 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 18:25:51,443 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 18:25:51,448 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 18:25:51,502 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 18:25:51,517 INFO L349 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2023-11-22 18:25:51,517 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 18:25:51,520 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 18:25:51,536 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-22 18:25:51,536 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 18:25:51,542 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 18:25:51,685 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 18:25:51,686 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 18:25:51,696 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 18:25:51,774 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 18:25:51,775 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 18:25:51,784 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 18:25:51,785 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 18:25:51,793 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 18:25:51,796 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 18:25:51,801 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 18:25:51,801 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:25:51,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:25:51,977 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 18:25:51,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:25:51,986 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 18:25:51,995 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 18:25:52,010 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 18:25:52,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:25:52,130 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 18:25:52,132 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:25:52,133 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 18:25:52,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:25:52,141 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 18:25:52,143 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:25:52,144 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 18:25:52,156 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 18:25:52,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198966381] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:25:52,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:25:52,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-11-22 18:25:52,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430548616] [2023-11-22 18:25:52,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:25:52,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-22 18:25:52,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:25:52,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-22 18:25:52,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-11-22 18:25:52,158 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 18:25:52,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:25:52,418 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2023-11-22 18:25:52,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 18:25:52,418 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 18:25:52,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:25:52,418 INFO L225 Difference]: With dead ends: 95 [2023-11-22 18:25:52,419 INFO L226 Difference]: Without dead ends: 55 [2023-11-22 18:25:52,419 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 18:25:52,420 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 18:25:52,420 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 18:25:52,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-22 18:25:52,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-22 18:25:52,424 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 18:25:52,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2023-11-22 18:25:52,425 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 31 [2023-11-22 18:25:52,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:25:52,425 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2023-11-22 18:25:52,425 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 18:25:52,425 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2023-11-22 18:25:52,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-22 18:25:52,426 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:25:52,426 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:25:52,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-22 18:25:52,641 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 18:25:52,641 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:25:52,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:25:52,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1121721456, now seen corresponding path program 5 times [2023-11-22 18:25:52,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:25:52,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270448987] [2023-11-22 18:25:52,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:25:52,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:25:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:25:53,728 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 18:25:53,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:25:53,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270448987] [2023-11-22 18:25:53,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270448987] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:25:53,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114276448] [2023-11-22 18:25:53,729 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-22 18:25:53,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:25:53,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:25:53,730 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 18:25:53,746 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 18:25:55,229 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-22 18:25:55,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 18:25:55,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-22 18:25:55,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:25:55,242 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 18:25:55,269 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-11-22 18:25:55,269 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 18:25:55,273 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 18:25:55,314 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 18:25:55,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:25:55,320 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 18:25:55,331 INFO L349 Elim1Store]: treesize reduction 37, result has 24.5 percent of original size [2023-11-22 18:25:55,331 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 18:25:55,335 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 18:25:55,496 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 18:25:55,513 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 18:25:55,513 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 18:25:55,521 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 18:25:55,529 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 18:25:55,597 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 18:25:55,597 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 18:25:55,608 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-22 18:25:55,608 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 18:25:55,613 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 18:25:55,649 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 18:25:55,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:25:55,671 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 18:25:55,674 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 18:25:55,675 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:25:55,731 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| 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)))) is different from false [2023-11-22 18:25:55,865 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 18:25:55,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:25:55,889 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 18:25:55,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:25:55,929 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 18:25:55,951 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 18:25:55,961 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 18:25:56,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:25:56,349 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 18:25:56,358 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 18:25:56,364 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 18:25:56,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:25:56,471 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 18:25:56,474 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:25:56,475 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 18:25:56,478 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 18:25:56,526 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-11-22 18:25:56,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114276448] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:25:56,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:25:56,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2023-11-22 18:25:56,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746301102] [2023-11-22 18:25:56,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:25:56,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-22 18:25:56,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:25:56,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-22 18:25:56,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=502, Unknown=7, NotChecked=94, Total=702 [2023-11-22 18:25:56,528 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 18:25:57,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:25:57,078 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2023-11-22 18:25:57,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 18:25:57,078 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 18:25:57,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:25:57,079 INFO L225 Difference]: With dead ends: 86 [2023-11-22 18:25:57,079 INFO L226 Difference]: Without dead ends: 81 [2023-11-22 18:25:57,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=272, Invalid=919, Unknown=7, NotChecked=134, Total=1332 [2023-11-22 18:25:57,083 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 335 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 18:25:57,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 244 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 144 Invalid, 0 Unknown, 163 Unchecked, 0.3s Time] [2023-11-22 18:25:57,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-22 18:25:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 62. [2023-11-22 18:25:57,105 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 18:25:57,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 81 transitions. [2023-11-22 18:25:57,106 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 81 transitions. Word has length 35 [2023-11-22 18:25:57,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:25:57,107 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 81 transitions. [2023-11-22 18:25:57,108 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 18:25:57,108 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2023-11-22 18:25:57,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-22 18:25:57,110 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:25:57,110 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 18:25:57,130 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 18:25:57,324 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 18:25:57,325 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:25:57,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:25:57,325 INFO L85 PathProgramCache]: Analyzing trace with hash -752007675, now seen corresponding path program 3 times [2023-11-22 18:25:57,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:25:57,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527190303] [2023-11-22 18:25:57,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:25:57,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:25:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:25:57,782 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 18:25:57,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:25:57,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527190303] [2023-11-22 18:25:57,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527190303] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:25:57,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285200616] [2023-11-22 18:25:57,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 18:25:57,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:25:57,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:25:57,784 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 18:25:57,808 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 18:25:57,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-22 18:25:57,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 18:25:57,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-22 18:25:57,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:25:58,014 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 18:25:58,018 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 18:25:58,100 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 18:25:58,110 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 18:25:58,200 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 18:25:58,219 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-11-22 18:25:58,220 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 18:25:58,437 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 18:25:58,437 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:26:28,421 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 18:26:28,471 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-11-22 18:26:28,471 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 18:26:28,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:26:28,504 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 18:26:28,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:26:28,525 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 18:26:28,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:26:28,549 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 18:26:28,555 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:26:28,555 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:26:28,556 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:26:28,556 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:26:28,556 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:26:28,557 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:26:28,573 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 18:26:28,600 INFO L349 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2023-11-22 18:26:28,600 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 18:26:28,606 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 18:26:28,611 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 18:26:28,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:26:28,634 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 18:26:28,653 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 18:26:28,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285200616] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:26:28,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:26:28,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 25 [2023-11-22 18:26:28,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781713240] [2023-11-22 18:26:28,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:26:28,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-22 18:26:28,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:26:28,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-22 18:26:28,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=495, Unknown=13, NotChecked=0, Total=600 [2023-11-22 18:26:28,655 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 18:26:31,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:26:31,927 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2023-11-22 18:26:31,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-22 18:26:31,928 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 18:26:31,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:26:31,929 INFO L225 Difference]: With dead ends: 75 [2023-11-22 18:26:31,929 INFO L226 Difference]: Without dead ends: 62 [2023-11-22 18:26:31,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 29.3s TimeCoverageRelationStatistics Valid=291, Invalid=1256, Unknown=13, NotChecked=0, Total=1560 [2023-11-22 18:26:31,930 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 151 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-22 18:26:31,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 315 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-22 18:26:31,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-22 18:26:31,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2023-11-22 18:26:31,935 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 18:26:31,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2023-11-22 18:26:31,935 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 37 [2023-11-22 18:26:31,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:26:31,936 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2023-11-22 18:26:31,936 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 18:26:31,936 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2023-11-22 18:26:31,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-22 18:26:31,937 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:26:31,937 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 18:26:31,955 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 18:26:32,152 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 18:26:32,152 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:26:32,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:26:32,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1940531238, now seen corresponding path program 4 times [2023-11-22 18:26:32,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:26:32,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917102186] [2023-11-22 18:26:32,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:26:32,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:26:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:26:33,341 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 18:26:33,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:26:33,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917102186] [2023-11-22 18:26:33,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917102186] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:26:33,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815861212] [2023-11-22 18:26:33,342 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-22 18:26:33,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:26:33,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:26:33,344 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 18:26:33,352 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 18:26:33,669 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-22 18:26:33,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 18:26:33,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 84 conjunts are in the unsatisfiable core [2023-11-22 18:26:33,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:26:33,712 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 18:26:33,721 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 18:26:33,723 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 18:26:33,818 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 18:26:33,838 INFO L349 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2023-11-22 18:26:33,838 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 18:26:33,841 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 18:26:33,858 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 18:26:33,869 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-22 18:26:33,869 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 18:26:34,078 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 18:26:34,090 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 18:26:34,278 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 18:26:34,285 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 18:26:34,302 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 18:26:34,314 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 18:26:34,449 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 18:26:34,450 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 18:26:34,471 INFO L349 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2023-11-22 18:26:34,471 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 18:26:34,521 INFO L349 Elim1Store]: treesize reduction 64, result has 40.2 percent of original size [2023-11-22 18:26:34,522 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 18:26:34,821 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-22 18:26:34,821 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 18:26:34,828 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 18:26:34,872 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 18:26:34,876 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 18:26:34,876 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:26:35,135 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 18:26:35,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:26:35,160 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 18:26:35,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:26:35,252 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 18:26:35,262 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 18:27:02,861 WARN L293 SmtUtils]: Spent 11.63s 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 18:27:02,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:27:02,862 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 18:27:27,985 WARN L293 SmtUtils]: Spent 25.06s 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 18:27:27,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:27:27,986 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 18:27:28,332 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 18:27:28,437 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 18:27:28,536 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 18:27:28,548 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 18:27:28,879 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 18:27:28,917 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 18:27:29,012 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 18:27:29,025 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 18:27:29,339 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 18:27:29,414 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 18:27:29,496 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 18:27:29,509 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 18:27:29,621 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 18:27:29,643 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 18:27:29,762 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 18:27:29,925 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 18:27:29,976 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 18:27:30,090 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 18:27:30,097 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 18:27:30,175 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 18:27:30,188 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 18:27:30,269 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 18:27:30,310 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 18:27:30,316 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 18:27:30,709 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 18:27:30,797 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 18:27:30,886 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 18:27:30,924 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 18:27:31,035 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 18:27:31,094 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 18:27:31,139 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 18:27:31,188 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 18:27:31,303 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 18:27:31,348 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 18:27:31,470 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 18:27:31,533 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 18:27:31,561 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 18:27:31,602 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 18:27:31,688 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 18:27:35,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:27:35,135 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 18:27:35,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:27:35,175 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 18:27:46,633 WARN L293 SmtUtils]: Spent 11.44s 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 18:27:46,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:27:46,634 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 18:27:47,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:27:47,192 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 18:27:47,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:27:47,528 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 18:27:47,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:27:47,700 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 18:27:47,818 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 18:27:47,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:27:47,929 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 18:27:48,017 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 18:27:48,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:27:48,130 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 18:27:48,226 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 18:27:48,306 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 18:27:48,373 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 18:27:48,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:27:48,468 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 18:27:48,582 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 18:27:48,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:27:48,684 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 18:27:48,784 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 18:27:48,866 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 18:28:11,677 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 18:28:11,968 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 18:28:11,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815861212] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:28:11,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:28:11,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 34 [2023-11-22 18:28:11,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203850194] [2023-11-22 18:28:11,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:28:11,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-22 18:28:11,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:28:11,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-22 18:28:11,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=925, Unknown=3, NotChecked=62, Total=1122 [2023-11-22 18:28:11,971 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 18:28:14,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-22 18:28:18,231 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 18:28:20,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-22 18:28:29,175 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 18:28:32,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:28:32,917 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2023-11-22 18:28:32,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-22 18:28:32,917 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 18:28:32,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:28:32,918 INFO L225 Difference]: With dead ends: 78 [2023-11-22 18:28:32,918 INFO L226 Difference]: Without dead ends: 76 [2023-11-22 18:28:32,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=371, Invalid=1700, Unknown=3, NotChecked=88, Total=2162 [2023-11-22 18:28:32,919 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 345 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 26 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2023-11-22 18:28:32,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 522 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 382 Invalid, 2 Unknown, 82 Unchecked, 17.3s Time] [2023-11-22 18:28:32,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-22 18:28:32,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 60. [2023-11-22 18:28:32,925 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 18:28:32,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2023-11-22 18:28:32,925 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 38 [2023-11-22 18:28:32,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:28:32,925 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2023-11-22 18:28:32,926 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 18:28:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2023-11-22 18:28:32,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-22 18:28:32,926 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:28:32,927 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:28:32,939 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 18:28:33,132 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 18:28:33,132 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:28:33,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:28:33,133 INFO L85 PathProgramCache]: Analyzing trace with hash 742860827, now seen corresponding path program 6 times [2023-11-22 18:28:33,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:28:33,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415869550] [2023-11-22 18:28:33,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:28:33,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:28:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:28:34,195 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 18:28:34,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:28:34,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415869550] [2023-11-22 18:28:34,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415869550] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:28:34,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785577359] [2023-11-22 18:28:34,196 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-22 18:28:34,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:28:34,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:28:34,197 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 18:28:34,198 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 18:28:34,979 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-11-22 18:28:34,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 18:28:34,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 93 conjunts are in the unsatisfiable core [2023-11-22 18:28:34,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:28:35,010 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 18:28:35,014 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 18:28:35,052 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 18:28:35,056 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 18:28:35,072 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-11-22 18:28:35,073 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 18:28:35,082 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 18:28:35,157 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 18:28:35,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:28:35,171 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-22 18:28:35,171 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 18:28:35,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:28:35,183 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-11-22 18:28:35,183 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 18:28:35,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:28:35,194 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 18:28:35,197 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 18:28:35,478 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 18:28:35,497 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-22 18:28:35,497 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 18:28:35,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:28:35,511 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 18:28:35,671 INFO L349 Elim1Store]: treesize reduction 70, result has 13.6 percent of original size [2023-11-22 18:28:35,672 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 18:28:35,686 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-22 18:28:35,687 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 18:28:35,692 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-22 18:28:35,692 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 18:28:35,709 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-11-22 18:28:35,709 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 18:28:35,722 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 18:28:35,830 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-22 18:28:35,831 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 18:28:35,844 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-11-22 18:28:35,844 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 18:28:35,848 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 18:28:35,909 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 18:28:35,992 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 18:28:36,019 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 18:28:36,019 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:28:36,271 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 18:28:36,329 WARN L854 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_main_#t~short8#1| (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1466 Int) (v_ArrVal_1465 Int) (v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1468 Int) (v_ArrVal_1471 (Array Int Int)) (v_ArrVal_1482 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse1 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1471)) (.cse4 (select v_ArrVal_1471 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse8 (select .cse7 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (or (let ((.cse0 (select (let ((.cse5 (select v_ArrVal_1474 .cse8))) (store (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_1465)) .cse4 v_ArrVal_1477) .cse5 v_ArrVal_1480) (select (select (store .cse6 .cse4 v_ArrVal_1474) .cse5) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse7 .cse2 v_ArrVal_1468) .cse3 v_ArrVal_1466)) .cse4) .cse8)) 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))) (< v_ArrVal_1465 (select .cse1 .cse3)) (not (= v_ArrVal_1474 (let ((.cse10 (+ .cse8 4))) (store (let ((.cse9 (+ .cse8 8))) (store (select .cse6 .cse4) .cse9 (select v_ArrVal_1474 .cse9))) .cse10 (select v_ArrVal_1474 .cse10))))) (not (= v_ArrVal_1471 (store (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|) .cse2 (select v_ArrVal_1471 .cse2)) .cse3 (select v_ArrVal_1471 .cse3))))))))) is different from false [2023-11-22 18:28:36,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:28:36,366 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 18:28:36,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:28:36,411 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 18:28:36,421 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 18:28:36,430 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 18:28:36,438 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 18:28:38,990 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 18:28:41,071 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 18:28:41,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:28:41,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 1 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 129 [2023-11-22 18:28:41,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:28:41,164 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 18:28:41,199 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 18:28:41,206 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 18:28:41,239 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 18:28:41,248 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 18:28:41,258 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 18:28:41,270 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 18:28:41,286 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 18:28:41,298 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 18:28:41,302 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 18:28:41,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:28:41,559 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 18:28:41,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:28:41,566 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 18:28:41,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:28:41,577 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 18:28:41,582 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 18:28:41,650 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 18:28:41,727 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 18:28:41,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:28:41,832 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 18:28:41,834 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:28:41,841 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-22 18:28:41,841 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 18:28:41,848 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 18:28:41,858 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-22 18:28:41,859 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 18:28:41,862 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 18:28:41,869 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 41 not checked. [2023-11-22 18:28:41,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785577359] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:28:41,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:28:41,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 31 [2023-11-22 18:28:41,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874714801] [2023-11-22 18:28:41,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:28:41,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-22 18:28:41,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:28:41,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-22 18:28:41,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=622, Unknown=19, NotChecked=270, Total=992 [2023-11-22 18:28:41,872 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 18:28:44,606 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 18:28:46,941 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 18:28:49,312 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 18:28:51,677 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 18:28:53,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-22 18:28:55,879 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 18:28:58,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-22 18:29:00,675 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 18:29:05,660 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 18:29:07,628 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 18:29:11,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:29:11,006 INFO L93 Difference]: Finished difference Result 179 states and 235 transitions. [2023-11-22 18:29:11,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-22 18:29:11,006 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 18:29:11,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:29:11,008 INFO L225 Difference]: With dead ends: 179 [2023-11-22 18:29:11,008 INFO L226 Difference]: Without dead ends: 155 [2023-11-22 18:29:11,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=218, Invalid=1520, Unknown=28, NotChecked=990, Total=2756 [2023-11-22 18:29:11,009 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 159 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 26 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 2108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 1433 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2023-11-22 18:29:11,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 800 Invalid, 2108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 641 Invalid, 8 Unknown, 1433 Unchecked, 12.7s Time] [2023-11-22 18:29:11,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-11-22 18:29:11,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 118. [2023-11-22 18:29:11,022 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 18:29:11,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 157 transitions. [2023-11-22 18:29:11,023 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 157 transitions. Word has length 39 [2023-11-22 18:29:11,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:29:11,023 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 157 transitions. [2023-11-22 18:29:11,023 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 18:29:11,023 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 157 transitions. [2023-11-22 18:29:11,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-22 18:29:11,024 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:29:11,024 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 18:29:11,044 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 18:29:11,240 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 18:29:11,240 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:29:11,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:29:11,241 INFO L85 PathProgramCache]: Analyzing trace with hash 110203856, now seen corresponding path program 5 times [2023-11-22 18:29:11,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:29:11,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183248578] [2023-11-22 18:29:11,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:29:11,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:29:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:29:14,495 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 18:29:14,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:29:14,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183248578] [2023-11-22 18:29:14,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183248578] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:29:14,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034395561] [2023-11-22 18:29:14,496 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-22 18:29:14,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:29:14,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:29:14,497 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 18:29:14,497 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 18:29:22,199 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-22 18:29:22,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 18:29:22,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 93 conjunts are in the unsatisfiable core [2023-11-22 18:29:22,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:29:22,253 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 18:29:22,604 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 18:29:22,778 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-11-22 18:29:22,778 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 18:29:22,847 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 18:29:23,382 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 18:29:23,500 INFO L349 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2023-11-22 18:29:23,501 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 18:29:23,516 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 18:29:23,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:29:23,601 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 18:29:23,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:29:23,682 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-11-22 18:29:23,682 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 18:29:25,031 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 18:29:25,032 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 18:29:25,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:29:25,099 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 18:29:25,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:29:25,147 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 18:29:25,997 INFO L349 Elim1Store]: treesize reduction 26, result has 16.1 percent of original size [2023-11-22 18:29:25,997 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 18:29:26,093 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 18:29:26,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:29:26,157 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 18:29:26,230 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 18:29:27,433 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-22 18:29:27,433 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 18:29:27,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:29:27,482 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 18:29:27,595 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 18:29:30,595 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-22 18:29:30,596 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 18:29:30,626 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 18:29:30,930 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 18:29:30,945 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 18:29:30,946 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:29:34,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:29:34,667 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