./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/heap-data/hash_fun.i --full-output --preprocessor.use.memory.slicer false --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/hash_fun.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 0abab60f5c601fd8191c1a2aa712d4ab55460e987c7d41ca7527c2934792cc0b --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 23:52:22,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 23:52:22,427 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 23:52:22,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 23:52:22,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 23:52:22,449 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 23:52:22,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 23:52:22,450 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 23:52:22,451 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 23:52:22,451 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 23:52:22,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 23:52:22,452 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 23:52:22,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 23:52:22,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 23:52:22,454 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 23:52:22,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 23:52:22,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 23:52:22,455 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 23:52:22,455 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 23:52:22,456 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 23:52:22,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 23:52:22,457 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 23:52:22,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 23:52:22,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 23:52:22,458 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 23:52:22,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 23:52:22,458 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 23:52:22,459 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 23:52:22,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 23:52:22,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 23:52:22,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 23:52:22,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 23:52:22,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 23:52:22,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 23:52:22,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 23:52:22,462 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 23:52:22,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 23:52:22,462 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 23:52:22,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 23:52:22,463 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 23:52:22,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 23:52:22,466 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 23:52:22,466 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 -> 0abab60f5c601fd8191c1a2aa712d4ab55460e987c7d41ca7527c2934792cc0b Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 23:52:22,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 23:52:22,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 23:52:22,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 23:52:22,758 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 23:52:22,759 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 23:52:22,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/hash_fun.i [2023-11-22 23:52:23,916 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 23:52:24,156 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 23:52:24,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/hash_fun.i [2023-11-22 23:52:24,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15deac65b/5735ab4d372246d5a277069e93755bbc/FLAG07347060c [2023-11-22 23:52:24,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15deac65b/5735ab4d372246d5a277069e93755bbc [2023-11-22 23:52:24,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 23:52:24,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 23:52:24,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 23:52:24,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 23:52:24,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 23:52:24,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:52:24" (1/1) ... [2023-11-22 23:52:24,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ccc053a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:24, skipping insertion in model container [2023-11-22 23:52:24,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:52:24" (1/1) ... [2023-11-22 23:52:24,248 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 23:52:24,541 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/hash_fun.i[23732,23745] [2023-11-22 23:52:24,545 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 23:52:24,556 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 23:52:24,587 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/hash_fun.i[23732,23745] [2023-11-22 23:52:24,588 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 23:52:24,612 INFO L206 MainTranslator]: Completed translation [2023-11-22 23:52:24,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:24 WrapperNode [2023-11-22 23:52:24,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 23:52:24,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 23:52:24,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 23:52:24,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 23:52:24,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:24" (1/1) ... [2023-11-22 23:52:24,632 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:24" (1/1) ... [2023-11-22 23:52:24,648 INFO L138 Inliner]: procedures = 125, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2023-11-22 23:52:24,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 23:52:24,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 23:52:24,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 23:52:24,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 23:52:24,657 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:24" (1/1) ... [2023-11-22 23:52:24,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:24" (1/1) ... [2023-11-22 23:52:24,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:24" (1/1) ... [2023-11-22 23:52:24,678 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:24" (1/1) ... [2023-11-22 23:52:24,685 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:24" (1/1) ... [2023-11-22 23:52:24,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:24" (1/1) ... [2023-11-22 23:52:24,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:24" (1/1) ... [2023-11-22 23:52:24,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:24" (1/1) ... [2023-11-22 23:52:24,701 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 23:52:24,702 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 23:52:24,702 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 23:52:24,702 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 23:52:24,703 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:24" (1/1) ... [2023-11-22 23:52:24,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 23:52:24,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:52:24,742 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 23:52:24,748 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 23:52:24,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-22 23:52:24,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-22 23:52:24,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 23:52:24,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 23:52:24,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 23:52:24,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-22 23:52:24,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-22 23:52:24,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 23:52:24,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-22 23:52:24,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-22 23:52:24,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 23:52:24,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 23:52:24,903 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 23:52:24,904 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 23:52:25,091 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 23:52:25,118 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 23:52:25,118 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-22 23:52:25,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:52:25 BoogieIcfgContainer [2023-11-22 23:52:25,119 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 23:52:25,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 23:52:25,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 23:52:25,125 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 23:52:25,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:52:24" (1/3) ... [2023-11-22 23:52:25,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543e6ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:52:25, skipping insertion in model container [2023-11-22 23:52:25,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:24" (2/3) ... [2023-11-22 23:52:25,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543e6ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:52:25, skipping insertion in model container [2023-11-22 23:52:25,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:52:25" (3/3) ... [2023-11-22 23:52:25,127 INFO L112 eAbstractionObserver]: Analyzing ICFG hash_fun.i [2023-11-22 23:52:25,143 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 23:52:25,143 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 23:52:25,191 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 23:52:25,198 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;@35ef294f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 23:52:25,198 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 23:52:25,201 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 23:52:25,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-22 23:52:25,205 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:52:25,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:52:25,206 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:52:25,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:52:25,212 INFO L85 PathProgramCache]: Analyzing trace with hash 223023209, now seen corresponding path program 1 times [2023-11-22 23:52:25,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:52:25,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375201047] [2023-11-22 23:52:25,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:52:25,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:52:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:52:25,338 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 23:52:25,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:52:25,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375201047] [2023-11-22 23:52:25,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375201047] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:52:25,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:52:25,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 23:52:25,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815977147] [2023-11-22 23:52:25,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:52:25,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 23:52:25,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:52:25,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 23:52:25,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 23:52:25,370 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 23:52:25,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:52:25,414 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2023-11-22 23:52:25,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 23:52:25,417 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2023-11-22 23:52:25,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:52:25,423 INFO L225 Difference]: With dead ends: 24 [2023-11-22 23:52:25,424 INFO L226 Difference]: Without dead ends: 13 [2023-11-22 23:52:25,426 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 23:52:25,429 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:52:25,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:52:25,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-11-22 23:52:25,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-11-22 23:52:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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 23:52:25,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2023-11-22 23:52:25,454 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 7 [2023-11-22 23:52:25,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:52:25,455 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2023-11-22 23:52:25,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 23:52:25,456 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2023-11-22 23:52:25,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-22 23:52:25,456 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:52:25,457 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:52:25,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 23:52:25,457 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:52:25,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:52:25,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2044429669, now seen corresponding path program 1 times [2023-11-22 23:52:25,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:52:25,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577950432] [2023-11-22 23:52:25,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:52:25,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:52:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:52:25,606 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 23:52:25,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:52:25,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577950432] [2023-11-22 23:52:25,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577950432] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:52:25,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:52:25,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 23:52:25,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657238851] [2023-11-22 23:52:25,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:52:25,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 23:52:25,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:52:25,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 23:52:25,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 23:52:25,610 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 23:52:25,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:52:25,660 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2023-11-22 23:52:25,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 23:52:25,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 23:52:25,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:52:25,661 INFO L225 Difference]: With dead ends: 27 [2023-11-22 23:52:25,661 INFO L226 Difference]: Without dead ends: 18 [2023-11-22 23:52:25,662 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 23:52:25,663 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:52:25,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 37 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:52:25,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-22 23:52:25,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-22 23:52:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 23:52:25,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2023-11-22 23:52:25,670 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 8 [2023-11-22 23:52:25,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:52:25,670 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2023-11-22 23:52:25,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 23:52:25,670 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2023-11-22 23:52:25,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-22 23:52:25,671 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:52:25,671 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:52:25,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 23:52:25,672 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:52:25,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:52:25,672 INFO L85 PathProgramCache]: Analyzing trace with hash 32114, now seen corresponding path program 1 times [2023-11-22 23:52:25,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:52:25,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766792737] [2023-11-22 23:52:25,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:52:25,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:52:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:52:26,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:52:26,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:52:26,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766792737] [2023-11-22 23:52:26,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766792737] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:52:26,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498317513] [2023-11-22 23:52:26,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:52:26,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:52:26,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:52:26,176 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 23:52:26,209 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 23:52:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:52:26,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-22 23:52:26,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:52:26,386 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 23:52:26,394 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 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-22 23:52:26,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:26,403 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 23:52:26,410 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 23:52:26,544 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 34 treesize of output 22 [2023-11-22 23:52:26,555 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 7 treesize of output 3 [2023-11-22 23:52:26,563 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 17 treesize of output 9 [2023-11-22 23:52:26,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:52:26,570 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:52:26,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:26,643 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 20 treesize of output 21 [2023-11-22 23:52:26,649 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 16 [2023-11-22 23:52:26,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:52:26,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498317513] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:52:26,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 23:52:26,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-11-22 23:52:26,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316348297] [2023-11-22 23:52:26,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 23:52:26,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 23:52:26,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:52:26,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 23:52:26,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-22 23:52:26,676 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 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 23:52:26,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:52:26,792 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2023-11-22 23:52:26,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 23:52:26,793 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 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 13 [2023-11-22 23:52:26,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:52:26,794 INFO L225 Difference]: With dead ends: 28 [2023-11-22 23:52:26,794 INFO L226 Difference]: Without dead ends: 26 [2023-11-22 23:52:26,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-11-22 23:52:26,798 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 86 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:52:26,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 34 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:52:26,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-22 23:52:26,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2023-11-22 23:52:26,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 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 23:52:26,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2023-11-22 23:52:26,813 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 13 [2023-11-22 23:52:26,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:52:26,814 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2023-11-22 23:52:26,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 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 23:52:26,815 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2023-11-22 23:52:26,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-22 23:52:26,815 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:52:26,815 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:52:26,832 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 23:52:27,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:52:27,033 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:52:27,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:52:27,033 INFO L85 PathProgramCache]: Analyzing trace with hash 34036, now seen corresponding path program 1 times [2023-11-22 23:52:27,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:52:27,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275520550] [2023-11-22 23:52:27,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:52:27,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:52:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:52:27,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:52:27,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:52:27,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275520550] [2023-11-22 23:52:27,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275520550] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:52:27,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136398386] [2023-11-22 23:52:27,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:52:27,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:52:27,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:52:27,294 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 23:52:27,319 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 23:52:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:52:27,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-22 23:52:27,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:52:27,424 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 23:52:27,430 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 23:52:27,435 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 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-22 23:52:27,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:27,441 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 23:52:27,517 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 34 treesize of output 22 [2023-11-22 23:52:27,527 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 17 treesize of output 9 [2023-11-22 23:52:27,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:52:27,533 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:52:27,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:27,569 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 20 treesize of output 21 [2023-11-22 23:52:27,572 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 16 [2023-11-22 23:52:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:52:27,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136398386] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:52:27,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 23:52:27,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-11-22 23:52:27,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470663508] [2023-11-22 23:52:27,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 23:52:27,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 23:52:27,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:52:27,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 23:52:27,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-22 23:52:27,588 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 23:52:27,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:52:27,669 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2023-11-22 23:52:27,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 23:52:27,669 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-22 23:52:27,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:52:27,670 INFO L225 Difference]: With dead ends: 30 [2023-11-22 23:52:27,670 INFO L226 Difference]: Without dead ends: 23 [2023-11-22 23:52:27,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-11-22 23:52:27,671 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 68 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:52:27,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 35 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:52:27,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-22 23:52:27,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2023-11-22 23:52:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 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 23:52:27,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-11-22 23:52:27,675 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 13 [2023-11-22 23:52:27,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:52:27,675 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-11-22 23:52:27,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 23:52:27,676 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2023-11-22 23:52:27,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-22 23:52:27,676 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:52:27,676 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:52:27,694 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 23:52:27,890 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,SelfDestructingSolverStorable3 [2023-11-22 23:52:27,891 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:52:27,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:52:27,891 INFO L85 PathProgramCache]: Analyzing trace with hash -293740875, now seen corresponding path program 1 times [2023-11-22 23:52:27,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:52:27,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926547381] [2023-11-22 23:52:27,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:52:27,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:52:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:52:28,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:52:28,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:52:28,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926547381] [2023-11-22 23:52:28,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926547381] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:52:28,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364074581] [2023-11-22 23:52:28,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:52:28,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:52:28,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:52:28,289 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 23:52:28,311 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 23:52:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:52:28,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-22 23:52:28,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:52:28,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:28,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 22 [2023-11-22 23:52:28,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:28,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:28,435 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 47 treesize of output 38 [2023-11-22 23:52:28,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2023-11-22 23:52:28,444 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 23 treesize of output 11 [2023-11-22 23:52:28,538 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-22 23:52:28,538 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 43 treesize of output 33 [2023-11-22 23:52:28,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:28,544 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 26 treesize of output 21 [2023-11-22 23:52:28,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:52:28,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:52:29,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:52:29,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364074581] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:52:29,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 23:52:29,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-22 23:52:29,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78830] [2023-11-22 23:52:29,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 23:52:29,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-22 23:52:29,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:52:29,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-22 23:52:29,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=78, Unknown=6, NotChecked=0, Total=110 [2023-11-22 23:52:29,526 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 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 23:52:29,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:52:29,955 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2023-11-22 23:52:29,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 23:52:29,956 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 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) Word has length 18 [2023-11-22 23:52:29,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:52:29,956 INFO L225 Difference]: With dead ends: 41 [2023-11-22 23:52:29,956 INFO L226 Difference]: Without dead ends: 27 [2023-11-22 23:52:29,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=37, Invalid=111, Unknown=8, NotChecked=0, Total=156 [2023-11-22 23:52:29,957 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:52:29,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 85 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:52:29,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-22 23:52:29,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-22 23:52:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 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 23:52:29,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2023-11-22 23:52:29,961 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2023-11-22 23:52:29,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:52:29,961 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2023-11-22 23:52:29,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 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 23:52:29,962 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2023-11-22 23:52:29,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-22 23:52:29,962 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:52:29,962 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-22 23:52:29,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-22 23:52:30,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:52:30,179 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:52:30,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:52:30,179 INFO L85 PathProgramCache]: Analyzing trace with hash 879356546, now seen corresponding path program 2 times [2023-11-22 23:52:30,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:52:30,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797995952] [2023-11-22 23:52:30,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:52:30,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:52:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:52:30,974 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:52:30,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:52:30,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797995952] [2023-11-22 23:52:30,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797995952] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:52:30,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875595137] [2023-11-22 23:52:30,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 23:52:30,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:52:30,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:52:30,980 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 23:52:31,003 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 23:52:31,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 23:52:31,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 23:52:31,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-22 23:52:31,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:52:31,110 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 10 treesize of output 9 [2023-11-22 23:52:31,117 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 23:52:31,123 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 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-22 23:52:31,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:31,128 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 23:52:31,134 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 23:52:31,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:31,232 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 73 treesize of output 22 [2023-11-22 23:52:31,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:31,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:31,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:31,250 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 35 treesize of output 17 [2023-11-22 23:52:31,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:31,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:31,260 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 75 treesize of output 60 [2023-11-22 23:52:31,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 43 [2023-11-22 23:52:31,271 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 31 treesize of output 1 [2023-11-22 23:52:31,284 INFO L349 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2023-11-22 23:52:31,285 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 23 treesize of output 23 [2023-11-22 23:52:31,447 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-22 23:52:31,450 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 86 treesize of output 48 [2023-11-22 23:52:31,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:31,459 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 22 treesize of output 17 [2023-11-22 23:52:31,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:31,475 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 26 treesize of output 21 [2023-11-22 23:52:31,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:31,592 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 53 treesize of output 29 [2023-11-22 23:52:31,600 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 17 treesize of output 9 [2023-11-22 23:52:31,614 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:52:31,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:52:31,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:31,883 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 113 treesize of output 112 [2023-11-22 23:52:31,914 INFO L349 Elim1Store]: treesize reduction 61, result has 38.4 percent of original size [2023-11-22 23:52:31,917 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 512 treesize of output 436 [2023-11-22 23:52:31,961 INFO L349 Elim1Store]: treesize reduction 58, result has 30.1 percent of original size [2023-11-22 23:52:31,961 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 3 case distinctions, treesize of input 363 treesize of output 306 [2023-11-22 23:52:31,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:31,989 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 298 treesize of output 296 [2023-11-22 23:52:32,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:32,034 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 276 treesize of output 271 [2023-11-22 23:52:32,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:32,053 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 139 treesize of output 144 [2023-11-22 23:52:32,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:32,069 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 356 treesize of output 286 [2023-11-22 23:52:32,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:32,099 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 391 treesize of output 381 [2023-11-22 23:52:32,165 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 12 treesize of output 10 [2023-11-22 23:52:32,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:32,306 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 25 treesize of output 29 [2023-11-22 23:52:32,370 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 71 treesize of output 59 [2023-11-22 23:52:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:52:32,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875595137] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:52:32,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 23:52:32,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2023-11-22 23:52:32,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981677475] [2023-11-22 23:52:32,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 23:52:32,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-22 23:52:32,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:52:32,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-22 23:52:32,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=188, Unknown=1, NotChecked=0, Total=240 [2023-11-22 23:52:32,404 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 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 23:52:32,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:52:32,827 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2023-11-22 23:52:32,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 23:52:32,827 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 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 23 [2023-11-22 23:52:32,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:52:32,828 INFO L225 Difference]: With dead ends: 38 [2023-11-22 23:52:32,828 INFO L226 Difference]: Without dead ends: 36 [2023-11-22 23:52:32,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=370, Unknown=1, NotChecked=0, Total=506 [2023-11-22 23:52:32,829 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 71 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 23:52:32,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 71 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 23:52:32,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-22 23:52:32,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2023-11-22 23:52:32,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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 23:52:32,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2023-11-22 23:52:32,834 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 23 [2023-11-22 23:52:32,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:52:32,834 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-11-22 23:52:32,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 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 23:52:32,834 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2023-11-22 23:52:32,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-22 23:52:32,835 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:52:32,835 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:52:32,852 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 23:52:33,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:52:33,050 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:52:33,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:52:33,050 INFO L85 PathProgramCache]: Analyzing trace with hash 879358468, now seen corresponding path program 1 times [2023-11-22 23:52:33,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:52:33,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470884497] [2023-11-22 23:52:33,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:52:33,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:52:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:52:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:52:33,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:52:33,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470884497] [2023-11-22 23:52:33,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470884497] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:52:33,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373856137] [2023-11-22 23:52:33,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:52:33,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:52:33,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:52:33,604 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 23:52:33,619 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 23:52:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:52:33,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-22 23:52:33,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:52:33,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 23:52:33,732 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 10 treesize of output 9 [2023-11-22 23:52:33,740 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 23:52:33,743 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 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-22 23:52:33,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:33,747 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 23:52:33,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:33,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:33,831 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 43 treesize of output 34 [2023-11-22 23:52:33,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-22 23:52:33,842 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 23 treesize of output 11 [2023-11-22 23:52:33,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:33,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:33,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:33,862 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 35 treesize of output 17 [2023-11-22 23:52:33,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:33,871 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 109 treesize of output 31 [2023-11-22 23:52:33,884 INFO L349 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2023-11-22 23:52:33,884 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 23 treesize of output 23 [2023-11-22 23:52:34,040 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-22 23:52:34,040 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 86 treesize of output 48 [2023-11-22 23:52:34,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:34,047 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 26 treesize of output 21 [2023-11-22 23:52:34,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:34,063 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 23:52:34,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:34,139 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 53 treesize of output 29 [2023-11-22 23:52:34,148 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 17 treesize of output 9 [2023-11-22 23:52:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:52:34,153 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:52:34,175 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_372 (Array Int Int))) (< |c_ULTIMATE.start_main_~base~0#1| (+ (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_372) (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) 1))) is different from false [2023-11-22 23:52:34,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:34,371 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 107 treesize of output 108 [2023-11-22 23:52:34,414 INFO L349 Elim1Store]: treesize reduction 58, result has 30.1 percent of original size [2023-11-22 23:52:34,414 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 3 case distinctions, treesize of input 134 treesize of output 131 [2023-11-22 23:52:34,422 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:52:34,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:34,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:34,435 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 630 treesize of output 455 [2023-11-22 23:52:34,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:34,452 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 293 treesize of output 261 [2023-11-22 23:52:34,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:34,470 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 212 treesize of output 210 [2023-11-22 23:52:34,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:34,485 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 194 treesize of output 176 [2023-11-22 23:52:34,502 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 123 treesize of output 110 [2023-11-22 23:52:34,516 INFO L349 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-11-22 23:52:34,516 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 130 treesize of output 106 [2023-11-22 23:52:34,530 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 12 treesize of output 10 [2023-11-22 23:52:34,585 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 8 treesize of output 6 [2023-11-22 23:52:34,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:34,622 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 44 treesize of output 42 [2023-11-22 23:52:34,659 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-22 23:52:34,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373856137] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:52:34,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 23:52:34,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2023-11-22 23:52:34,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602530709] [2023-11-22 23:52:34,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 23:52:34,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-22 23:52:34,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:52:34,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-22 23:52:34,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=140, Unknown=1, NotChecked=24, Total=210 [2023-11-22 23:52:34,662 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 14 states have internal predecessors, (59), 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 23:52:35,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:52:35,045 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2023-11-22 23:52:35,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 23:52:35,046 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 14 states have internal predecessors, (59), 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 23:52:35,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:52:35,046 INFO L225 Difference]: With dead ends: 40 [2023-11-22 23:52:35,046 INFO L226 Difference]: Without dead ends: 33 [2023-11-22 23:52:35,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=276, Unknown=1, NotChecked=36, Total=420 [2023-11-22 23:52:35,047 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 50 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 23:52:35,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 91 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 32 Unchecked, 0.2s Time] [2023-11-22 23:52:35,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-22 23:52:35,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2023-11-22 23:52:35,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 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 23:52:35,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2023-11-22 23:52:35,052 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 23 [2023-11-22 23:52:35,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:52:35,052 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2023-11-22 23:52:35,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 14 states have internal predecessors, (59), 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 23:52:35,052 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2023-11-22 23:52:35,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-22 23:52:35,052 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:52:35,053 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2023-11-22 23:52:35,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-22 23:52:35,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:52:35,253 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:52:35,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:52:35,254 INFO L85 PathProgramCache]: Analyzing trace with hash 792599461, now seen corresponding path program 3 times [2023-11-22 23:52:35,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:52:35,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475110319] [2023-11-22 23:52:35,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:52:35,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:52:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:52:36,029 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:52:36,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:52:36,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475110319] [2023-11-22 23:52:36,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475110319] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:52:36,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060997967] [2023-11-22 23:52:36,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 23:52:36,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:52:36,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:52:36,032 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 23:52:36,048 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 23:52:36,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-22 23:52:36,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 23:52:36,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-22 23:52:36,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:52:36,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:36,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 77 treesize of output 15 [2023-11-22 23:52:36,200 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 10 treesize of output 9 [2023-11-22 23:52:36,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:36,211 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 73 treesize of output 22 [2023-11-22 23:52:36,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:36,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:36,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:36,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:36,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 54 treesize of output 48 [2023-11-22 23:52:36,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-22 23:52:36,318 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 23 treesize of output 11 [2023-11-22 23:52:36,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:36,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:36,339 INFO L349 Elim1Store]: treesize reduction 66, result has 7.0 percent of original size [2023-11-22 23:52:36,339 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 73 [2023-11-22 23:52:36,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 48 [2023-11-22 23:52:36,356 INFO L349 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2023-11-22 23:52:36,357 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 23 treesize of output 23 [2023-11-22 23:52:36,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 1 [2023-11-22 23:52:36,530 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2023-11-22 23:52:36,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 99 treesize of output 59 [2023-11-22 23:52:36,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:36,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:36,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 37 treesize of output 35 [2023-11-22 23:52:36,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:36,702 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2023-11-22 23:52:36,702 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 47 [2023-11-22 23:52:36,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:36,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:36,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 37 treesize of output 35 [2023-11-22 23:52:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:52:36,767 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:52:37,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:37,330 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 817 treesize of output 822 [2023-11-22 23:52:38,447 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (and (forall ((v_ArrVal_478 Int) (v_ArrVal_488 Int) (v_ArrVal_482 Int) (v_ArrVal_487 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse0 (select v_ArrVal_487 4))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse0 (store (store (select |c_#memory_$Pointer$.offset| .cse0) 4 .cse9) 0 v_ArrVal_482))) (.cse6 (store |c_#memory_$Pointer$.base| .cse0 (store (store (select |c_#memory_$Pointer$.base| .cse0) 4 .cse8) 0 v_ArrVal_478)))) (let ((.cse2 (store .cse6 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| .cse0))) (.cse1 (store .cse7 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0)))) (or (< |c_#StackHeapBarrier| (+ 1 .cse0)) (< |c_#StackHeapBarrier| (+ v_ArrVal_488 1)) (not (= v_ArrVal_486 (store (store (select .cse1 v_ArrVal_488) 4 0) 0 (select v_ArrVal_486 0)))) (not (= v_ArrVal_487 (store (store (select .cse2 v_ArrVal_488) 4 .cse0) 0 (select v_ArrVal_487 0)))) (= v_ArrVal_488 .cse0) (= (select (let ((.cse3 (store .cse6 v_ArrVal_488 v_ArrVal_487)) (.cse4 (select (store .cse2 v_ArrVal_488 v_ArrVal_487) |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse5 (select (select (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_488)) v_ArrVal_488) 4))) (select (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse5)) .cse5))) (+ (select (select (store (store .cse7 v_ArrVal_488 v_ArrVal_486) |c_ULTIMATE.start_main_~#list~0#1.base| (store (select (store .cse1 v_ArrVal_488 v_ArrVal_486) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) v_ArrVal_488) 4) 4)) 0)))))) (forall ((v_prenex_8 (Array Int Int)) (v_ArrVal_478 Int) (v_prenex_7 Int) (v_prenex_9 (Array Int Int)) (v_ArrVal_482 Int)) (let ((.cse11 (select v_prenex_8 4))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| .cse11 (store (store (select |c_#memory_$Pointer$.offset| .cse11) 4 .cse9) 0 v_ArrVal_482))) (.cse15 (store |c_#memory_$Pointer$.base| .cse11 (store (store (select |c_#memory_$Pointer$.base| .cse11) 4 .cse8) 0 v_ArrVal_478)))) (let ((.cse10 (store .cse15 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| .cse11))) (.cse16 (store .cse17 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0)))) (or (not (= (store (store (select .cse10 v_prenex_7) 4 .cse11) 0 (select v_prenex_8 0)) v_prenex_8)) (= (let ((.cse12 (store .cse17 v_prenex_7 v_prenex_9)) (.cse13 (select (store .cse16 v_prenex_7 v_prenex_9) |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse14 (select (select (store .cse12 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) v_prenex_7) 4))) (select (select (store .cse12 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse14)) (select (select (store (store .cse15 v_prenex_7 v_prenex_8) |c_ULTIMATE.start_main_~#list~0#1.base| (store (select (store .cse10 v_prenex_7 v_prenex_8) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_prenex_7)) v_prenex_7) 4)) (+ .cse14 4)))) 0) (not (= (store (store (select .cse16 v_prenex_7) 4 0) 0 (select v_prenex_9 0)) v_prenex_9)) (< |c_#StackHeapBarrier| (+ .cse11 1)) (< |c_#StackHeapBarrier| (+ v_prenex_7 1))))))))) is different from false [2023-11-22 23:52:38,737 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-22 23:52:38,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060997967] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:52:38,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 23:52:38,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2023-11-22 23:52:38,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869760210] [2023-11-22 23:52:38,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 23:52:38,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-22 23:52:38,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:52:38,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-22 23:52:38,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=195, Unknown=1, NotChecked=28, Total=272 [2023-11-22 23:52:38,739 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 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 23:52:39,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:52:39,196 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2023-11-22 23:52:39,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 23:52:39,196 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 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) Word has length 28 [2023-11-22 23:52:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:52:39,197 INFO L225 Difference]: With dead ends: 56 [2023-11-22 23:52:39,197 INFO L226 Difference]: Without dead ends: 37 [2023-11-22 23:52:39,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=59, Invalid=250, Unknown=1, NotChecked=32, Total=342 [2023-11-22 23:52:39,198 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 23:52:39,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 193 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 36 Unchecked, 0.4s Time] [2023-11-22 23:52:39,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-22 23:52:39,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-22 23:52:39,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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 23:52:39,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2023-11-22 23:52:39,203 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 28 [2023-11-22 23:52:39,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:52:39,203 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2023-11-22 23:52:39,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 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 23:52:39,203 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2023-11-22 23:52:39,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-22 23:52:39,204 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:52:39,204 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2023-11-22 23:52:39,220 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 23:52:39,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:52:39,419 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:52:39,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:52:39,420 INFO L85 PathProgramCache]: Analyzing trace with hash 217811762, now seen corresponding path program 4 times [2023-11-22 23:52:39,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:52:39,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315726839] [2023-11-22 23:52:39,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:52:39,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:52:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:52:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:52:40,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:52:40,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315726839] [2023-11-22 23:52:40,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315726839] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:52:40,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140432150] [2023-11-22 23:52:40,905 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-22 23:52:40,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:52:40,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:52:40,906 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 23:52:40,916 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 23:52:41,044 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-22 23:52:41,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 23:52:41,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 85 conjunts are in the unsatisfiable core [2023-11-22 23:52:41,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:52:41,058 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 23:52:41,098 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 23:52:41,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:41,103 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 16 treesize of output 18 [2023-11-22 23:52:41,110 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 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-22 23:52:41,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:41,114 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 23:52:41,119 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 23:52:41,242 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-11-22 23:52:41,242 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 38 treesize of output 30 [2023-11-22 23:52:41,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:41,247 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 1 case distinctions, treesize of input 38 treesize of output 33 [2023-11-22 23:52:41,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:41,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:41,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:41,258 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 32 treesize of output 29 [2023-11-22 23:52:41,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:41,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:41,266 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 75 treesize of output 60 [2023-11-22 23:52:41,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:41,297 INFO L349 Elim1Store]: treesize reduction 58, result has 34.8 percent of original size [2023-11-22 23:52:41,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2023-11-22 23:52:41,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-22 23:52:41,315 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 61 treesize of output 39 [2023-11-22 23:52:41,329 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 20 treesize of output 1 [2023-11-22 23:52:41,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:41,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:41,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:41,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 54 treesize of output 48 [2023-11-22 23:52:41,523 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 23 treesize of output 11 [2023-11-22 23:52:41,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-22 23:52:41,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:41,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:41,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:41,538 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 39 treesize of output 21 [2023-11-22 23:52:41,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:41,553 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-22 23:52:41,553 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 165 treesize of output 61 [2023-11-22 23:52:41,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:41,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:41,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:41,584 INFO L349 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2023-11-22 23:52:41,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 33 [2023-11-22 23:52:41,833 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 23:52:41,833 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 3 case distinctions, treesize of input 149 treesize of output 73 [2023-11-22 23:52:41,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:41,841 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 26 treesize of output 21 [2023-11-22 23:52:41,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:41,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:41,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 37 treesize of output 35 [2023-11-22 23:52:42,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:42,049 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-22 23:52:42,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 127 treesize of output 86 [2023-11-22 23:52:42,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:42,057 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 26 treesize of output 21 [2023-11-22 23:52:42,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:42,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:42,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 37 treesize of output 35 [2023-11-22 23:52:42,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:42,230 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-22 23:52:42,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 51 [2023-11-22 23:52:42,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2023-11-22 23:52:42,241 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:52:42,242 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:52:42,271 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_661 (Array Int Int))) (< (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_661) (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) (+ |c_ULTIMATE.start_main_~base~0#1| 100))) is different from false [2023-11-22 23:52:42,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:42,747 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 481 treesize of output 485 [2023-11-22 23:52:46,564 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:52:47,163 INFO L349 Elim1Store]: treesize reduction 123, result has 37.2 percent of original size [2023-11-22 23:52:47,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 16 case distinctions, treesize of input 29651 treesize of output 26586 [2023-11-22 23:52:47,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:47,230 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 2658 treesize of output 2548 [2023-11-22 23:52:47,250 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:52:47,573 INFO L349 Elim1Store]: treesize reduction 82, result has 53.9 percent of original size [2023-11-22 23:52:47,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 142842 treesize of output 132759 [2023-11-22 23:52:47,685 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:52:47,686 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:52:47,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:47,696 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:52:47,706 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:52:47,706 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:52:47,714 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:52:47,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:47,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:47,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:47,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:47,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:47,824 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 5038 treesize of output 4707 [2023-11-22 23:52:47,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:47,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:47,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:47,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:47,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 4341 treesize of output 3972 [2023-11-22 23:52:48,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:48,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:48,071 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 3880 treesize of output 3861 [2023-11-22 23:52:48,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:48,173 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 3753 treesize of output 3651 [2023-11-22 23:52:48,244 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:52:48,248 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:52:48,394 INFO L349 Elim1Store]: treesize reduction 86, result has 52.2 percent of original size [2023-11-22 23:52:48,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 6973 treesize of output 6728 [2023-11-22 23:52:48,896 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:52:48,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:49,008 INFO L349 Elim1Store]: treesize reduction 19, result has 74.3 percent of original size [2023-11-22 23:52:49,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 1023 treesize of output 1025 [2023-11-22 23:52:51,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:51,782 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 1 case distinctions, treesize of input 12 treesize of output 6 [2023-11-22 23:52:51,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:51,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:51,900 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 35 treesize of output 38 [2023-11-22 23:52:51,910 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 23:52:52,012 INFO L349 Elim1Store]: treesize reduction 298, result has 9.1 percent of original size [2023-11-22 23:52:52,012 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 1178 treesize of output 1058 [2023-11-22 23:52:52,062 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:52:52,062 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:52:52,063 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 26 treesize of output 20 [2023-11-22 23:52:52,156 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 49 treesize of output 47 [2023-11-22 23:52:52,734 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 21 refuted. 4 times theorem prover too weak. 0 trivial. 9 not checked. [2023-11-22 23:52:52,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140432150] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:52:52,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 23:52:52,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2023-11-22 23:52:52,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743659426] [2023-11-22 23:52:52,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 23:52:52,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-22 23:52:52,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:52:52,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-22 23:52:52,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=353, Unknown=2, NotChecked=38, Total=462 [2023-11-22 23:52:52,737 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 22 states, 22 states have (on average 4.318181818181818) internal successors, (95), 21 states have internal predecessors, (95), 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 23:52:53,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:52:53,805 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2023-11-22 23:52:53,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 23:52:53,806 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.318181818181818) internal successors, (95), 21 states have internal predecessors, (95), 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 33 [2023-11-22 23:52:53,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:52:53,806 INFO L225 Difference]: With dead ends: 48 [2023-11-22 23:52:53,806 INFO L226 Difference]: Without dead ends: 46 [2023-11-22 23:52:53,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=199, Invalid=673, Unknown=2, NotChecked=56, Total=930 [2023-11-22 23:52:53,807 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 85 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-22 23:52:53,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 145 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 278 Invalid, 0 Unknown, 52 Unchecked, 0.5s Time] [2023-11-22 23:52:53,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-22 23:52:53,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2023-11-22 23:52:53,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 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 23:52:53,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2023-11-22 23:52:53,813 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 33 [2023-11-22 23:52:53,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:52:53,814 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2023-11-22 23:52:53,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.318181818181818) internal successors, (95), 21 states have internal predecessors, (95), 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 23:52:53,814 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2023-11-22 23:52:53,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-22 23:52:53,815 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:52:53,815 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-22 23:52:53,827 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 23:52:54,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:52:54,024 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:52:54,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:52:54,025 INFO L85 PathProgramCache]: Analyzing trace with hash 217813684, now seen corresponding path program 2 times [2023-11-22 23:52:54,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:52:54,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434978222] [2023-11-22 23:52:54,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:52:54,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:52:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:52:55,480 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:52:55,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:52:55,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434978222] [2023-11-22 23:52:55,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434978222] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:52:55,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628539341] [2023-11-22 23:52:55,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 23:52:55,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:52:55,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:52:55,481 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 23:52:55,482 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 23:52:55,619 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 23:52:55,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 23:52:55,622 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 76 conjunts are in the unsatisfiable core [2023-11-22 23:52:55,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:52:55,660 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 10 treesize of output 9 [2023-11-22 23:52:55,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 23:52:55,669 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 23:52:55,679 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 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-22 23:52:55,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:55,684 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 23:52:55,786 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2023-11-22 23:52:55,786 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 29 treesize of output 37 [2023-11-22 23:52:55,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:55,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:55,791 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 87 treesize of output 70 [2023-11-22 23:52:55,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 51 [2023-11-22 23:52:55,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 1 [2023-11-22 23:52:55,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:55,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:55,825 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 39 treesize of output 21 [2023-11-22 23:52:55,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:55,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:55,841 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 43 treesize of output 34 [2023-11-22 23:52:55,844 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 23 treesize of output 11 [2023-11-22 23:52:55,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-22 23:52:55,970 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-22 23:52:55,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:55,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:55,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:55,986 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 36 treesize of output 33 [2023-11-22 23:52:55,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:55,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:56,005 INFO L349 Elim1Store]: treesize reduction 66, result has 7.0 percent of original size [2023-11-22 23:52:56,006 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 101 [2023-11-22 23:52:56,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 80 [2023-11-22 23:52:56,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:56,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:56,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:56,024 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 88 treesize of output 40 [2023-11-22 23:52:56,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:56,038 INFO L349 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2023-11-22 23:52:56,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 30 [2023-11-22 23:52:56,045 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 31 treesize of output 1 [2023-11-22 23:52:56,050 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 20 treesize of output 1 [2023-11-22 23:52:56,269 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2023-11-22 23:52:56,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 150 treesize of output 74 [2023-11-22 23:52:56,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:56,278 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 26 treesize of output 21 [2023-11-22 23:52:56,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:56,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:56,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:56,288 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2023-11-22 23:52:56,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:56,470 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2023-11-22 23:52:56,470 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 62 [2023-11-22 23:52:56,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:56,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:56,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:56,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 37 treesize of output 35 [2023-11-22 23:52:56,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:56,498 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 23:52:56,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:52:56,591 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2023-11-22 23:52:56,591 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 52 [2023-11-22 23:52:56,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2023-11-22 23:52:56,604 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:52:56,604 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:52:56,661 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_829 (Array Int Int))) (< |c_ULTIMATE.start_main_~base~0#1| (+ (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse5 (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse6 (+ (select .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6)) (.cse2 (+ 4 .cse4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_829) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse1)) .cse1) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse4)) .cse1) .cse2)))))) 1))) is different from false [2023-11-22 23:52:56,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:52:56,697 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 262 treesize of output 266 [2023-11-22 23:53:02,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:53:02,756 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 716 treesize of output 715 [2023-11-22 23:53:02,760 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:53:02,988 INFO L349 Elim1Store]: treesize reduction 140, result has 65.0 percent of original size [2023-11-22 23:53:02,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 107164 treesize of output 99751 [2023-11-22 23:53:03,038 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:53:03,249 INFO L349 Elim1Store]: treesize reduction 89, result has 48.6 percent of original size [2023-11-22 23:53:03,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 88183 treesize of output 79204 [2023-11-22 23:53:03,349 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:53:03,349 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:53:03,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:03,487 INFO L349 Elim1Store]: treesize reduction 1002, result has 32.6 percent of original size [2023-11-22 23:53:03,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 30158 treesize of output 26809 [2023-11-22 23:53:03,673 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:53:03,739 INFO L349 Elim1Store]: treesize reduction 13, result has 78.3 percent of original size [2023-11-22 23:53:03,740 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 14179 treesize of output 13668 [2023-11-22 23:53:04,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:04,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:04,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:04,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:04,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:04,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:04,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:04,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:53:04,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 2 new quantified variables, introduced 14 case distinctions, treesize of input 12557 treesize of output 11589 [2023-11-22 23:53:04,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:04,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:04,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:04,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:04,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:04,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:04,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:04,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:04,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:53:04,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 2 new quantified variables, introduced 16 case distinctions, treesize of input 11545 treesize of output 9561 [2023-11-22 23:53:04,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:04,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:04,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:04,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:04,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:04,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:04,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:04,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:53:04,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 2 new quantified variables, introduced 14 case distinctions, treesize of input 9517 treesize of output 9055 [2023-11-22 23:53:04,910 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:53:04,911 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:53:05,007 INFO L349 Elim1Store]: treesize reduction 78, result has 50.0 percent of original size [2023-11-22 23:53:05,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 2059 treesize of output 2040 [2023-11-22 23:53:05,840 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-22 23:53:05,841 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 28 treesize of output 22 [2023-11-22 23:53:07,183 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 0 case distinctions, treesize of input 14 treesize of output 1 [2023-11-22 23:53:07,218 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 0 case distinctions, treesize of input 14 treesize of output 1 [2023-11-22 23:53:07,239 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 0 case distinctions, treesize of input 14 treesize of output 1 [2023-11-22 23:53:16,039 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:53:16,071 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-22 23:53:16,091 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 0 case distinctions, treesize of input 14 treesize of output 1 [2023-11-22 23:53:16,125 INFO L349 Elim1Store]: treesize reduction 32, result has 52.9 percent of original size [2023-11-22 23:53:16,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 102 [2023-11-22 23:53:16,139 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-22 23:53:16,140 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 2 case distinctions, treesize of input 26 treesize of output 4 [2023-11-22 23:53:16,165 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 23:53:16,185 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:53:16,185 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 25 treesize of output 19 [2023-11-22 23:53:16,191 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-22 23:53:16,213 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 23:53:16,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:16,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-22 23:53:16,222 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 146 treesize of output 144 [2023-11-22 23:53:16,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 7 treesize of output 5 [2023-11-22 23:53:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2023-11-22 23:53:16,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628539341] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:53:16,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 23:53:16,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2023-11-22 23:53:16,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995256890] [2023-11-22 23:53:16,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 23:53:16,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-22 23:53:16,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:53:16,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-22 23:53:16,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=385, Unknown=2, NotChecked=40, Total=506 [2023-11-22 23:53:16,778 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 23 states, 23 states have (on average 4.043478260869565) internal successors, (93), 22 states have internal predecessors, (93), 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 23:53:17,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:53:17,777 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2023-11-22 23:53:17,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-22 23:53:17,777 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.043478260869565) internal successors, (93), 22 states have internal predecessors, (93), 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 33 [2023-11-22 23:53:17,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:53:17,778 INFO L225 Difference]: With dead ends: 50 [2023-11-22 23:53:17,778 INFO L226 Difference]: Without dead ends: 43 [2023-11-22 23:53:17,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=242, Invalid=816, Unknown=2, NotChecked=62, Total=1122 [2023-11-22 23:53:17,779 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 62 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 23:53:17,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 180 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 278 Invalid, 0 Unknown, 44 Unchecked, 0.4s Time] [2023-11-22 23:53:17,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-22 23:53:17,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2023-11-22 23:53:17,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 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 23:53:17,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2023-11-22 23:53:17,785 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 33 [2023-11-22 23:53:17,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:53:17,785 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2023-11-22 23:53:17,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.043478260869565) internal successors, (93), 22 states have internal predecessors, (93), 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 23:53:17,785 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2023-11-22 23:53:17,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-22 23:53:17,786 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:53:17,786 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2023-11-22 23:53:17,806 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 23:53:18,001 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,SelfDestructingSolverStorable9 [2023-11-22 23:53:18,001 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:53:18,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:53:18,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1023764725, now seen corresponding path program 5 times [2023-11-22 23:53:18,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:53:18,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934445005] [2023-11-22 23:53:18,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:53:18,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:53:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:53:19,714 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:53:19,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:53:19,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934445005] [2023-11-22 23:53:19,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934445005] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:53:19,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638914575] [2023-11-22 23:53:19,715 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-22 23:53:19,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:53:19,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:53:19,716 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 23:53:19,723 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 23:53:20,028 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-22 23:53:20,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 23:53:20,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 89 conjunts are in the unsatisfiable core [2023-11-22 23:53:20,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:53:20,079 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 10 treesize of output 9 [2023-11-22 23:53:20,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:20,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:20,084 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 43 treesize of output 34 [2023-11-22 23:53:20,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-22 23:53:20,095 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 23 treesize of output 11 [2023-11-22 23:53:20,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:20,107 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 15 [2023-11-22 23:53:20,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:20,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:20,205 INFO L349 Elim1Store]: treesize reduction 66, result has 7.0 percent of original size [2023-11-22 23:53:20,205 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 73 [2023-11-22 23:53:20,213 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 25 treesize of output 13 [2023-11-22 23:53:20,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:20,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:20,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:20,219 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 82 treesize of output 34 [2023-11-22 23:53:20,237 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-11-22 23:53:20,237 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 27 treesize of output 33 [2023-11-22 23:53:20,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 44 [2023-11-22 23:53:20,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:20,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:20,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:20,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:20,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:20,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 54 [2023-11-22 23:53:20,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:20,435 INFO L349 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2023-11-22 23:53:20,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 179 treesize of output 73 [2023-11-22 23:53:20,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:20,452 INFO L349 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2023-11-22 23:53:20,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 30 [2023-11-22 23:53:20,646 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-22 23:53:20,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 167 treesize of output 85 [2023-11-22 23:53:20,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:20,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:20,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:20,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:20,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2023-11-22 23:53:20,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:20,821 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-22 23:53:20,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 122 treesize of output 73 [2023-11-22 23:53:20,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:20,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:20,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:20,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:20,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2023-11-22 23:53:21,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:21,011 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-22 23:53:21,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 98 treesize of output 73 [2023-11-22 23:53:21,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:21,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:21,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:21,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:21,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2023-11-22 23:53:21,099 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:53:21,099 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:53:21,295 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (and (forall ((v_ArrVal_1001 Int)) (or (not (= (select |c_#valid| v_ArrVal_1001) 0)) (forall ((v_ArrVal_1003 Int) (v_ArrVal_1005 Int)) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| v_ArrVal_1001 (store (store (select |c_#memory_$Pointer$.offset| v_ArrVal_1001) 4 .cse9) 0 v_ArrVal_1003)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| v_ArrVal_1001 (store (store (select |c_#memory_$Pointer$.base| v_ArrVal_1001) 4 .cse8) 0 v_ArrVal_1005))) (.cse1 (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse7 (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) v_ArrVal_1001) 4)) (.cse4 (select .cse3 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse5 (select (select (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_1001)) v_ArrVal_1001) 4)) (.cse6 (+ 4 .cse7))) (let ((.cse2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse7)) .cse5) .cse6))) (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse2)) (select (select (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse5)) .cse5) .cse6)) (+ .cse2 4))))))) 0)) (< |c_#StackHeapBarrier| (+ v_ArrVal_1001 1)))) (forall ((v_ArrVal_1001 Int)) (or (forall ((v_ArrVal_1003 Int) (v_ArrVal_1005 Int)) (= (let ((.cse15 (store |c_#memory_$Pointer$.offset| v_ArrVal_1001 (store (store (select |c_#memory_$Pointer$.offset| v_ArrVal_1001) 4 .cse9) 0 v_ArrVal_1003)))) (let ((.cse10 (store |c_#memory_$Pointer$.base| v_ArrVal_1001 (store (store (select |c_#memory_$Pointer$.base| v_ArrVal_1001) 4 .cse8) 0 v_ArrVal_1005))) (.cse16 (select .cse15 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse17 (select (select (store .cse15 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) v_ArrVal_1001) 4)) (.cse11 (select .cse10 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse13 (select (select (store .cse10 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_1001)) v_ArrVal_1001) 4)) (.cse14 (+ 4 .cse17))) (select (let ((.cse12 (select (select (store .cse10 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse13)) .cse13) .cse14))) (select (store .cse10 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse12)) .cse12)) (+ (select (select (store .cse15 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse17)) .cse13) .cse14) 4)))))) 0)) (not (= (select |c_#valid| v_ArrVal_1001) 0)) (< |c_#StackHeapBarrier| (+ v_ArrVal_1001 1)))))) is different from false [2023-11-22 23:53:21,564 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse15 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_75| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_75|) 0)) (forall ((v_ArrVal_994 (Array Int Int))) (or (forall ((v_ArrVal_993 Int) (v_ArrVal_1001 Int)) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_75| 1) v_ArrVal_1001) 0)) (forall ((v_ArrVal_1003 Int) (v_ArrVal_1005 Int)) (= (let ((.cse13 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_75| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_75|) 4 .cse14) 0 v_ArrVal_993)))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_75| v_ArrVal_994)) (.cse11 (store .cse13 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0)))) (let ((.cse12 (store (store (select .cse11 v_ArrVal_1001) 4 0) 0 v_ArrVal_1003)) (.cse8 (store .cse10 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_75|)))) (let ((.cse9 (store (store (select .cse8 v_ArrVal_1001) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_75|) 0 v_ArrVal_1005)) (.cse0 (store .cse13 v_ArrVal_1001 .cse12)) (.cse1 (select (store .cse11 v_ArrVal_1001 .cse12) |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse7 (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) v_ArrVal_1001) 4)) (.cse3 (store .cse10 v_ArrVal_1001 .cse9)) (.cse4 (select (store .cse8 v_ArrVal_1001 .cse9) |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse5 (select (select (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_1001)) v_ArrVal_1001) 4)) (.cse6 (+ .cse7 4))) (let ((.cse2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse7)) .cse5) .cse6))) (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse2)) (select (select (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse5)) .cse5) .cse6)) (+ .cse2 4))))))))) 0)) (< |c_#StackHeapBarrier| (+ v_ArrVal_1001 1)))) (not (= (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_75|) 4 .cse15) 0 (select v_ArrVal_994 0)) v_ArrVal_994)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_list_~node~0#1.base_75| 1)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_75| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_75|) 0)) (forall ((v_ArrVal_994 (Array Int Int))) (or (forall ((v_ArrVal_993 Int) (v_ArrVal_1001 Int)) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_75| 1) v_ArrVal_1001) 0)) (forall ((v_ArrVal_1003 Int) (v_ArrVal_1005 Int)) (= (let ((.cse29 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_75| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_75|) 4 .cse14) 0 v_ArrVal_993)))) (let ((.cse26 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_75| v_ArrVal_994)) (.cse27 (store .cse29 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse29 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0)))) (let ((.cse28 (store (store (select .cse27 v_ArrVal_1001) 4 0) 0 v_ArrVal_1003)) (.cse24 (store .cse26 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse26 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_75|)))) (let ((.cse25 (store (store (select .cse24 v_ArrVal_1001) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_75|) 0 v_ArrVal_1005)) (.cse21 (store .cse29 v_ArrVal_1001 .cse28)) (.cse22 (select (store .cse27 v_ArrVal_1001 .cse28) |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse23 (select (select (store .cse21 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) v_ArrVal_1001) 4)) (.cse16 (store .cse26 v_ArrVal_1001 .cse25)) (.cse17 (select (store .cse24 v_ArrVal_1001 .cse25) |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse19 (select (select (store .cse16 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_1001)) v_ArrVal_1001) 4)) (.cse20 (+ .cse23 4))) (select (let ((.cse18 (select (select (store .cse16 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse19)) .cse19) .cse20))) (select (store .cse16 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse18)) .cse18)) (+ (select (select (store .cse21 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse23)) .cse19) .cse20) 4)))))))) 0)) (< |c_#StackHeapBarrier| (+ v_ArrVal_1001 1)))) (not (= (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_75|) 4 .cse15) 0 (select v_ArrVal_994 0)) v_ArrVal_994)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_list_~node~0#1.base_75| 1)))))) is different from false [2023-11-22 23:53:23,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:53:23,328 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 7211 treesize of output 7252 [2023-11-22 23:53:32,834 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse20 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse21 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (and (forall ((v_ArrVal_988 (Array Int Int)) (v_ArrVal_993 Int) (v_ArrVal_1001 Int) (|v_ULTIMATE.start_append_to_list_~node~0#1.base_75| Int) (v_ArrVal_1003 Int) (v_ArrVal_1005 Int) (v_ArrVal_994 (Array Int Int)) (v_ArrVal_985 Int)) (let ((.cse1 (select v_ArrVal_994 4))) (let ((.cse18 (store |c_#memory_$Pointer$.base| .cse1 (store (store (select |c_#memory_$Pointer$.base| .cse1) 4 .cse21) 0 v_ArrVal_985)))) (let ((.cse0 (store .cse18 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| .cse1)))) (or (not (= v_ArrVal_994 (store (store (select .cse0 |v_ULTIMATE.start_append_to_list_~node~0#1.base_75|) 4 .cse1) 0 (select v_ArrVal_994 0)))) (= (let ((.cse19 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_988))) (let ((.cse16 (store .cse19 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0)))) (let ((.cse17 (store (store (select .cse16 |v_ULTIMATE.start_append_to_list_~node~0#1.base_75|) 4 0) 0 v_ArrVal_993))) (let ((.cse15 (store .cse19 |v_ULTIMATE.start_append_to_list_~node~0#1.base_75| .cse17))) (let ((.cse12 (store .cse18 |v_ULTIMATE.start_append_to_list_~node~0#1.base_75| v_ArrVal_994)) (.cse13 (store .cse15 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select (store .cse16 |v_ULTIMATE.start_append_to_list_~node~0#1.base_75| .cse17) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0)))) (let ((.cse14 (store (store (select .cse13 v_ArrVal_1001) 4 0) 0 v_ArrVal_1003)) (.cse10 (store .cse12 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select (store .cse0 |v_ULTIMATE.start_append_to_list_~node~0#1.base_75| v_ArrVal_994) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_75|)))) (let ((.cse11 (store (store (select .cse10 v_ArrVal_1001) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_75|) 0 v_ArrVal_1005)) (.cse7 (store .cse15 v_ArrVal_1001 .cse14)) (.cse8 (select (store .cse13 v_ArrVal_1001 .cse14) |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse9 (select (select (store .cse7 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) v_ArrVal_1001) 4)) (.cse2 (store .cse12 v_ArrVal_1001 .cse11)) (.cse3 (select (store .cse10 v_ArrVal_1001 .cse11) |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse5 (select (select (store .cse2 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_1001)) v_ArrVal_1001) 4)) (.cse6 (+ .cse9 4))) (select (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse5)) .cse5) .cse6))) (select (store .cse2 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse4)) .cse4)) (+ 4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse9)) .cse5) .cse6)))))))))))) 0) (= .cse1 v_ArrVal_1001) (not (= v_ArrVal_988 (store (store (select |c_#memory_$Pointer$.offset| .cse1) 4 .cse20) 0 (select v_ArrVal_988 0)))) (= |v_ULTIMATE.start_append_to_list_~node~0#1.base_75| .cse1) (= |v_ULTIMATE.start_append_to_list_~node~0#1.base_75| v_ArrVal_1001) (< |c_#StackHeapBarrier| (+ v_ArrVal_1001 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_list_~node~0#1.base_75| 1)) (< |c_#StackHeapBarrier| (+ .cse1 1))))))) (forall ((v_prenex_48 Int) (v_ArrVal_988 (Array Int Int)) (v_prenex_45 Int) (v_prenex_44 Int) (v_prenex_47 Int) (v_prenex_46 Int) (v_prenex_49 (Array Int Int)) (v_ArrVal_985 Int)) (let ((.cse22 (select v_prenex_49 4))) (let ((.cse40 (store |c_#memory_$Pointer$.base| .cse22 (store (store (select |c_#memory_$Pointer$.base| .cse22) 4 .cse21) 0 v_ArrVal_985)))) (let ((.cse23 (store .cse40 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse40 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| .cse22)))) (or (< |c_#StackHeapBarrier| (+ v_prenex_45 1)) (not (= v_ArrVal_988 (store (store (select |c_#memory_$Pointer$.offset| .cse22) 4 .cse20) 0 (select v_ArrVal_988 0)))) (not (= v_prenex_49 (store (store (select .cse23 v_prenex_46) 4 .cse22) 0 (select v_prenex_49 0)))) (= (let ((.cse41 (store |c_#memory_$Pointer$.offset| .cse22 v_ArrVal_988))) (let ((.cse38 (store .cse41 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse41 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0)))) (let ((.cse39 (store (store (select .cse38 v_prenex_46) 4 0) 0 v_prenex_44))) (let ((.cse37 (store .cse41 v_prenex_46 .cse39))) (let ((.cse34 (store .cse40 v_prenex_46 v_prenex_49)) (.cse35 (store .cse37 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select (store .cse38 v_prenex_46 .cse39) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0)))) (let ((.cse36 (store (store (select .cse35 v_prenex_45) 4 0) 0 v_prenex_47)) (.cse32 (store .cse34 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select (store .cse23 v_prenex_46 v_prenex_49) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_prenex_46)))) (let ((.cse33 (store (store (select .cse32 v_prenex_45) 4 v_prenex_46) 0 v_prenex_48)) (.cse24 (store .cse37 v_prenex_45 .cse36)) (.cse25 (select (store .cse35 v_prenex_45 .cse36) |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse31 (select (select (store .cse24 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) v_prenex_45) 4)) (.cse27 (store .cse34 v_prenex_45 .cse33)) (.cse28 (select (store .cse32 v_prenex_45 .cse33) |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse29 (select (select (store .cse27 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#list~0#1.offset| v_prenex_45)) v_prenex_45) 4)) (.cse30 (+ .cse31 4))) (let ((.cse26 (select (select (store .cse24 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse31)) .cse29) .cse30))) (select (select (store .cse24 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse26)) (select (select (store .cse27 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse29)) .cse29) .cse30)) (+ 4 .cse26)))))))))))) 0) (< |c_#StackHeapBarrier| (+ .cse22 1)) (< |c_#StackHeapBarrier| (+ v_prenex_46 1))))))))) is different from false [2023-11-22 23:53:33,631 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2023-11-22 23:53:33,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638914575] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:53:33,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 23:53:33,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2023-11-22 23:53:33,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633490009] [2023-11-22 23:53:33,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 23:53:33,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-22 23:53:33,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:53:33,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-22 23:53:33,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=398, Unknown=3, NotChecked=126, Total=600 [2023-11-22 23:53:33,633 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 25 states, 25 states have (on average 4.2) internal successors, (105), 24 states have internal predecessors, (105), 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 23:53:35,728 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse23 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse21 (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse22 (select .cse23 |c_ULTIMATE.start_main_~#list~0#1.offset|))) (and (= (select .cse0 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (forall ((v_ArrVal_988 (Array Int Int)) (v_ArrVal_993 Int) (v_ArrVal_1001 Int) (|v_ULTIMATE.start_append_to_list_~node~0#1.base_75| Int) (v_ArrVal_1003 Int) (v_ArrVal_1005 Int) (v_ArrVal_994 (Array Int Int)) (v_ArrVal_985 Int)) (let ((.cse2 (select v_ArrVal_994 4))) (let ((.cse19 (store |c_#memory_$Pointer$.base| .cse2 (store (store (select |c_#memory_$Pointer$.base| .cse2) 4 .cse22) 0 v_ArrVal_985)))) (let ((.cse1 (store .cse19 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| .cse2)))) (or (not (= v_ArrVal_994 (store (store (select .cse1 |v_ULTIMATE.start_append_to_list_~node~0#1.base_75|) 4 .cse2) 0 (select v_ArrVal_994 0)))) (= (let ((.cse20 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_988))) (let ((.cse17 (store .cse20 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0)))) (let ((.cse18 (store (store (select .cse17 |v_ULTIMATE.start_append_to_list_~node~0#1.base_75|) 4 0) 0 v_ArrVal_993))) (let ((.cse16 (store .cse20 |v_ULTIMATE.start_append_to_list_~node~0#1.base_75| .cse18))) (let ((.cse13 (store .cse19 |v_ULTIMATE.start_append_to_list_~node~0#1.base_75| v_ArrVal_994)) (.cse14 (store .cse16 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select (store .cse17 |v_ULTIMATE.start_append_to_list_~node~0#1.base_75| .cse18) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0)))) (let ((.cse15 (store (store (select .cse14 v_ArrVal_1001) 4 0) 0 v_ArrVal_1003)) (.cse11 (store .cse13 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select (store .cse1 |v_ULTIMATE.start_append_to_list_~node~0#1.base_75| v_ArrVal_994) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_75|)))) (let ((.cse12 (store (store (select .cse11 v_ArrVal_1001) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_75|) 0 v_ArrVal_1005)) (.cse8 (store .cse16 v_ArrVal_1001 .cse15)) (.cse9 (select (store .cse14 v_ArrVal_1001 .cse15) |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse10 (select (select (store .cse8 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) v_ArrVal_1001) 4)) (.cse3 (store .cse13 v_ArrVal_1001 .cse12)) (.cse4 (select (store .cse11 v_ArrVal_1001 .cse12) |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse6 (select (select (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_1001)) v_ArrVal_1001) 4)) (.cse7 (+ .cse10 4))) (select (let ((.cse5 (select (select (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse6)) .cse6) .cse7))) (select (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse5)) .cse5)) (+ 4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse10)) .cse6) .cse7)))))))))))) 0) (= .cse2 v_ArrVal_1001) (not (= v_ArrVal_988 (store (store (select |c_#memory_$Pointer$.offset| .cse2) 4 .cse21) 0 (select v_ArrVal_988 0)))) (= |v_ULTIMATE.start_append_to_list_~node~0#1.base_75| .cse2) (= |v_ULTIMATE.start_append_to_list_~node~0#1.base_75| v_ArrVal_1001) (< |c_#StackHeapBarrier| (+ v_ArrVal_1001 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_list_~node~0#1.base_75| 1)) (< |c_#StackHeapBarrier| (+ .cse2 1))))))) (= (select .cse23 0) 0) (forall ((v_prenex_48 Int) (v_ArrVal_988 (Array Int Int)) (v_prenex_45 Int) (v_prenex_44 Int) (v_prenex_47 Int) (v_prenex_46 Int) (v_prenex_49 (Array Int Int)) (v_ArrVal_985 Int)) (let ((.cse24 (select v_prenex_49 4))) (let ((.cse42 (store |c_#memory_$Pointer$.base| .cse24 (store (store (select |c_#memory_$Pointer$.base| .cse24) 4 .cse22) 0 v_ArrVal_985)))) (let ((.cse25 (store .cse42 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse42 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| .cse24)))) (or (< |c_#StackHeapBarrier| (+ v_prenex_45 1)) (not (= v_ArrVal_988 (store (store (select |c_#memory_$Pointer$.offset| .cse24) 4 .cse21) 0 (select v_ArrVal_988 0)))) (not (= v_prenex_49 (store (store (select .cse25 v_prenex_46) 4 .cse24) 0 (select v_prenex_49 0)))) (= (let ((.cse43 (store |c_#memory_$Pointer$.offset| .cse24 v_ArrVal_988))) (let ((.cse40 (store .cse43 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse43 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0)))) (let ((.cse41 (store (store (select .cse40 v_prenex_46) 4 0) 0 v_prenex_44))) (let ((.cse39 (store .cse43 v_prenex_46 .cse41))) (let ((.cse36 (store .cse42 v_prenex_46 v_prenex_49)) (.cse37 (store .cse39 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select (store .cse40 v_prenex_46 .cse41) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0)))) (let ((.cse38 (store (store (select .cse37 v_prenex_45) 4 0) 0 v_prenex_47)) (.cse34 (store .cse36 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select (store .cse25 v_prenex_46 v_prenex_49) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_prenex_46)))) (let ((.cse35 (store (store (select .cse34 v_prenex_45) 4 v_prenex_46) 0 v_prenex_48)) (.cse26 (store .cse39 v_prenex_45 .cse38)) (.cse27 (select (store .cse37 v_prenex_45 .cse38) |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse33 (select (select (store .cse26 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) v_prenex_45) 4)) (.cse29 (store .cse36 v_prenex_45 .cse35)) (.cse30 (select (store .cse34 v_prenex_45 .cse35) |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse31 (select (select (store .cse29 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#list~0#1.offset| v_prenex_45)) v_prenex_45) 4)) (.cse32 (+ .cse33 4))) (let ((.cse28 (select (select (store .cse26 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse33)) .cse31) .cse32))) (select (select (store .cse26 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse28)) (select (select (store .cse29 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse31)) .cse31) .cse32)) (+ 4 .cse28)))))))))))) 0) (< |c_#StackHeapBarrier| (+ .cse24 1)) (< |c_#StackHeapBarrier| (+ v_prenex_46 1))))))) (= .cse21 0) (= .cse22 0) (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#list~0#1.base|)))) is different from false [2023-11-22 23:53:36,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:53:36,630 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2023-11-22 23:53:36,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-22 23:53:36,630 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.2) internal successors, (105), 24 states have internal predecessors, (105), 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 23:53:36,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:53:36,632 INFO L225 Difference]: With dead ends: 85 [2023-11-22 23:53:36,632 INFO L226 Difference]: Without dead ends: 61 [2023-11-22 23:53:36,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=92, Invalid=520, Unknown=4, NotChecked=196, Total=812 [2023-11-22 23:53:36,633 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 257 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 23:53:36,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 303 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 257 Unchecked, 0.3s Time] [2023-11-22 23:53:36,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-22 23:53:36,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 46. [2023-11-22 23:53:36,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 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 23:53:36,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2023-11-22 23:53:36,642 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 38 [2023-11-22 23:53:36,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:53:36,642 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2023-11-22 23:53:36,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.2) internal successors, (105), 24 states have internal predecessors, (105), 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 23:53:36,643 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2023-11-22 23:53:36,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-22 23:53:36,643 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:53:36,644 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2023-11-22 23:53:36,660 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 23:53:36,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:53:36,848 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:53:36,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:53:36,849 INFO L85 PathProgramCache]: Analyzing trace with hash -318694338, now seen corresponding path program 1 times [2023-11-22 23:53:36,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:53:36,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294007065] [2023-11-22 23:53:36,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:53:36,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:53:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:53:36,895 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-22 23:53:36,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:53:36,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294007065] [2023-11-22 23:53:36,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294007065] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:53:36,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:53:36,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 23:53:36,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962894371] [2023-11-22 23:53:36,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:53:36,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 23:53:36,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:53:36,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 23:53:36,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 23:53:36,897 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 23:53:36,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:53:36,916 INFO L93 Difference]: Finished difference Result 120 states and 148 transitions. [2023-11-22 23:53:36,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 23:53:36,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 41 [2023-11-22 23:53:36,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:53:36,917 INFO L225 Difference]: With dead ends: 120 [2023-11-22 23:53:36,917 INFO L226 Difference]: Without dead ends: 70 [2023-11-22 23:53:36,918 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 23:53:36,918 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:53:36,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 33 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:53:36,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-22 23:53:36,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 49. [2023-11-22 23:53:36,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 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 23:53:36,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2023-11-22 23:53:36,928 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 41 [2023-11-22 23:53:36,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:53:36,928 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2023-11-22 23:53:36,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 23:53:36,928 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2023-11-22 23:53:36,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-22 23:53:36,929 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:53:36,929 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1] [2023-11-22 23:53:36,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-22 23:53:36,929 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:53:36,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:53:36,930 INFO L85 PathProgramCache]: Analyzing trace with hash -33911742, now seen corresponding path program 6 times [2023-11-22 23:53:36,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:53:36,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350710325] [2023-11-22 23:53:36,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:53:36,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:53:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:53:39,670 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 12 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:53:39,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:53:39,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350710325] [2023-11-22 23:53:39,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350710325] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:53:39,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750965995] [2023-11-22 23:53:39,670 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-22 23:53:39,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:53:39,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:53:39,671 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 23:53:39,672 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 23:53:40,402 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-11-22 23:53:40,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 23:53:40,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 105 conjunts are in the unsatisfiable core [2023-11-22 23:53:40,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:53:40,433 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 23:53:40,437 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 10 treesize of output 9 [2023-11-22 23:53:40,444 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 23:53:40,446 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 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-22 23:53:40,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:40,449 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 23:53:40,517 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-22 23:53:40,526 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 109 treesize of output 31 [2023-11-22 23:53:40,543 INFO L349 Elim1Store]: treesize reduction 50, result has 37.5 percent of original size [2023-11-22 23:53:40,543 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 33 treesize of output 45 [2023-11-22 23:53:40,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:40,556 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 39 treesize of output 21 [2023-11-22 23:53:40,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:40,570 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 73 treesize of output 22 [2023-11-22 23:53:40,736 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-22 23:53:40,743 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-22 23:53:40,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:40,782 INFO L349 Elim1Store]: treesize reduction 71, result has 9.0 percent of original size [2023-11-22 23:53:40,783 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 166 treesize of output 62 [2023-11-22 23:53:40,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:40,806 INFO L349 Elim1Store]: treesize reduction 62, result has 38.0 percent of original size [2023-11-22 23:53:40,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 69 [2023-11-22 23:53:40,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:40,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:40,821 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 43 treesize of output 25 [2023-11-22 23:53:40,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:40,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:40,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:40,843 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 53 treesize of output 40 [2023-11-22 23:53:40,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:40,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:40,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:40,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 45 treesize of output 43 [2023-11-22 23:53:41,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 66 [2023-11-22 23:53:41,085 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 23 treesize of output 11 [2023-11-22 23:53:41,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2023-11-22 23:53:41,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,122 INFO L349 Elim1Store]: treesize reduction 138, result has 7.4 percent of original size [2023-11-22 23:53:41,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 213 treesize of output 142 [2023-11-22 23:53:41,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 141 [2023-11-22 23:53:41,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,153 INFO L349 Elim1Store]: treesize reduction 4, result has 85.7 percent of original size [2023-11-22 23:53:41,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 37 [2023-11-22 23:53:41,161 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 31 treesize of output 1 [2023-11-22 23:53:41,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-22 23:53:41,445 INFO L349 Elim1Store]: treesize reduction 132, result has 14.3 percent of original size [2023-11-22 23:53:41,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 234 treesize of output 100 [2023-11-22 23:53:41,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2023-11-22 23:53:41,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,462 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 30 treesize of output 25 [2023-11-22 23:53:41,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,729 INFO L349 Elim1Store]: treesize reduction 156, result has 12.4 percent of original size [2023-11-22 23:53:41,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 196 treesize of output 113 [2023-11-22 23:53:41,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,735 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 30 treesize of output 25 [2023-11-22 23:53:41,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:41,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2023-11-22 23:53:41,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:42,012 INFO L349 Elim1Store]: treesize reduction 160, result has 10.1 percent of original size [2023-11-22 23:53:42,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 200 treesize of output 109 [2023-11-22 23:53:42,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:42,017 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 23:53:42,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:42,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:42,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:42,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:42,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:42,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:42,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2023-11-22 23:53:42,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:53:42,213 INFO L349 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2023-11-22 23:53:42,213 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 137 treesize of output 79 [2023-11-22 23:53:42,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2023-11-22 23:53:42,224 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 12 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:53:42,224 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:53:42,249 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1318 (Array Int Int))) (< (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_1318) (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) (+ |c_ULTIMATE.start_main_~base~0#1| 100))) is different from false [2023-11-22 23:53:42,261 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1318 (Array Int Int))) (< (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse5 (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse6 (+ (select .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6)) (.cse2 (+ 4 .cse4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_1318) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse1)) .cse1) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse4)) .cse1) .cse2)))))) (+ |c_ULTIMATE.start_main_~base~0#1| 100))) is different from false [2023-11-22 23:53:42,277 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1318 (Array Int Int))) (< (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse8 (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse9 (+ (select .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse8) .cse9)) (.cse6 (+ 4 .cse7))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse7)) .cse5) .cse6))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse5)) .cse5) .cse6)) (.cse2 (+ .cse4 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_1318) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse1)) .cse1) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse4)) .cse1) .cse2)))))))) (+ |c_ULTIMATE.start_main_~base~0#1| 100))) is different from false [2023-11-22 23:53:54,325 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1318 (Array Int Int)) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1304 (Array Int Int)) (v_ArrVal_1301 Int) (v_ArrVal_1310 (Array Int Int)) (v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1293 (Array Int Int)) (|v_ULTIMATE.start_append_to_list_~node~0#1.base_94| Int)) (let ((.cse0 (select v_ArrVal_1304 4))) (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse0 (store (store (select |c_#memory_$Pointer$.base| .cse0) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_1301))) (.cse14 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1294))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0))) (.cse11 (store .cse12 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| .cse0)))) (or (not (= 0 (select (store |c_#valid| .cse0 1) |v_ULTIMATE.start_append_to_list_~node~0#1.base_94|))) (< (let ((.cse5 (store .cse14 |v_ULTIMATE.start_append_to_list_~node~0#1.base_94| v_ArrVal_1305)) (.cse6 (select (store .cse13 |v_ULTIMATE.start_append_to_list_~node~0#1.base_94| v_ArrVal_1305) |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse10 (select (select (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) |v_ULTIMATE.start_append_to_list_~node~0#1.base_94|) 4)) (.cse1 (store .cse12 |v_ULTIMATE.start_append_to_list_~node~0#1.base_94| v_ArrVal_1304)) (.cse2 (select (store .cse11 |v_ULTIMATE.start_append_to_list_~node~0#1.base_94| v_ArrVal_1304) |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse8 (select (select (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#list~0#1.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_94|)) |v_ULTIMATE.start_append_to_list_~node~0#1.base_94|) 4)) (.cse9 (+ .cse10 4))) (let ((.cse7 (select (select (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse10)) .cse8) .cse9))) (let ((.cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse8)) .cse8) .cse9)) (.cse4 (+ .cse7 4))) (select (select (store (store (store |c_#memory_int| .cse0 v_ArrVal_1293) |v_ULTIMATE.start_append_to_list_~node~0#1.base_94| v_ArrVal_1310) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_1318) (select (select (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse3)) .cse3) .cse4)) (select (select (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse7)) .cse3) .cse4))))))) (+ |c_ULTIMATE.start_main_~base~0#1| 100)) (not (= (store (store (select .cse13 |v_ULTIMATE.start_append_to_list_~node~0#1.base_94|) 4 0) 0 (select v_ArrVal_1305 0)) v_ArrVal_1305)) (< |c_#StackHeapBarrier| (+ .cse0 1)) (not (= v_ArrVal_1294 (store (store (select |c_#memory_$Pointer$.offset| .cse0) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 (select v_ArrVal_1294 0)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_list_~node~0#1.base_94| 1)) (not (= (select |c_#valid| .cse0) 0)) (not (= v_ArrVal_1304 (store (store (select .cse11 |v_ULTIMATE.start_append_to_list_~node~0#1.base_94|) 4 .cse0) 0 (select v_ArrVal_1304 0))))))))) is different from false [2023-11-22 23:55:15,512 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-22 23:55:15,513 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-22 23:55:15,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2023-11-22 23:55:15,526 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 23:55:15,713 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,SelfDestructingSolverStorable12 [2023-11-22 23:55:15,714 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:845) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:579) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2023-11-22 23:55:15,718 INFO L158 Benchmark]: Toolchain (without parser) took 171523.80ms. Allocated memory was 159.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 129.2MB in the beginning and 818.7MB in the end (delta: -689.5MB). Peak memory consumption was 389.7MB. Max. memory is 16.1GB. [2023-11-22 23:55:15,718 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 79.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 23:55:15,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.93ms. Allocated memory is still 159.4MB. Free memory was 128.2MB in the beginning and 111.6MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-22 23:55:15,719 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.05ms. Allocated memory is still 159.4MB. Free memory was 111.6MB in the beginning and 109.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 23:55:15,719 INFO L158 Benchmark]: Boogie Preprocessor took 52.10ms. Allocated memory is still 159.4MB. Free memory was 109.5MB in the beginning and 108.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 23:55:15,719 INFO L158 Benchmark]: RCFGBuilder took 416.78ms. Allocated memory is still 159.4MB. Free memory was 108.4MB in the beginning and 122.5MB in the end (delta: -14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-22 23:55:15,719 INFO L158 Benchmark]: TraceAbstraction took 170597.38ms. Allocated memory was 159.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 122.5MB in the beginning and 818.7MB in the end (delta: -696.3MB). Peak memory consumption was 386.9MB. Max. memory is 16.1GB. [2023-11-22 23:55:15,720 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 79.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.93ms. Allocated memory is still 159.4MB. Free memory was 128.2MB in the beginning and 111.6MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.05ms. Allocated memory is still 159.4MB. Free memory was 111.6MB in the beginning and 109.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.10ms. Allocated memory is still 159.4MB. Free memory was 109.5MB in the beginning and 108.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 416.78ms. Allocated memory is still 159.4MB. Free memory was 108.4MB in the beginning and 122.5MB in the end (delta: -14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 170597.38ms. Allocated memory was 159.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 122.5MB in the beginning and 818.7MB in the end (delta: -696.3MB). Peak memory consumption was 386.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hash_fun.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 0abab60f5c601fd8191c1a2aa712d4ab55460e987c7d41ca7527c2934792cc0b --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 23:55:17,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 23:55:17,821 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-22 23:55:17,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 23:55:17,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 23:55:17,866 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 23:55:17,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 23:55:17,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 23:55:17,868 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 23:55:17,871 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 23:55:17,872 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 23:55:17,872 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 23:55:17,872 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 23:55:17,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 23:55:17,874 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 23:55:17,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 23:55:17,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 23:55:17,875 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 23:55:17,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 23:55:17,876 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 23:55:17,876 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 23:55:17,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 23:55:17,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 23:55:17,877 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 23:55:17,878 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-22 23:55:17,878 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-22 23:55:17,878 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 23:55:17,878 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 23:55:17,879 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 23:55:17,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 23:55:17,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 23:55:17,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 23:55:17,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 23:55:17,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 23:55:17,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 23:55:17,881 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 23:55:17,882 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 23:55:17,882 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-22 23:55:17,883 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-22 23:55:17,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 23:55:17,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 23:55:17,883 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 23:55:17,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 23:55:17,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 23:55:17,884 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-22 23:55:17,884 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 -> 0abab60f5c601fd8191c1a2aa712d4ab55460e987c7d41ca7527c2934792cc0b Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 23:55:18,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 23:55:18,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 23:55:18,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 23:55:18,258 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 23:55:18,258 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 23:55:18,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/hash_fun.i [2023-11-22 23:55:19,416 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 23:55:19,661 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 23:55:19,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/hash_fun.i [2023-11-22 23:55:19,683 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bcf27040/fdb12574b91a4fd8aa78aaff2fa2beeb/FLAG2086a51bc [2023-11-22 23:55:19,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bcf27040/fdb12574b91a4fd8aa78aaff2fa2beeb [2023-11-22 23:55:19,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 23:55:19,696 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 23:55:19,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 23:55:19,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 23:55:19,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 23:55:19,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:55:19" (1/1) ... [2023-11-22 23:55:19,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fcd098c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:19, skipping insertion in model container [2023-11-22 23:55:19,705 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:55:19" (1/1) ... [2023-11-22 23:55:19,747 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 23:55:20,059 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/hash_fun.i[23732,23745] [2023-11-22 23:55:20,064 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 23:55:20,078 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 23:55:20,116 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/hash_fun.i[23732,23745] [2023-11-22 23:55:20,125 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 23:55:20,164 INFO L206 MainTranslator]: Completed translation [2023-11-22 23:55:20,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:20 WrapperNode [2023-11-22 23:55:20,165 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 23:55:20,166 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 23:55:20,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 23:55:20,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 23:55:20,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:20" (1/1) ... [2023-11-22 23:55:20,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:20" (1/1) ... [2023-11-22 23:55:20,229 INFO L138 Inliner]: procedures = 128, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2023-11-22 23:55:20,230 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 23:55:20,231 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 23:55:20,231 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 23:55:20,231 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 23:55:20,239 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:20" (1/1) ... [2023-11-22 23:55:20,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:20" (1/1) ... [2023-11-22 23:55:20,246 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:20" (1/1) ... [2023-11-22 23:55:20,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:20" (1/1) ... [2023-11-22 23:55:20,262 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:20" (1/1) ... [2023-11-22 23:55:20,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:20" (1/1) ... [2023-11-22 23:55:20,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:20" (1/1) ... [2023-11-22 23:55:20,282 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:20" (1/1) ... [2023-11-22 23:55:20,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 23:55:20,291 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 23:55:20,291 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 23:55:20,292 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 23:55:20,292 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:20" (1/1) ... [2023-11-22 23:55:20,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 23:55:20,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:55:20,325 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 23:55:20,353 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 23:55:20,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-22 23:55:20,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 23:55:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 23:55:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 23:55:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-22 23:55:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-22 23:55:20,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 23:55:20,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-22 23:55:20,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-22 23:55:20,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-22 23:55:20,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 23:55:20,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 23:55:20,525 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 23:55:20,527 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 23:55:20,806 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 23:55:20,871 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 23:55:20,872 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-22 23:55:20,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:55:20 BoogieIcfgContainer [2023-11-22 23:55:20,874 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 23:55:20,876 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 23:55:20,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 23:55:20,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 23:55:20,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:55:19" (1/3) ... [2023-11-22 23:55:20,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af29859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:55:20, skipping insertion in model container [2023-11-22 23:55:20,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:20" (2/3) ... [2023-11-22 23:55:20,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af29859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:55:20, skipping insertion in model container [2023-11-22 23:55:20,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:55:20" (3/3) ... [2023-11-22 23:55:20,883 INFO L112 eAbstractionObserver]: Analyzing ICFG hash_fun.i [2023-11-22 23:55:20,899 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 23:55:20,900 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 23:55:20,947 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 23:55:20,953 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;@2ffe4724, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 23:55:20,953 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 23:55:20,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 23:55:20,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-22 23:55:20,962 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:55:20,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:55:20,963 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:55:20,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:55:20,970 INFO L85 PathProgramCache]: Analyzing trace with hash 223023209, now seen corresponding path program 1 times [2023-11-22 23:55:20,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 23:55:20,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440092683] [2023-11-22 23:55:20,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:55:20,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 23:55:20,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 23:55:20,987 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 23:55:21,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-22 23:55:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:21,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-22 23:55:21,084 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:55:21,100 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 23:55:21,100 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:55:21,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 23:55:21,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440092683] [2023-11-22 23:55:21,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440092683] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:55:21,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:55:21,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 23:55:21,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288212407] [2023-11-22 23:55:21,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:55:21,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 23:55:21,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 23:55:21,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 23:55:21,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 23:55:21,162 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 23:55:21,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:55:21,248 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2023-11-22 23:55:21,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 23:55:21,250 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2023-11-22 23:55:21,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:55:21,256 INFO L225 Difference]: With dead ends: 24 [2023-11-22 23:55:21,257 INFO L226 Difference]: Without dead ends: 13 [2023-11-22 23:55:21,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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 23:55:21,262 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:55:21,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:55:21,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-11-22 23:55:21,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-11-22 23:55:21,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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 23:55:21,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2023-11-22 23:55:21,287 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 7 [2023-11-22 23:55:21,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:55:21,287 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2023-11-22 23:55:21,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 23:55:21,288 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2023-11-22 23:55:21,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-22 23:55:21,288 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:55:21,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:55:21,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-22 23:55:21,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 23:55:21,493 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:55:21,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:55:21,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2044429669, now seen corresponding path program 1 times [2023-11-22 23:55:21,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 23:55:21,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698541097] [2023-11-22 23:55:21,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:55:21,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 23:55:21,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 23:55:21,535 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 23:55:21,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-22 23:55:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:21,611 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 23:55:21,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:55:21,723 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 23:55:21,723 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 23:55:21,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 23:55:21,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698541097] [2023-11-22 23:55:21,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1698541097] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:55:21,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:55:21,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 23:55:21,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740106492] [2023-11-22 23:55:21,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:55:21,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 23:55:21,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 23:55:21,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 23:55:21,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 23:55:21,731 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 23:55:21,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:55:21,864 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2023-11-22 23:55:21,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 23:55:21,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 23:55:21,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:55:21,865 INFO L225 Difference]: With dead ends: 27 [2023-11-22 23:55:21,865 INFO L226 Difference]: Without dead ends: 18 [2023-11-22 23:55:21,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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 23:55:21,867 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:55:21,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 37 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:55:21,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-22 23:55:21,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-22 23:55:21,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 23:55:21,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2023-11-22 23:55:21,871 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 8 [2023-11-22 23:55:21,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:55:21,871 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2023-11-22 23:55:21,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 23:55:21,872 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2023-11-22 23:55:21,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-22 23:55:21,872 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:55:21,872 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:55:21,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-22 23:55:22,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 23:55:22,077 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:55:22,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:55:22,078 INFO L85 PathProgramCache]: Analyzing trace with hash 32114, now seen corresponding path program 1 times [2023-11-22 23:55:22,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 23:55:22,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768050664] [2023-11-22 23:55:22,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:55:22,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 23:55:22,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 23:55:22,087 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 23:55:22,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-22 23:55:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:22,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-22 23:55:22,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:55:22,206 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 7 [2023-11-22 23:55:22,258 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 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-22 23:55:22,285 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-22 23:55:22,286 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 33 treesize of output 30 [2023-11-22 23:55:22,297 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 13 treesize of output 9 [2023-11-22 23:55:22,336 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-22 23:55:22,336 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 17 treesize of output 17 [2023-11-22 23:55:22,347 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 23:55:22,357 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 23:55:22,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:55:22,652 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:55:22,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:55:22,793 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 40 treesize of output 32 [2023-11-22 23:55:22,799 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 68 treesize of output 52 [2023-11-22 23:55:22,813 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 14 treesize of output 10 [2023-11-22 23:55:22,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:55:22,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 23:55:22,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768050664] [2023-11-22 23:55:22,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1768050664] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:55:22,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:55:22,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-11-22 23:55:22,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829314012] [2023-11-22 23:55:22,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 23:55:22,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-22 23:55:22,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 23:55:22,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-22 23:55:22,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-22 23:55:22,890 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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 23:55:23,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:55:23,534 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2023-11-22 23:55:23,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 23:55:23,534 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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) Word has length 13 [2023-11-22 23:55:23,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:55:23,535 INFO L225 Difference]: With dead ends: 43 [2023-11-22 23:55:23,535 INFO L226 Difference]: Without dead ends: 26 [2023-11-22 23:55:23,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2023-11-22 23:55:23,537 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 43 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-22 23:55:23,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 43 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-22 23:55:23,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-22 23:55:23,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2023-11-22 23:55:23,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 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 23:55:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-11-22 23:55:23,543 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 13 [2023-11-22 23:55:23,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:55:23,543 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-11-22 23:55:23,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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 23:55:23,543 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-11-22 23:55:23,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-22 23:55:23,544 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:55:23,544 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:55:23,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-22 23:55:23,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 23:55:23,748 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:55:23,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:55:23,748 INFO L85 PathProgramCache]: Analyzing trace with hash -293740875, now seen corresponding path program 1 times [2023-11-22 23:55:23,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 23:55:23,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368834069] [2023-11-22 23:55:23,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:55:23,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 23:55:23,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 23:55:23,764 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 23:55:23,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-22 23:55:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:55:23,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-22 23:55:23,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:55:23,888 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 7 [2023-11-22 23:55:23,981 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-22 23:55:23,981 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 17 treesize of output 17 [2023-11-22 23:55:23,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:55:23,992 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 47 treesize of output 38 [2023-11-22 23:55:23,996 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 18 treesize of output 3 [2023-11-22 23:55:24,006 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 23 treesize of output 11 [2023-11-22 23:55:24,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:55:24,016 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 43 treesize of output 34 [2023-11-22 23:55:24,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-22 23:55:24,035 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 23 treesize of output 11 [2023-11-22 23:55:24,175 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-22 23:55:24,175 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 42 treesize of output 32 [2023-11-22 23:55:24,186 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 26 treesize of output 21 [2023-11-22 23:55:24,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:55:24,249 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:55:30,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:55:30,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 23:55:30,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368834069] [2023-11-22 23:55:30,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368834069] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:55:30,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:55:30,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-22 23:55:30,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231535166] [2023-11-22 23:55:30,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 23:55:30,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 23:55:30,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 23:55:30,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 23:55:30,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-22 23:55:30,552 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 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 23:55:32,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 23:55:34,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:55:34,172 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2023-11-22 23:55:34,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 23:55:34,173 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 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) Word has length 18 [2023-11-22 23:55:34,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:55:34,174 INFO L225 Difference]: With dead ends: 44 [2023-11-22 23:55:34,174 INFO L226 Difference]: Without dead ends: 30 [2023-11-22 23:55:34,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-22 23:55:34,175 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-22 23:55:34,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 70 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2023-11-22 23:55:34,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-22 23:55:34,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-22 23:55:34,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 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 23:55:34,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-11-22 23:55:34,181 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 18 [2023-11-22 23:55:34,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:55:34,181 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-11-22 23:55:34,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 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 23:55:34,181 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-11-22 23:55:34,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-22 23:55:34,182 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:55:34,182 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-22 23:55:34,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-22 23:55:34,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 23:55:34,387 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:55:34,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:55:34,388 INFO L85 PathProgramCache]: Analyzing trace with hash 879356546, now seen corresponding path program 2 times [2023-11-22 23:55:34,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 23:55:34,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213662523] [2023-11-22 23:55:34,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 23:55:34,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 23:55:34,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 23:55:34,390 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 23:55:34,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-22 23:55:34,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 23:55:34,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 23:55:34,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-22 23:55:34,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:55:34,598 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 7 [2023-11-22 23:55:35,311 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2023-11-22 23:55:35,311 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 27 treesize of output 35 [2023-11-22 23:55:35,425 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 23:55:35,482 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 23:55:35,571 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 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-22 23:55:35,603 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 33 treesize of output 22 [2023-11-22 23:55:36,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:55:36,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:55:36,898 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 43 treesize of output 34 [2023-11-22 23:55:36,919 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 20 treesize of output 1 [2023-11-22 23:55:36,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:55:36,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:55:36,979 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 87 treesize of output 70 [2023-11-22 23:55:37,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 51 [2023-11-22 23:55:37,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 1 [2023-11-22 23:55:37,358 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2023-11-22 23:55:37,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 32 treesize of output 38 [2023-11-22 23:55:37,513 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-22 23:55:37,551 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 73 treesize of output 22 [2023-11-22 23:55:39,863 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-22 23:55:39,863 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 98 treesize of output 52 [2023-11-22 23:55:39,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:55:39,925 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 26 treesize of output 21 [2023-11-22 23:55:40,089 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 33 treesize of output 22 [2023-11-22 23:55:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:55:41,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:55:42,182 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_131) (select (select |c_#memory_$Pointer$.base| .cse1) .cse2)) (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2))))) (or (bvslt .cse0 (bvadd (_ bv100 32) |c_ULTIMATE.start_main_~base~0#1|)) (not (bvsge .cse0 |c_ULTIMATE.start_main_~base~0#1|))))) is different from false [2023-11-22 23:55:42,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:55:42,617 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 156 treesize of output 156 [2023-11-22 23:55:46,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:55:46,787 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 113 treesize of output 112 [2023-11-22 23:55:47,165 INFO L349 Elim1Store]: treesize reduction 61, result has 38.4 percent of original size [2023-11-22 23:55:47,165 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 510 treesize of output 446 [2023-11-22 23:55:47,704 INFO L349 Elim1Store]: treesize reduction 58, result has 30.1 percent of original size [2023-11-22 23:55:47,705 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 3 case distinctions, treesize of input 377 treesize of output 320 [2023-11-22 23:55:47,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:55:47,899 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 312 treesize of output 310 [2023-11-22 23:55:48,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:55:48,046 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 290 treesize of output 285 [2023-11-22 23:55:48,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:55:48,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 379 treesize of output 309 [2023-11-22 23:55:48,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:55:48,308 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 414 treesize of output 404 [2023-11-22 23:55:48,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:55:48,551 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 147 treesize of output 152 [2023-11-22 23:55:48,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:55:48,831 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 45 treesize of output 47 [2023-11-22 23:55:49,673 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 56 treesize of output 48 [2023-11-22 23:55:51,432 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 9 not checked. [2023-11-22 23:55:51,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 23:55:51,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213662523] [2023-11-22 23:55:51,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1213662523] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:55:51,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:55:51,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2023-11-22 23:55:51,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926275718] [2023-11-22 23:55:51,433 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 23:55:51,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-22 23:55:51,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 23:55:51,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-22 23:55:51,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=158, Unknown=7, NotChecked=26, Total=240 [2023-11-22 23:55:51,434 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 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 23:55:57,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:55:57,447 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2023-11-22 23:55:57,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 23:55:57,447 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 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 23:55:57,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:55:57,448 INFO L225 Difference]: With dead ends: 43 [2023-11-22 23:55:57,448 INFO L226 Difference]: Without dead ends: 36 [2023-11-22 23:55:57,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=122, Invalid=295, Unknown=7, NotChecked=38, Total=462 [2023-11-22 23:55:57,449 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 43 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-22 23:55:57,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 74 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 126 Invalid, 0 Unknown, 33 Unchecked, 3.5s Time] [2023-11-22 23:55:57,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-22 23:55:57,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2023-11-22 23:55:57,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 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 23:55:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2023-11-22 23:55:57,459 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 23 [2023-11-22 23:55:57,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:55:57,459 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2023-11-22 23:55:57,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 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 23:55:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2023-11-22 23:55:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-22 23:55:57,460 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:55:57,460 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2023-11-22 23:55:57,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-22 23:55:57,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 23:55:57,665 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:55:57,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:55:57,665 INFO L85 PathProgramCache]: Analyzing trace with hash 792599461, now seen corresponding path program 3 times [2023-11-22 23:55:57,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 23:55:57,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268433786] [2023-11-22 23:55:57,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 23:55:57,666 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 23:55:57,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 23:55:57,667 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 23:55:57,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-22 23:55:57,881 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-22 23:55:57,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 23:55:57,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-22 23:55:57,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:55:57,915 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 7 [2023-11-22 23:55:58,671 INFO L349 Elim1Store]: treesize reduction 57, result has 28.7 percent of original size [2023-11-22 23:55:58,672 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 2 case distinctions, treesize of input 77 treesize of output 27 [2023-11-22 23:55:58,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:55:58,824 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 55 treesize of output 15 [2023-11-22 23:55:59,059 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2023-11-22 23:55:59,059 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 27 treesize of output 35 [2023-11-22 23:55:59,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:55:59,162 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 43 treesize of output 34 [2023-11-22 23:55:59,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-22 23:55:59,280 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 23 treesize of output 11 [2023-11-22 23:56:00,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:56:00,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:56:00,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:56:00,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 54 treesize of output 48 [2023-11-22 23:56:00,126 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 23 treesize of output 11 [2023-11-22 23:56:00,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:56:00,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:56:00,313 INFO L349 Elim1Store]: treesize reduction 66, result has 7.0 percent of original size [2023-11-22 23:56:00,313 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 74 [2023-11-22 23:56:00,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 49 [2023-11-22 23:56:00,535 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2023-11-22 23:56:00,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 32 treesize of output 38 [2023-11-22 23:56:00,631 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 0 case distinctions, treesize of input 31 treesize of output 1 [2023-11-22 23:56:00,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-22 23:56:02,313 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2023-11-22 23:56:02,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 96 treesize of output 56 [2023-11-22 23:56:02,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:56:02,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 37 treesize of output 35 [2023-11-22 23:56:03,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:56:03,715 INFO L349 Elim1Store]: treesize reduction 100, result has 9.9 percent of original size [2023-11-22 23:56:03,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 67 [2023-11-22 23:56:03,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:56:03,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 37 treesize of output 35 [2023-11-22 23:56:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:56:04,364 INFO L327 TraceCheckSpWp]: Computing backward predicates... Killed by 15