./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety-ext2/length_test03-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/memsafety-ext2/length_test03-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e9221de91e231efa38b63f264828813e89f68c8ac306a629b3513c0e7bf1ed0 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 16:40:59,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 16:40:59,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-22 16:40:59,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 16:40:59,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 16:40:59,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 16:40:59,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 16:40:59,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 16:40:59,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 16:40:59,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 16:40:59,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 16:40:59,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 16:40:59,454 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 16:40:59,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 16:40:59,454 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 16:40:59,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 16:40:59,455 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 16:40:59,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 16:40:59,455 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-22 16:40:59,456 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-22 16:40:59,456 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-22 16:40:59,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 16:40:59,456 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 16:40:59,457 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-22 16:40:59,457 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 16:40:59,457 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 16:40:59,457 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 16:40:59,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 16:40:59,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 16:40:59,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 16:40:59,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 16:40:59,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 16:40:59,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 16:40:59,459 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 16:40:59,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 16:40:59,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 16:40:59,460 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 16:40:59,460 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 16:40:59,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 16:40:59,460 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 6e9221de91e231efa38b63f264828813e89f68c8ac306a629b3513c0e7bf1ed0 [2023-11-22 16:40:59,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 16:40:59,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 16:40:59,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 16:40:59,634 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 16:40:59,634 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 16:40:59,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/length_test03-1.i [2023-11-22 16:41:00,746 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 16:41:00,974 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 16:41:00,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety-ext2/length_test03-1.i [2023-11-22 16:41:00,996 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d41902a84/3ca39c9b3f2a4a0f81ac848325684831/FLAG3982dc21f [2023-11-22 16:41:01,008 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d41902a84/3ca39c9b3f2a4a0f81ac848325684831 [2023-11-22 16:41:01,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 16:41:01,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 16:41:01,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 16:41:01,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 16:41:01,018 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 16:41:01,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:41:01" (1/1) ... [2023-11-22 16:41:01,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5246f860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:01, skipping insertion in model container [2023-11-22 16:41:01,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:41:01" (1/1) ... [2023-11-22 16:41:01,081 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 16:41:01,341 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 16:41:01,351 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 16:41:01,401 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 16:41:01,427 INFO L206 MainTranslator]: Completed translation [2023-11-22 16:41:01,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:01 WrapperNode [2023-11-22 16:41:01,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 16:41:01,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 16:41:01,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 16:41:01,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 16:41:01,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:01" (1/1) ... [2023-11-22 16:41:01,459 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:01" (1/1) ... [2023-11-22 16:41:01,483 INFO L138 Inliner]: procedures = 123, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 102 [2023-11-22 16:41:01,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 16:41:01,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 16:41:01,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 16:41:01,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 16:41:01,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:01" (1/1) ... [2023-11-22 16:41:01,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:01" (1/1) ... [2023-11-22 16:41:01,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:01" (1/1) ... [2023-11-22 16:41:01,506 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:01" (1/1) ... [2023-11-22 16:41:01,515 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:01" (1/1) ... [2023-11-22 16:41:01,523 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:01" (1/1) ... [2023-11-22 16:41:01,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:01" (1/1) ... [2023-11-22 16:41:01,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:01" (1/1) ... [2023-11-22 16:41:01,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 16:41:01,535 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 16:41:01,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 16:41:01,536 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 16:41:01,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:01" (1/1) ... [2023-11-22 16:41:01,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 16:41:01,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 16:41:01,572 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 16:41:01,606 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 16:41:01,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-22 16:41:01,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 16:41:01,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 16:41:01,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-22 16:41:01,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-22 16:41:01,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 16:41:01,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-22 16:41:01,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 16:41:01,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 16:41:01,664 INFO L130 BoogieDeclarations]: Found specification of procedure append [2023-11-22 16:41:01,664 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2023-11-22 16:41:01,729 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 16:41:01,730 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 16:41:02,084 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 16:41:02,114 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 16:41:02,114 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-22 16:41:02,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:41:02 BoogieIcfgContainer [2023-11-22 16:41:02,114 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 16:41:02,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 16:41:02,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 16:41:02,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 16:41:02,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 04:41:01" (1/3) ... [2023-11-22 16:41:02,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611087c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:41:02, skipping insertion in model container [2023-11-22 16:41:02,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:01" (2/3) ... [2023-11-22 16:41:02,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611087c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:41:02, skipping insertion in model container [2023-11-22 16:41:02,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:41:02" (3/3) ... [2023-11-22 16:41:02,123 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03-1.i [2023-11-22 16:41:02,136 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 16:41:02,137 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2023-11-22 16:41:02,180 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 16:41:02,186 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@6e3ced6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 16:41:02,186 INFO L358 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2023-11-22 16:41:02,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 51 states have (on average 2.3529411764705883) internal successors, (120), 110 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 16:41:02,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-22 16:41:02,194 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:41:02,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-22 16:41:02,197 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-22 16:41:02,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:41:02,202 INFO L85 PathProgramCache]: Analyzing trace with hash 7010, now seen corresponding path program 1 times [2023-11-22 16:41:02,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:41:02,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208461359] [2023-11-22 16:41:02,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:41:02,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:41:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:02,340 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 16:41:02,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:41:02,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208461359] [2023-11-22 16:41:02,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208461359] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:41:02,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:41:02,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-22 16:41:02,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105646819] [2023-11-22 16:41:02,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:41:02,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 16:41:02,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:41:02,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 16:41:02,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 16:41:02,444 INFO L87 Difference]: Start difference. First operand has 114 states, 51 states have (on average 2.3529411764705883) internal successors, (120), 110 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 16:41:02,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:41:02,570 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2023-11-22 16:41:02,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 16:41:02,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-22 16:41:02,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:41:02,578 INFO L225 Difference]: With dead ends: 147 [2023-11-22 16:41:02,578 INFO L226 Difference]: Without dead ends: 146 [2023-11-22 16:41:02,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 16:41:02,582 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 45 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:41:02,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 137 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:41:02,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-22 16:41:02,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 111. [2023-11-22 16:41:02,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 51 states have (on average 2.215686274509804) internal successors, (113), 107 states have internal predecessors, (113), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 16:41:02,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2023-11-22 16:41:02,612 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 2 [2023-11-22 16:41:02,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:41:02,613 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2023-11-22 16:41:02,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 16:41:02,613 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2023-11-22 16:41:02,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-22 16:41:02,613 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:41:02,613 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-22 16:41:02,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 16:41:02,614 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-22 16:41:02,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:41:02,615 INFO L85 PathProgramCache]: Analyzing trace with hash 7011, now seen corresponding path program 1 times [2023-11-22 16:41:02,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:41:02,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516668997] [2023-11-22 16:41:02,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:41:02,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:41:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:02,679 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 16:41:02,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:41:02,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516668997] [2023-11-22 16:41:02,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516668997] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:41:02,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:41:02,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-22 16:41:02,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427551290] [2023-11-22 16:41:02,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:41:02,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 16:41:02,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:41:02,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 16:41:02,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 16:41:02,682 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 16:41:02,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:41:02,746 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2023-11-22 16:41:02,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 16:41:02,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-22 16:41:02,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:41:02,747 INFO L225 Difference]: With dead ends: 111 [2023-11-22 16:41:02,747 INFO L226 Difference]: Without dead ends: 111 [2023-11-22 16:41:02,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 16:41:02,749 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 8 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:41:02,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 152 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:41:02,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-22 16:41:02,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2023-11-22 16:41:02,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 51 states have (on average 2.176470588235294) internal successors, (111), 105 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 16:41:02,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2023-11-22 16:41:02,756 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 2 [2023-11-22 16:41:02,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:41:02,756 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2023-11-22 16:41:02,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 16:41:02,756 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2023-11-22 16:41:02,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-22 16:41:02,757 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:41:02,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-22 16:41:02,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 16:41:02,757 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-22 16:41:02,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:41:02,758 INFO L85 PathProgramCache]: Analyzing trace with hash 6741643, now seen corresponding path program 1 times [2023-11-22 16:41:02,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:41:02,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128533790] [2023-11-22 16:41:02,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:41:02,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:41:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:02,845 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 16:41:02,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:41:02,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128533790] [2023-11-22 16:41:02,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128533790] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:41:02,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:41:02,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 16:41:02,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207735978] [2023-11-22 16:41:02,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:41:02,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 16:41:02,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:41:02,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 16:41:02,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 16:41:02,849 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 16:41:02,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:41:02,924 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2023-11-22 16:41:02,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 16:41:02,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2023-11-22 16:41:02,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:41:02,927 INFO L225 Difference]: With dead ends: 125 [2023-11-22 16:41:02,927 INFO L226 Difference]: Without dead ends: 125 [2023-11-22 16:41:02,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 16:41:02,934 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 23 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:41:02,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 140 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:41:02,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-22 16:41:02,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 112. [2023-11-22 16:41:02,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 108 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 16:41:02,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2023-11-22 16:41:02,951 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 4 [2023-11-22 16:41:02,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:41:02,951 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2023-11-22 16:41:02,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 16:41:02,964 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2023-11-22 16:41:02,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-22 16:41:02,964 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:41:02,964 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-22 16:41:02,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 16:41:02,965 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-22 16:41:02,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:41:02,965 INFO L85 PathProgramCache]: Analyzing trace with hash 6741644, now seen corresponding path program 1 times [2023-11-22 16:41:02,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:41:02,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078111636] [2023-11-22 16:41:02,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:41:02,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:41:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:03,038 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 16:41:03,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:41:03,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078111636] [2023-11-22 16:41:03,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078111636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:41:03,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:41:03,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 16:41:03,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623031431] [2023-11-22 16:41:03,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:41:03,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 16:41:03,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:41:03,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 16:41:03,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 16:41:03,040 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 16:41:03,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:41:03,112 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2023-11-22 16:41:03,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 16:41:03,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2023-11-22 16:41:03,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:41:03,113 INFO L225 Difference]: With dead ends: 112 [2023-11-22 16:41:03,113 INFO L226 Difference]: Without dead ends: 112 [2023-11-22 16:41:03,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 16:41:03,121 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:41:03,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 151 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:41:03,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-22 16:41:03,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2023-11-22 16:41:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 56 states have (on average 2.0535714285714284) internal successors, (115), 106 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 16:41:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2023-11-22 16:41:03,133 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 4 [2023-11-22 16:41:03,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:41:03,133 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2023-11-22 16:41:03,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 16:41:03,133 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2023-11-22 16:41:03,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-22 16:41:03,134 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:41:03,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:41:03,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 16:41:03,134 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-22 16:41:03,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:41:03,135 INFO L85 PathProgramCache]: Analyzing trace with hash 429166719, now seen corresponding path program 1 times [2023-11-22 16:41:03,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:41:03,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879537915] [2023-11-22 16:41:03,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:41:03,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:41:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:03,223 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 16:41:03,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:41:03,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879537915] [2023-11-22 16:41:03,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879537915] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:41:03,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:41:03,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 16:41:03,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285369102] [2023-11-22 16:41:03,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:41:03,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 16:41:03,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:41:03,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 16:41:03,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 16:41:03,226 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:41:03,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:41:03,285 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2023-11-22 16:41:03,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 16:41:03,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-22 16:41:03,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:41:03,286 INFO L225 Difference]: With dead ends: 105 [2023-11-22 16:41:03,286 INFO L226 Difference]: Without dead ends: 105 [2023-11-22 16:41:03,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 16:41:03,287 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 39 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:41:03,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 106 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:41:03,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-22 16:41:03,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-11-22 16:41:03,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 56 states have (on average 1.9642857142857142) internal successors, (110), 101 states have internal predecessors, (110), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 16:41:03,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2023-11-22 16:41:03,303 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 9 [2023-11-22 16:41:03,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:41:03,304 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2023-11-22 16:41:03,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:41:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2023-11-22 16:41:03,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-22 16:41:03,324 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:41:03,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:41:03,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 16:41:03,325 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-22 16:41:03,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:41:03,326 INFO L85 PathProgramCache]: Analyzing trace with hash 429166720, now seen corresponding path program 1 times [2023-11-22 16:41:03,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:41:03,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773693451] [2023-11-22 16:41:03,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:41:03,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:41:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:03,439 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 16:41:03,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:41:03,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773693451] [2023-11-22 16:41:03,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773693451] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:41:03,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:41:03,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 16:41:03,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041302773] [2023-11-22 16:41:03,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:41:03,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 16:41:03,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:41:03,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 16:41:03,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 16:41:03,442 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:41:03,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:41:03,499 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2023-11-22 16:41:03,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 16:41:03,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-22 16:41:03,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:41:03,503 INFO L225 Difference]: With dead ends: 100 [2023-11-22 16:41:03,503 INFO L226 Difference]: Without dead ends: 100 [2023-11-22 16:41:03,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 16:41:03,504 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 34 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:41:03,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 114 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:41:03,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-22 16:41:03,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-11-22 16:41:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 56 states have (on average 1.875) internal successors, (105), 96 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 16:41:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2023-11-22 16:41:03,515 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 9 [2023-11-22 16:41:03,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:41:03,519 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2023-11-22 16:41:03,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:41:03,519 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2023-11-22 16:41:03,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-22 16:41:03,520 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:41:03,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:41:03,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-22 16:41:03,521 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-22 16:41:03,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:41:03,521 INFO L85 PathProgramCache]: Analyzing trace with hash 419266502, now seen corresponding path program 1 times [2023-11-22 16:41:03,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:41:03,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480268611] [2023-11-22 16:41:03,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:41:03,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:41:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:03,682 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 16:41:03,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:41:03,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480268611] [2023-11-22 16:41:03,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480268611] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:41:03,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:41:03,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 16:41:03,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298948053] [2023-11-22 16:41:03,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:41:03,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 16:41:03,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:41:03,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 16:41:03,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-22 16:41:03,684 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:41:03,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:41:03,861 INFO L93 Difference]: Finished difference Result 197 states and 214 transitions. [2023-11-22 16:41:03,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 16:41:03,862 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-22 16:41:03,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:41:03,863 INFO L225 Difference]: With dead ends: 197 [2023-11-22 16:41:03,863 INFO L226 Difference]: Without dead ends: 197 [2023-11-22 16:41:03,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-22 16:41:03,863 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 207 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 16:41:03,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 189 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 16:41:03,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-11-22 16:41:03,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 127. [2023-11-22 16:41:03,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 88 states have (on average 1.7727272727272727) internal successors, (156), 122 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 16:41:03,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 160 transitions. [2023-11-22 16:41:03,867 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 160 transitions. Word has length 10 [2023-11-22 16:41:03,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:41:03,867 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 160 transitions. [2023-11-22 16:41:03,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:41:03,868 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 160 transitions. [2023-11-22 16:41:03,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-22 16:41:03,868 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:41:03,868 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:41:03,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-22 16:41:03,869 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-22 16:41:03,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:41:03,869 INFO L85 PathProgramCache]: Analyzing trace with hash 419266503, now seen corresponding path program 1 times [2023-11-22 16:41:03,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:41:03,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369643698] [2023-11-22 16:41:03,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:41:03,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:41:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:04,056 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 16:41:04,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:41:04,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369643698] [2023-11-22 16:41:04,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369643698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:41:04,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:41:04,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 16:41:04,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809215044] [2023-11-22 16:41:04,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:41:04,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 16:41:04,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:41:04,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 16:41:04,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-22 16:41:04,060 INFO L87 Difference]: Start difference. First operand 127 states and 160 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:41:04,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:41:04,189 INFO L93 Difference]: Finished difference Result 149 states and 184 transitions. [2023-11-22 16:41:04,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 16:41:04,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-22 16:41:04,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:41:04,191 INFO L225 Difference]: With dead ends: 149 [2023-11-22 16:41:04,191 INFO L226 Difference]: Without dead ends: 149 [2023-11-22 16:41:04,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-22 16:41:04,192 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 24 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:41:04,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 214 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:41:04,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-11-22 16:41:04,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2023-11-22 16:41:04,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 106 states have (on average 1.679245283018868) internal successors, (178), 141 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 16:41:04,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 184 transitions. [2023-11-22 16:41:04,196 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 184 transitions. Word has length 10 [2023-11-22 16:41:04,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:41:04,196 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 184 transitions. [2023-11-22 16:41:04,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:41:04,196 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 184 transitions. [2023-11-22 16:41:04,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-22 16:41:04,197 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:41:04,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:41:04,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-22 16:41:04,198 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-22 16:41:04,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:41:04,198 INFO L85 PathProgramCache]: Analyzing trace with hash 614000174, now seen corresponding path program 1 times [2023-11-22 16:41:04,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:41:04,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388293934] [2023-11-22 16:41:04,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:41:04,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:41:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:04,640 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 16:41:04,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:41:04,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388293934] [2023-11-22 16:41:04,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388293934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:41:04,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:41:04,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-22 16:41:04,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304886558] [2023-11-22 16:41:04,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:41:04,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 16:41:04,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:41:04,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 16:41:04,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-22 16:41:04,642 INFO L87 Difference]: Start difference. First operand 147 states and 184 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:41:04,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:41:04,825 INFO L93 Difference]: Finished difference Result 181 states and 217 transitions. [2023-11-22 16:41:04,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 16:41:04,826 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-22 16:41:04,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:41:04,827 INFO L225 Difference]: With dead ends: 181 [2023-11-22 16:41:04,827 INFO L226 Difference]: Without dead ends: 181 [2023-11-22 16:41:04,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-22 16:41:04,827 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 46 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 16:41:04,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 336 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 16:41:04,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-11-22 16:41:04,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 147. [2023-11-22 16:41:04,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 106 states have (on average 1.669811320754717) internal successors, (177), 141 states have internal predecessors, (177), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 16:41:04,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 183 transitions. [2023-11-22 16:41:04,831 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 183 transitions. Word has length 17 [2023-11-22 16:41:04,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:41:04,832 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 183 transitions. [2023-11-22 16:41:04,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:41:04,832 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 183 transitions. [2023-11-22 16:41:04,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-22 16:41:04,832 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:41:04,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:41:04,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-22 16:41:04,833 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-22 16:41:04,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:41:04,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1065709104, now seen corresponding path program 1 times [2023-11-22 16:41:04,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:41:04,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584068678] [2023-11-22 16:41:04,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:41:04,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:41:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:05,175 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 16:41:05,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:41:05,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584068678] [2023-11-22 16:41:05,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584068678] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:41:05,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:41:05,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-22 16:41:05,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974520110] [2023-11-22 16:41:05,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:41:05,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 16:41:05,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:41:05,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 16:41:05,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-22 16:41:05,178 INFO L87 Difference]: Start difference. First operand 147 states and 183 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:41:05,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:41:05,344 INFO L93 Difference]: Finished difference Result 141 states and 174 transitions. [2023-11-22 16:41:05,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 16:41:05,344 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 16:41:05,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:41:05,345 INFO L225 Difference]: With dead ends: 141 [2023-11-22 16:41:05,345 INFO L226 Difference]: Without dead ends: 141 [2023-11-22 16:41:05,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-22 16:41:05,346 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 5 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:41:05,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 385 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:41:05,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-22 16:41:05,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2023-11-22 16:41:05,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 100 states have (on average 1.68) internal successors, (168), 135 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 16:41:05,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 174 transitions. [2023-11-22 16:41:05,349 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 174 transitions. Word has length 18 [2023-11-22 16:41:05,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:41:05,350 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 174 transitions. [2023-11-22 16:41:05,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:41:05,350 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 174 transitions. [2023-11-22 16:41:05,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-22 16:41:05,351 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:41:05,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:41:05,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-22 16:41:05,351 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-22 16:41:05,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:41:05,351 INFO L85 PathProgramCache]: Analyzing trace with hash 915405180, now seen corresponding path program 1 times [2023-11-22 16:41:05,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:41:05,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423777561] [2023-11-22 16:41:05,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:41:05,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:41:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:05,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 16:41:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:05,423 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 16:41:05,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:41:05,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423777561] [2023-11-22 16:41:05,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423777561] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:41:05,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:41:05,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 16:41:05,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255435166] [2023-11-22 16:41:05,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:41:05,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 16:41:05,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:41:05,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 16:41:05,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 16:41:05,426 INFO L87 Difference]: Start difference. First operand 141 states and 174 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 16:41:05,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:41:05,494 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2023-11-22 16:41:05,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 16:41:05,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2023-11-22 16:41:05,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:41:05,496 INFO L225 Difference]: With dead ends: 134 [2023-11-22 16:41:05,496 INFO L226 Difference]: Without dead ends: 134 [2023-11-22 16:41:05,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 16:41:05,496 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 10 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:41:05,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 182 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:41:05,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-22 16:41:05,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 123. [2023-11-22 16:41:05,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 82 states have (on average 1.6219512195121952) internal successors, (133), 117 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 16:41:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2023-11-22 16:41:05,499 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 25 [2023-11-22 16:41:05,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:41:05,500 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2023-11-22 16:41:05,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 16:41:05,500 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2023-11-22 16:41:05,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-22 16:41:05,500 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:41:05,500 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:41:05,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-22 16:41:05,501 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-22 16:41:05,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:41:05,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1637619411, now seen corresponding path program 1 times [2023-11-22 16:41:05,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:41:05,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324884665] [2023-11-22 16:41:05,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:41:05,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:41:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:05,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 16:41:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:05,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:41:05,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:41:05,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324884665] [2023-11-22 16:41:05,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324884665] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 16:41:05,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190227626] [2023-11-22 16:41:05,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:41:05,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 16:41:05,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 16:41:05,857 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 16:41:05,872 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 16:41:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:05,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-22 16:41:05,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:41:06,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-22 16:41:06,043 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 16:41:06,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:41:06,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-22 16:41:06,091 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-22 16:41:06,091 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 17 treesize of output 21 [2023-11-22 16:41:06,206 WARN L876 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (store |c_old(#length)| append_~node~0.base (select |c_#length| append_~node~0.base)) |c_#length|) (= (select |c_old(#valid)| append_~node~0.base) 0))) is different from true [2023-11-22 16:41:06,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:41:06,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2023-11-22 16:41:06,283 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-22 16:41:06,284 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 16 treesize of output 18 [2023-11-22 16:41:06,342 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-22 16:41:06,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-22 16:41:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-22 16:41:06,372 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 16:41:06,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190227626] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 16:41:06,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 16:41:06,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 16 [2023-11-22 16:41:06,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593204869] [2023-11-22 16:41:06,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 16:41:06,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-22 16:41:06,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:41:06,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-22 16:41:06,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=355, Unknown=1, NotChecked=38, Total=462 [2023-11-22 16:41:06,581 INFO L87 Difference]: Start difference. First operand 123 states and 139 transitions. Second operand has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 13 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 16:41:07,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:41:07,129 INFO L93 Difference]: Finished difference Result 219 states and 235 transitions. [2023-11-22 16:41:07,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-22 16:41:07,130 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 13 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2023-11-22 16:41:07,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:41:07,131 INFO L225 Difference]: With dead ends: 219 [2023-11-22 16:41:07,131 INFO L226 Difference]: Without dead ends: 219 [2023-11-22 16:41:07,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=630, Unknown=1, NotChecked=52, Total=812 [2023-11-22 16:41:07,132 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 379 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 200 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 16:41:07,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 603 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 768 Invalid, 0 Unknown, 200 Unchecked, 0.4s Time] [2023-11-22 16:41:07,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-11-22 16:41:07,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 134. [2023-11-22 16:41:07,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 92 states have (on average 1.5217391304347827) internal successors, (140), 127 states have internal predecessors, (140), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-22 16:41:07,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 150 transitions. [2023-11-22 16:41:07,137 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 150 transitions. Word has length 26 [2023-11-22 16:41:07,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:41:07,137 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 150 transitions. [2023-11-22 16:41:07,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 13 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 16:41:07,137 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 150 transitions. [2023-11-22 16:41:07,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-22 16:41:07,138 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:41:07,138 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:41:07,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-22 16:41:07,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-22 16:41:07,352 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-22 16:41:07,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:41:07,353 INFO L85 PathProgramCache]: Analyzing trace with hash -757941946, now seen corresponding path program 1 times [2023-11-22 16:41:07,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:41:07,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772247355] [2023-11-22 16:41:07,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:41:07,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:41:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:07,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 16:41:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:07,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:41:07,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:41:07,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772247355] [2023-11-22 16:41:07,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772247355] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 16:41:07,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803021667] [2023-11-22 16:41:07,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:41:07,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 16:41:07,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 16:41:07,609 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 16:41:07,654 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 16:41:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:07,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-22 16:41:07,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:41:07,745 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 16:41:07,761 WARN L876 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))) is different from true [2023-11-22 16:41:07,813 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-22 16:41:07,814 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 19 treesize of output 16 [2023-11-22 16:41:07,829 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-22 16:41:07,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-22 16:41:07,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-22 16:41:07,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 16:41:07,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803021667] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 16:41:07,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 16:41:07,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2023-11-22 16:41:07,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944750981] [2023-11-22 16:41:07,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 16:41:07,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-22 16:41:07,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:41:07,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-22 16:41:07,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2023-11-22 16:41:07,881 INFO L87 Difference]: Start difference. First operand 134 states and 150 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 16:41:08,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:41:08,108 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2023-11-22 16:41:08,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 16:41:08,109 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2023-11-22 16:41:08,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:41:08,109 INFO L225 Difference]: With dead ends: 163 [2023-11-22 16:41:08,109 INFO L226 Difference]: Without dead ends: 163 [2023-11-22 16:41:08,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=176, Unknown=1, NotChecked=28, Total=272 [2023-11-22 16:41:08,110 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 147 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:41:08,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 236 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 297 Invalid, 0 Unknown, 133 Unchecked, 0.1s Time] [2023-11-22 16:41:08,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-22 16:41:08,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 135. [2023-11-22 16:41:08,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 94 states have (on average 1.5212765957446808) internal successors, (143), 128 states have internal predecessors, (143), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-22 16:41:08,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 153 transitions. [2023-11-22 16:41:08,113 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 153 transitions. Word has length 27 [2023-11-22 16:41:08,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:41:08,113 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 153 transitions. [2023-11-22 16:41:08,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 16:41:08,113 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 153 transitions. [2023-11-22 16:41:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-22 16:41:08,114 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:41:08,114 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:41:08,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-22 16:41:08,324 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,SelfDestructingSolverStorable12 [2023-11-22 16:41:08,325 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-22 16:41:08,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:41:08,326 INFO L85 PathProgramCache]: Analyzing trace with hash -757941945, now seen corresponding path program 1 times [2023-11-22 16:41:08,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:41:08,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977118337] [2023-11-22 16:41:08,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:41:08,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:41:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:08,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 16:41:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:41:08,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:41:08,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977118337] [2023-11-22 16:41:08,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977118337] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 16:41:08,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012852914] [2023-11-22 16:41:08,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:41:08,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 16:41:08,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 16:41:08,607 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 16:41:08,651 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 16:41:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:08,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-22 16:41:08,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:41:08,749 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 16:41:08,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-22 16:41:08,788 WARN L876 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (store |c_old(#length)| append_~node~0.base (select |c_#length| append_~node~0.base)) |c_#length|) (= (select |c_old(#valid)| append_~node~0.base) 0))) is different from true [2023-11-22 16:41:08,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:41:08,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-22 16:41:08,834 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-22 16:41:08,834 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 11 treesize of output 11 [2023-11-22 16:41:08,874 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-22 16:41:08,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-22 16:41:08,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-22 16:41:08,897 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 16:41:09,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012852914] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 16:41:09,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 16:41:09,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2023-11-22 16:41:09,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442077711] [2023-11-22 16:41:09,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 16:41:09,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-22 16:41:09,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:41:09,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-22 16:41:09,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=254, Unknown=1, NotChecked=32, Total=342 [2023-11-22 16:41:09,075 INFO L87 Difference]: Start difference. First operand 135 states and 153 transitions. Second operand has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 11 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 16:41:09,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:41:09,601 INFO L93 Difference]: Finished difference Result 260 states and 291 transitions. [2023-11-22 16:41:09,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-22 16:41:09,601 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 11 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2023-11-22 16:41:09,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:41:09,602 INFO L225 Difference]: With dead ends: 260 [2023-11-22 16:41:09,602 INFO L226 Difference]: Without dead ends: 260 [2023-11-22 16:41:09,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=376, Unknown=1, NotChecked=40, Total=506 [2023-11-22 16:41:09,603 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 175 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 16:41:09,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 487 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 774 Invalid, 0 Unknown, 176 Unchecked, 0.4s Time] [2023-11-22 16:41:09,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-11-22 16:41:09,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 210. [2023-11-22 16:41:09,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 164 states have (on average 1.5) internal successors, (246), 198 states have internal predecessors, (246), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2023-11-22 16:41:09,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 261 transitions. [2023-11-22 16:41:09,608 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 261 transitions. Word has length 27 [2023-11-22 16:41:09,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:41:09,608 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 261 transitions. [2023-11-22 16:41:09,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 11 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 16:41:09,608 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 261 transitions. [2023-11-22 16:41:09,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-22 16:41:09,609 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:41:09,609 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:41:09,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-22 16:41:09,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 16:41:09,821 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-22 16:41:09,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:41:09,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1617805816, now seen corresponding path program 1 times [2023-11-22 16:41:09,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:41:09,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440411421] [2023-11-22 16:41:09,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:41:09,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:41:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:10,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 16:41:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:41:11,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:41:11,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440411421] [2023-11-22 16:41:11,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440411421] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 16:41:11,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455990596] [2023-11-22 16:41:11,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:41:11,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 16:41:11,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 16:41:11,257 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 16:41:11,270 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 16:41:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:11,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-22 16:41:11,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:41:11,407 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 16:41:11,431 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-22 16:41:11,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-22 16:41:11,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-22 16:41:11,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-22 16:41:11,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-22 16:41:11,680 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-22 16:41:11,681 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 18 treesize of output 17 [2023-11-22 16:41:11,685 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 3 [2023-11-22 16:41:11,713 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-22 16:41:11,714 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 18 treesize of output 17 [2023-11-22 16:41:11,719 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 3 [2023-11-22 16:41:11,780 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-22 16:41:11,780 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 22 treesize of output 21 [2023-11-22 16:41:11,792 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-22 16:41:11,793 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 22 treesize of output 21 [2023-11-22 16:41:11,881 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:41:11,888 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-22 16:41:11,888 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 28 [2023-11-22 16:41:12,001 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2023-11-22 16:41:12,002 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 22 treesize of output 24 [2023-11-22 16:41:12,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-22 16:41:12,047 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 40 treesize of output 31 [2023-11-22 16:41:12,056 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 18 treesize of output 13 [2023-11-22 16:41:12,093 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 18 treesize of output 13 [2023-11-22 16:41:12,097 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 40 treesize of output 31 [2023-11-22 16:41:12,112 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 40 treesize of output 31 [2023-11-22 16:41:12,115 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 18 treesize of output 13 [2023-11-22 16:41:12,146 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 31 treesize of output 13 [2023-11-22 16:41:12,149 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 9 treesize of output 3 [2023-11-22 16:41:12,171 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:41:12,172 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 16:41:12,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:41:12,641 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 105 treesize of output 106 [2023-11-22 16:41:12,647 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 623 treesize of output 437 [2023-11-22 16:41:12,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:41:12,654 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 229 treesize of output 190 [2023-11-22 16:41:12,658 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 576 treesize of output 540 [2023-11-22 16:41:12,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:41:12,673 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 633 treesize of output 620 [2023-11-22 16:41:12,684 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 396 treesize of output 344 [2023-11-22 16:41:12,692 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 331 treesize of output 299 [2023-11-22 16:41:12,699 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 299 treesize of output 279 [2023-11-22 16:41:12,705 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 292 treesize of output 264 [2023-11-22 16:41:12,714 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 255 treesize of output 247 [2023-11-22 16:41:12,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455990596] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 16:41:12,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 16:41:12,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 28 [2023-11-22 16:41:12,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130898298] [2023-11-22 16:41:12,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 16:41:12,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-22 16:41:12,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:41:12,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-22 16:41:12,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1124, Unknown=21, NotChecked=0, Total=1260 [2023-11-22 16:41:12,831 INFO L87 Difference]: Start difference. First operand 210 states and 261 transitions. Second operand has 30 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 25 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 16:41:14,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:41:14,016 INFO L93 Difference]: Finished difference Result 249 states and 307 transitions. [2023-11-22 16:41:14,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-22 16:41:14,016 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 25 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2023-11-22 16:41:14,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:41:14,017 INFO L225 Difference]: With dead ends: 249 [2023-11-22 16:41:14,017 INFO L226 Difference]: Without dead ends: 249 [2023-11-22 16:41:14,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=281, Invalid=1859, Unknown=22, NotChecked=0, Total=2162 [2023-11-22 16:41:14,018 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 189 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-22 16:41:14,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 838 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-22 16:41:14,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-11-22 16:41:14,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 209. [2023-11-22 16:41:14,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 164 states have (on average 1.4695121951219512) internal successors, (241), 197 states have internal predecessors, (241), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2023-11-22 16:41:14,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 256 transitions. [2023-11-22 16:41:14,022 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 256 transitions. Word has length 33 [2023-11-22 16:41:14,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:41:14,023 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 256 transitions. [2023-11-22 16:41:14,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 25 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 16:41:14,023 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 256 transitions. [2023-11-22 16:41:14,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-22 16:41:14,024 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:41:14,024 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:41:14,039 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 16:41:14,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-22 16:41:14,225 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-22 16:41:14,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:41:14,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1617805817, now seen corresponding path program 1 times [2023-11-22 16:41:14,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:41:14,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639808203] [2023-11-22 16:41:14,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:41:14,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:41:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:14,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 16:41:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:14,976 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:41:14,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:41:14,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639808203] [2023-11-22 16:41:14,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639808203] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 16:41:14,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663800407] [2023-11-22 16:41:14,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:41:14,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 16:41:14,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 16:41:14,993 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 16:41:15,009 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 16:41:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:15,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-22 16:41:15,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:41:15,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-22 16:41:15,197 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-22 16:41:15,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-22 16:41:15,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-22 16:41:15,377 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-22 16:41:15,377 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 18 treesize of output 17 [2023-11-22 16:41:15,383 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 3 [2023-11-22 16:41:15,423 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-22 16:41:15,423 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 22 treesize of output 21 [2023-11-22 16:41:15,475 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:41:15,481 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-22 16:41:15,481 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 28 [2023-11-22 16:41:15,571 INFO L349 Elim1Store]: treesize reduction 58, result has 34.8 percent of original size [2023-11-22 16:41:15,572 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 30 treesize of output 40 [2023-11-22 16:41:15,604 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 40 treesize of output 31 [2023-11-22 16:41:15,662 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 40 treesize of output 31 [2023-11-22 16:41:15,692 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 40 treesize of output 31 [2023-11-22 16:41:15,717 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 31 treesize of output 13 [2023-11-22 16:41:15,745 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:41:15,745 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 16:41:15,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:41:15,963 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 33 treesize of output 34 [2023-11-22 16:41:15,967 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 170 treesize of output 110 [2023-11-22 16:41:15,972 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 44 treesize of output 40 [2023-11-22 16:41:15,978 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 82 treesize of output 74 [2023-11-22 16:41:16,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663800407] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 16:41:16,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 16:41:16,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 25 [2023-11-22 16:41:16,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855702001] [2023-11-22 16:41:16,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 16:41:16,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-22 16:41:16,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:41:16,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-22 16:41:16,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=875, Unknown=14, NotChecked=0, Total=992 [2023-11-22 16:41:16,025 INFO L87 Difference]: Start difference. First operand 209 states and 256 transitions. Second operand has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 22 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 16:41:16,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:41:16,768 INFO L93 Difference]: Finished difference Result 248 states and 306 transitions. [2023-11-22 16:41:16,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-22 16:41:16,768 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 22 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2023-11-22 16:41:16,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:41:16,779 INFO L225 Difference]: With dead ends: 248 [2023-11-22 16:41:16,779 INFO L226 Difference]: Without dead ends: 248 [2023-11-22 16:41:16,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=224, Invalid=1322, Unknown=14, NotChecked=0, Total=1560 [2023-11-22 16:41:16,781 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 106 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-22 16:41:16,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 841 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-22 16:41:16,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-11-22 16:41:16,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 209. [2023-11-22 16:41:16,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 164 states have (on average 1.4634146341463414) internal successors, (240), 197 states have internal predecessors, (240), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2023-11-22 16:41:16,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 255 transitions. [2023-11-22 16:41:16,815 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 255 transitions. Word has length 33 [2023-11-22 16:41:16,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:41:16,815 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 255 transitions. [2023-11-22 16:41:16,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 22 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 16:41:16,816 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 255 transitions. [2023-11-22 16:41:16,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-22 16:41:16,820 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:41:16,820 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:41:16,833 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 16:41:17,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-22 16:41:17,033 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-22 16:41:17,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:41:17,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1263010642, now seen corresponding path program 1 times [2023-11-22 16:41:17,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:41:17,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886162518] [2023-11-22 16:41:17,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:41:17,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:41:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:17,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 16:41:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:41:18,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:41:18,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886162518] [2023-11-22 16:41:18,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886162518] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 16:41:18,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224962329] [2023-11-22 16:41:18,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:41:18,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 16:41:18,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 16:41:18,781 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 16:41:18,782 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 16:41:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:41:18,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-22 16:41:18,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:41:18,936 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 16:41:18,948 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-22 16:41:18,948 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 17 treesize of output 21 [2023-11-22 16:41:18,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 16:41:18,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 16:41:19,008 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 21 treesize of output 20 [2023-11-22 16:41:19,013 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 27 treesize of output 11 [2023-11-22 16:41:21,294 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (select |c_#memory_$Pointer$.offset| c_append_~node~0.base))) (or (exists ((|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (let ((.cse2 (store |c_old(#memory_$Pointer$.offset)| c_append_~node~0.base (select |v_#memory_$Pointer$.offset_135| c_append_~node~0.base)))) (let ((.cse1 (@diff .cse2 |v_#memory_$Pointer$.offset_135|))) (and (= (store |v_#memory_$Pointer$.offset_135| c_append_~node~0.base .cse0) |c_#memory_$Pointer$.offset|) (= |c_append_#in~head.base| .cse1) (= |v_#memory_$Pointer$.offset_135| (store .cse2 .cse1 (select |v_#memory_$Pointer$.offset_135| .cse1))))))) (exists ((|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_135| (store |c_old(#memory_$Pointer$.offset)| c_append_~node~0.base (select |v_#memory_$Pointer$.offset_135| c_append_~node~0.base))) (= (store |v_#memory_$Pointer$.offset_135| c_append_~node~0.base .cse0) |c_#memory_$Pointer$.offset|))))) (let ((.cse3 (select |c_#memory_$Pointer$.base| c_append_~node~0.base))) (or (exists ((|v_#memory_$Pointer$.base_143| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_143| c_append_~node~0.base .cse3) |c_#memory_$Pointer$.base|) (= |v_#memory_$Pointer$.base_143| (store |c_old(#memory_$Pointer$.base)| c_append_~node~0.base (select |v_#memory_$Pointer$.base_143| c_append_~node~0.base))))) (exists ((|v_#memory_$Pointer$.base_143| (Array Int (Array Int Int)))) (let ((.cse4 (store |c_old(#memory_$Pointer$.base)| c_append_~node~0.base (select |v_#memory_$Pointer$.base_143| c_append_~node~0.base)))) (let ((.cse5 (@diff .cse4 |v_#memory_$Pointer$.base_143|))) (and (= |v_#memory_$Pointer$.base_143| (store .cse4 .cse5 (select |v_#memory_$Pointer$.base_143| .cse5))) (= |c_append_#in~head.base| .cse5) (= (store |v_#memory_$Pointer$.base_143| c_append_~node~0.base .cse3) |c_#memory_$Pointer$.base|))))))) (= (select |c_old(#valid)| c_append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| c_append_~node~0.base (select |c_#valid| c_append_~node~0.base)))) is different from false [2023-11-22 16:41:21,299 WARN L876 $PredicateComparison]: unable to prove that (and (let ((.cse0 (select |c_#memory_$Pointer$.offset| c_append_~node~0.base))) (or (exists ((|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (let ((.cse2 (store |c_old(#memory_$Pointer$.offset)| c_append_~node~0.base (select |v_#memory_$Pointer$.offset_135| c_append_~node~0.base)))) (let ((.cse1 (@diff .cse2 |v_#memory_$Pointer$.offset_135|))) (and (= (store |v_#memory_$Pointer$.offset_135| c_append_~node~0.base .cse0) |c_#memory_$Pointer$.offset|) (= |c_append_#in~head.base| .cse1) (= |v_#memory_$Pointer$.offset_135| (store .cse2 .cse1 (select |v_#memory_$Pointer$.offset_135| .cse1))))))) (exists ((|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_135| (store |c_old(#memory_$Pointer$.offset)| c_append_~node~0.base (select |v_#memory_$Pointer$.offset_135| c_append_~node~0.base))) (= (store |v_#memory_$Pointer$.offset_135| c_append_~node~0.base .cse0) |c_#memory_$Pointer$.offset|))))) (let ((.cse3 (select |c_#memory_$Pointer$.base| c_append_~node~0.base))) (or (exists ((|v_#memory_$Pointer$.base_143| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_143| c_append_~node~0.base .cse3) |c_#memory_$Pointer$.base|) (= |v_#memory_$Pointer$.base_143| (store |c_old(#memory_$Pointer$.base)| c_append_~node~0.base (select |v_#memory_$Pointer$.base_143| c_append_~node~0.base))))) (exists ((|v_#memory_$Pointer$.base_143| (Array Int (Array Int Int)))) (let ((.cse4 (store |c_old(#memory_$Pointer$.base)| c_append_~node~0.base (select |v_#memory_$Pointer$.base_143| c_append_~node~0.base)))) (let ((.cse5 (@diff .cse4 |v_#memory_$Pointer$.base_143|))) (and (= |v_#memory_$Pointer$.base_143| (store .cse4 .cse5 (select |v_#memory_$Pointer$.base_143| .cse5))) (= |c_append_#in~head.base| .cse5) (= (store |v_#memory_$Pointer$.base_143| c_append_~node~0.base .cse3) |c_#memory_$Pointer$.base|))))))) (= (select |c_old(#valid)| c_append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| c_append_~node~0.base (select |c_#valid| c_append_~node~0.base)))) is different from true [2023-11-22 16:41:23,395 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((append_~node~0.base Int)) (and (= (select |c_old(#valid)| append_~node~0.base) 0) (= (store |c_old(#memory_$Pointer$.base)| append_~node~0.base (select |c_#memory_$Pointer$.base| append_~node~0.base)) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| append_~node~0.base (select |c_#memory_$Pointer$.offset| append_~node~0.base))) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))) (exists ((append_~node~0.base Int) (|v_#memory_$Pointer$.base_143| (Array Int (Array Int Int)))) (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| append_~node~0.base (select |v_#memory_$Pointer$.base_143| append_~node~0.base)))) (let ((.cse1 (@diff .cse0 |v_#memory_$Pointer$.base_143|))) (and (= (store |v_#memory_$Pointer$.base_143| append_~node~0.base (select |c_#memory_$Pointer$.base| append_~node~0.base)) |c_#memory_$Pointer$.base|) (= |v_#memory_$Pointer$.base_143| (store .cse0 .cse1 (select |v_#memory_$Pointer$.base_143| .cse1))) (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| append_~node~0.base (select |c_#memory_$Pointer$.offset| append_~node~0.base))) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))) (= |c_append_#in~head.base| .cse1))))) (exists ((append_~node~0.base Int)) (and (exists ((|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (let ((.cse2 (store |c_old(#memory_$Pointer$.offset)| append_~node~0.base (select |v_#memory_$Pointer$.offset_135| append_~node~0.base)))) (let ((.cse3 (@diff .cse2 |v_#memory_$Pointer$.offset_135|))) (and (= (store |v_#memory_$Pointer$.offset_135| append_~node~0.base (select |c_#memory_$Pointer$.offset| append_~node~0.base)) |c_#memory_$Pointer$.offset|) (= (store .cse2 .cse3 (select |v_#memory_$Pointer$.offset_135| .cse3)) |v_#memory_$Pointer$.offset_135|) (= |c_append_#in~head.base| .cse3))))) (= (select |c_old(#valid)| append_~node~0.base) 0) (= (store |c_old(#memory_$Pointer$.base)| append_~node~0.base (select |c_#memory_$Pointer$.base| append_~node~0.base)) |c_#memory_$Pointer$.base|) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))) (exists ((append_~node~0.base Int) (|v_#memory_$Pointer$.base_143| (Array Int (Array Int Int)))) (let ((.cse4 (store |c_old(#memory_$Pointer$.base)| append_~node~0.base (select |v_#memory_$Pointer$.base_143| append_~node~0.base)))) (let ((.cse5 (@diff .cse4 |v_#memory_$Pointer$.base_143|))) (and (= (store |v_#memory_$Pointer$.base_143| append_~node~0.base (select |c_#memory_$Pointer$.base| append_~node~0.base)) |c_#memory_$Pointer$.base|) (= |v_#memory_$Pointer$.base_143| (store .cse4 .cse5 (select |v_#memory_$Pointer$.base_143| .cse5))) (exists ((|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (let ((.cse6 (store |c_old(#memory_$Pointer$.offset)| append_~node~0.base (select |v_#memory_$Pointer$.offset_135| append_~node~0.base)))) (let ((.cse7 (@diff .cse6 |v_#memory_$Pointer$.offset_135|))) (and (= (store |v_#memory_$Pointer$.offset_135| append_~node~0.base (select |c_#memory_$Pointer$.offset| append_~node~0.base)) |c_#memory_$Pointer$.offset|) (= (store .cse6 .cse7 (select |v_#memory_$Pointer$.offset_135| .cse7)) |v_#memory_$Pointer$.offset_135|) (= |c_append_#in~head.base| .cse7))))) (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))) (= |c_append_#in~head.base| .cse5)))))) is different from false [2023-11-22 16:41:25,426 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((append_~node~0.base Int)) (and (= (select |c_old(#valid)| append_~node~0.base) 0) (= (store |c_old(#memory_$Pointer$.base)| append_~node~0.base (select |c_#memory_$Pointer$.base| append_~node~0.base)) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| append_~node~0.base (select |c_#memory_$Pointer$.offset| append_~node~0.base))) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))) (exists ((append_~node~0.base Int) (|v_#memory_$Pointer$.base_143| (Array Int (Array Int Int)))) (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| append_~node~0.base (select |v_#memory_$Pointer$.base_143| append_~node~0.base)))) (let ((.cse1 (@diff .cse0 |v_#memory_$Pointer$.base_143|))) (and (= (store |v_#memory_$Pointer$.base_143| append_~node~0.base (select |c_#memory_$Pointer$.base| append_~node~0.base)) |c_#memory_$Pointer$.base|) (= |v_#memory_$Pointer$.base_143| (store .cse0 .cse1 (select |v_#memory_$Pointer$.base_143| .cse1))) (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| append_~node~0.base (select |c_#memory_$Pointer$.offset| append_~node~0.base))) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))) (= |c_append_#in~head.base| .cse1))))) (exists ((append_~node~0.base Int)) (and (exists ((|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (let ((.cse2 (store |c_old(#memory_$Pointer$.offset)| append_~node~0.base (select |v_#memory_$Pointer$.offset_135| append_~node~0.base)))) (let ((.cse3 (@diff .cse2 |v_#memory_$Pointer$.offset_135|))) (and (= (store |v_#memory_$Pointer$.offset_135| append_~node~0.base (select |c_#memory_$Pointer$.offset| append_~node~0.base)) |c_#memory_$Pointer$.offset|) (= (store .cse2 .cse3 (select |v_#memory_$Pointer$.offset_135| .cse3)) |v_#memory_$Pointer$.offset_135|) (= |c_append_#in~head.base| .cse3))))) (= (select |c_old(#valid)| append_~node~0.base) 0) (= (store |c_old(#memory_$Pointer$.base)| append_~node~0.base (select |c_#memory_$Pointer$.base| append_~node~0.base)) |c_#memory_$Pointer$.base|) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))) (exists ((append_~node~0.base Int) (|v_#memory_$Pointer$.base_143| (Array Int (Array Int Int)))) (let ((.cse4 (store |c_old(#memory_$Pointer$.base)| append_~node~0.base (select |v_#memory_$Pointer$.base_143| append_~node~0.base)))) (let ((.cse5 (@diff .cse4 |v_#memory_$Pointer$.base_143|))) (and (= (store |v_#memory_$Pointer$.base_143| append_~node~0.base (select |c_#memory_$Pointer$.base| append_~node~0.base)) |c_#memory_$Pointer$.base|) (= |v_#memory_$Pointer$.base_143| (store .cse4 .cse5 (select |v_#memory_$Pointer$.base_143| .cse5))) (exists ((|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (let ((.cse6 (store |c_old(#memory_$Pointer$.offset)| append_~node~0.base (select |v_#memory_$Pointer$.offset_135| append_~node~0.base)))) (let ((.cse7 (@diff .cse6 |v_#memory_$Pointer$.offset_135|))) (and (= (store |v_#memory_$Pointer$.offset_135| append_~node~0.base (select |c_#memory_$Pointer$.offset| append_~node~0.base)) |c_#memory_$Pointer$.offset|) (= (store .cse6 .cse7 (select |v_#memory_$Pointer$.offset_135| .cse7)) |v_#memory_$Pointer$.offset_135|) (= |c_append_#in~head.base| .cse7))))) (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))) (= |c_append_#in~head.base| .cse5)))))) is different from true [2023-11-22 16:41:25,946 INFO L349 Elim1Store]: treesize reduction 197, result has 9.2 percent of original size [2023-11-22 16:41:25,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 286 treesize of output 564 [2023-11-22 16:41:26,923 INFO L349 Elim1Store]: treesize reduction 197, result has 9.2 percent of original size [2023-11-22 16:41:26,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 209 treesize of output 489 [2023-11-22 16:41:27,771 INFO L224 Elim1Store]: Index analysis took 752 ms [2023-11-22 16:41:34,537 WARN L293 SmtUtils]: Spent 6.76s on a formula simplification. DAG size of input: 178 DAG size of output: 61 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-22 16:41:34,537 INFO L349 Elim1Store]: treesize reduction 428, result has 19.7 percent of original size [2023-11-22 16:41:34,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 34 case distinctions, treesize of input 144 treesize of output 322 [2023-11-22 16:44:44,084 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:44,194 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:44,205 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:44,214 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:44,228 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:44,233 INFO L224 Elim1Store]: Index analysis took 326 ms [2023-11-22 16:44:44,234 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:44,234 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:44,235 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:44,286 INFO L349 Elim1Store]: treesize reduction 218, result has 0.5 percent of original size [2023-11-22 16:44:44,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 20 case distinctions, treesize of input 133 treesize of output 294 [2023-11-22 16:44:45,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:44:45,718 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:45,733 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:45,756 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:45,930 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:46,044 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:46,055 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:46,060 INFO L224 Elim1Store]: Index analysis took 415 ms [2023-11-22 16:44:46,061 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:46,062 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:46,064 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:46,200 INFO L349 Elim1Store]: treesize reduction 181, result has 0.5 percent of original size [2023-11-22 16:44:46,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 19 case distinctions, treesize of input 133 treesize of output 294 [2023-11-22 16:44:47,839 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:48,159 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:48,186 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:48,216 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:48,254 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:48,283 INFO L224 Elim1Store]: Index analysis took 975 ms [2023-11-22 16:44:48,285 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:48,285 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:48,286 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:48,474 INFO L349 Elim1Store]: treesize reduction 218, result has 0.5 percent of original size [2023-11-22 16:44:48,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 20 case distinctions, treesize of input 133 treesize of output 294 [2023-11-22 16:44:51,291 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:51,816 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:52,087 INFO L224 Elim1Store]: Index analysis took 1892 ms [2023-11-22 16:44:52,089 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:52,427 INFO L349 Elim1Store]: treesize reduction 233, result has 0.4 percent of original size [2023-11-22 16:44:52,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 20 case distinctions, treesize of input 133 treesize of output 294 [2023-11-22 16:44:54,312 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:54,791 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:54,864 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:54,979 INFO L224 Elim1Store]: Index analysis took 1511 ms [2023-11-22 16:44:54,981 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:55,449 INFO L349 Elim1Store]: treesize reduction 233, result has 0.4 percent of original size [2023-11-22 16:44:55,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 20 case distinctions, treesize of input 133 treesize of output 294 [2023-11-22 16:44:57,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:44:57,215 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:57,235 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:57,258 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:57,448 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:57,981 INFO L224 Elim1Store]: Index analysis took 973 ms [2023-11-22 16:44:57,983 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:44:58,249 INFO L349 Elim1Store]: treesize reduction 196, result has 0.5 percent of original size [2023-11-22 16:44:58,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 19 case distinctions, treesize of input 133 treesize of output 294 [2023-11-22 16:45:00,359 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:45:01,363 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:45:01,476 INFO L224 Elim1Store]: Index analysis took 2581 ms [2023-11-22 16:45:01,803 INFO L349 Elim1Store]: treesize reduction 248, result has 0.4 percent of original size [2023-11-22 16:45:01,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 20 case distinctions, treesize of input 133 treesize of output 294 [2023-11-22 16:45:05,724 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:45:06,729 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:45:07,394 INFO L224 Elim1Store]: Index analysis took 3453 ms [2023-11-22 16:45:08,200 INFO L349 Elim1Store]: treesize reduction 248, result has 0.4 percent of original size [2023-11-22 16:45:08,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 20 case distinctions, treesize of input 133 treesize of output 294 [2023-11-22 16:45:14,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:45:14,286 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:45:14,303 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:45:14,357 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:45:14,673 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:45:15,231 INFO L224 Elim1Store]: Index analysis took 1160 ms [2023-11-22 16:45:16,109 INFO L349 Elim1Store]: treesize reduction 211, result has 0.5 percent of original size [2023-11-22 16:45:16,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 19 case distinctions, treesize of input 133 treesize of output 294 [2023-11-22 16:45:18,356 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:45:18,677 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:45:18,812 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:45:18,849 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:45:18,895 INFO L224 Elim1Store]: Index analysis took 1534 ms [2023-11-22 16:45:18,897 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:45:19,063 INFO L349 Elim1Store]: treesize reduction 248, result has 0.4 percent of original size [2023-11-22 16:45:19,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 20 case distinctions, treesize of input 133 treesize of output 294 [2023-11-22 16:45:20,995 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:45:21,741 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:45:21,887 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:45:21,969 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:45:22,076 INFO L224 Elim1Store]: Index analysis took 2704 ms [2023-11-22 16:45:22,078 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:45:22,337 INFO L349 Elim1Store]: treesize reduction 248, result has 0.4 percent of original size [2023-11-22 16:45:22,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 20 case distinctions, treesize of input 133 treesize of output 294 [2023-11-22 16:45:25,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:45:25,596 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:45:25,624 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:45:25,667 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:45:25,956 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:45:26,311 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:45:26,347 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:45:26,366 INFO L224 Elim1Store]: Index analysis took 1007 ms [2023-11-22 16:45:26,367 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:45:26,877 INFO L349 Elim1Store]: treesize reduction 211, result has 0.5 percent of original size [2023-11-22 16:45:26,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 19 case distinctions, treesize of input 133 treesize of output 294 Killed by 15