./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/length_test03-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/length_test03-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx --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-527bcce [2023-11-21 22:23:08,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:23:08,243 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-21 22:23:08,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:23:08,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:23:08,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:23:08,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:23:08,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:23:08,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:23:08,297 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:23:08,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:23:08,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:23:08,299 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:23:08,301 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:23:08,302 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:23:08,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:23:08,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:23:08,303 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:23:08,303 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-21 22:23:08,304 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-21 22:23:08,304 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-21 22:23:08,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:23:08,305 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-21 22:23:08,306 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:23:08,306 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:23:08,306 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:23:08,307 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:23:08,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:23:08,308 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:23:08,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:23:08,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:23:08,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:23:08,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:23:08,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:23:08,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:23:08,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:23:08,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:23:08,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:23:08,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:23:08,312 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx 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-21 22:23:08,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:23:08,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:23:08,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:23:08,700 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:23:08,700 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:23:08,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/memsafety-ext2/length_test03-1.i [2023-11-21 22:23:11,769 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:23:12,051 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:23:12,051 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/sv-benchmarks/c/memsafety-ext2/length_test03-1.i [2023-11-21 22:23:12,066 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/data/b75ac5d9d/4de07411cfa54547ba2b5c0d0b276cff/FLAG7ecf35815 [2023-11-21 22:23:12,081 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/data/b75ac5d9d/4de07411cfa54547ba2b5c0d0b276cff [2023-11-21 22:23:12,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:23:12,085 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:23:12,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:23:12,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:23:12,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:23:12,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:23:12" (1/1) ... [2023-11-21 22:23:12,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@765c3c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:12, skipping insertion in model container [2023-11-21 22:23:12,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:23:12" (1/1) ... [2023-11-21 22:23:12,145 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:23:12,462 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:23:12,478 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:23:12,569 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:23:12,600 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:23:12,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:12 WrapperNode [2023-11-21 22:23:12,600 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:23:12,601 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:23:12,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:23:12,602 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:23:12,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:12" (1/1) ... [2023-11-21 22:23:12,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:12" (1/1) ... [2023-11-21 22:23:12,653 INFO L138 Inliner]: procedures = 123, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 102 [2023-11-21 22:23:12,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:23:12,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:23:12,657 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:23:12,657 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:23:12,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:12" (1/1) ... [2023-11-21 22:23:12,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:12" (1/1) ... [2023-11-21 22:23:12,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:12" (1/1) ... [2023-11-21 22:23:12,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:12" (1/1) ... [2023-11-21 22:23:12,683 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:12" (1/1) ... [2023-11-21 22:23:12,687 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:12" (1/1) ... [2023-11-21 22:23:12,689 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:12" (1/1) ... [2023-11-21 22:23:12,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:12" (1/1) ... [2023-11-21 22:23:12,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:23:12,695 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:23:12,695 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:23:12,695 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:23:12,696 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:12" (1/1) ... [2023-11-21 22:23:12,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:23:12,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:12,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:12,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:23:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 22:23:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 22:23:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:23:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-21 22:23:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-21 22:23:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:23:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 22:23:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:23:12,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:23:12,776 INFO L130 BoogieDeclarations]: Found specification of procedure append [2023-11-21 22:23:12,776 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2023-11-21 22:23:12,924 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:23:12,926 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:23:13,410 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:23:13,465 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:23:13,465 INFO L308 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-21 22:23:13,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:23:13 BoogieIcfgContainer [2023-11-21 22:23:13,467 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:23:13,469 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:23:13,469 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:23:13,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:23:13,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:23:12" (1/3) ... [2023-11-21 22:23:13,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c897b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:23:13, skipping insertion in model container [2023-11-21 22:23:13,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:12" (2/3) ... [2023-11-21 22:23:13,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c897b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:23:13, skipping insertion in model container [2023-11-21 22:23:13,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:23:13" (3/3) ... [2023-11-21 22:23:13,478 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03-1.i [2023-11-21 22:23:13,498 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:23:13,498 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2023-11-21 22:23:13,547 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:23:13,554 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;@71a7b3ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:23:13,554 INFO L358 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2023-11-21 22:23:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 49 states have (on average 2.3469387755102042) internal successors, (115), 108 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-21 22:23:13,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-21 22:23:13,565 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:23:13,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-21 22:23:13,569 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-21 22:23:13,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:13,577 INFO L85 PathProgramCache]: Analyzing trace with hash 7010, now seen corresponding path program 1 times [2023-11-21 22:23:13,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:13,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715207825] [2023-11-21 22:23:13,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:13,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:13,801 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-21 22:23:13,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:13,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715207825] [2023-11-21 22:23:13,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715207825] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:13,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:13,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:23:13,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209330354] [2023-11-21 22:23:13,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:13,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:23:13,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:13,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:23:13,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:23:13,843 INFO L87 Difference]: Start difference. First operand has 112 states, 49 states have (on average 2.3469387755102042) internal successors, (115), 108 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) 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-21 22:23:14,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:14,006 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2023-11-21 22:23:14,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:23:14,008 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-21 22:23:14,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:23:14,018 INFO L225 Difference]: With dead ends: 144 [2023-11-21 22:23:14,018 INFO L226 Difference]: Without dead ends: 143 [2023-11-21 22:23:14,020 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-21 22:23:14,024 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 44 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:23:14,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 127 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:23:14,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-21 22:23:14,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 109. [2023-11-21 22:23:14,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 49 states have (on average 2.2653061224489797) 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-21 22:23:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2023-11-21 22:23:14,074 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 2 [2023-11-21 22:23:14,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:23:14,075 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2023-11-21 22:23:14,075 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-21 22:23:14,075 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2023-11-21 22:23:14,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-21 22:23:14,076 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:23:14,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-21 22:23:14,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:23:14,077 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-21 22:23:14,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:14,077 INFO L85 PathProgramCache]: Analyzing trace with hash 7011, now seen corresponding path program 1 times [2023-11-21 22:23:14,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:14,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260061120] [2023-11-21 22:23:14,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:14,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:14,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-21 22:23:14,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:14,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260061120] [2023-11-21 22:23:14,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260061120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:14,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:14,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:23:14,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163721042] [2023-11-21 22:23:14,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:14,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:23:14,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:14,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:23:14,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:23:14,180 INFO L87 Difference]: Start difference. First operand 109 states and 115 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-21 22:23:14,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:14,302 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2023-11-21 22:23:14,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:23:14,302 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-21 22:23:14,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:23:14,304 INFO L225 Difference]: With dead ends: 109 [2023-11-21 22:23:14,304 INFO L226 Difference]: Without dead ends: 109 [2023-11-21 22:23:14,305 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-21 22:23:14,306 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 8 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:23:14,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 142 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:23:14,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-21 22:23:14,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2023-11-21 22:23:14,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 103 states have internal predecessors, (109), 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-21 22:23:14,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2023-11-21 22:23:14,320 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 2 [2023-11-21 22:23:14,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:23:14,320 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2023-11-21 22:23:14,320 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-21 22:23:14,321 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2023-11-21 22:23:14,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-21 22:23:14,321 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:23:14,321 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-21 22:23:14,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:23:14,322 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-21 22:23:14,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:14,323 INFO L85 PathProgramCache]: Analyzing trace with hash 6741643, now seen corresponding path program 1 times [2023-11-21 22:23:14,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:14,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725377965] [2023-11-21 22:23:14,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:14,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:14,430 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-21 22:23:14,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:14,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725377965] [2023-11-21 22:23:14,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725377965] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:14,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:14,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:23:14,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623741248] [2023-11-21 22:23:14,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:14,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:23:14,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:14,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:23:14,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:23:14,434 INFO L87 Difference]: Start difference. First operand 107 states and 113 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-21 22:23:14,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:14,605 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2023-11-21 22:23:14,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:23:14,606 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-21 22:23:14,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:23:14,608 INFO L225 Difference]: With dead ends: 122 [2023-11-21 22:23:14,608 INFO L226 Difference]: Without dead ends: 122 [2023-11-21 22:23:14,608 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-21 22:23:14,610 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 22 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:23:14,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 130 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:23:14,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-21 22:23:14,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 109. [2023-11-21 22:23:14,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 53 states have (on average 2.150943396226415) internal successors, (114), 105 states have internal predecessors, (114), 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-21 22:23:14,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2023-11-21 22:23:14,632 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 4 [2023-11-21 22:23:14,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:23:14,634 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2023-11-21 22:23:14,634 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-21 22:23:14,635 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2023-11-21 22:23:14,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-21 22:23:14,635 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:23:14,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-21 22:23:14,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 22:23:14,637 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-21 22:23:14,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:14,638 INFO L85 PathProgramCache]: Analyzing trace with hash 6741644, now seen corresponding path program 1 times [2023-11-21 22:23:14,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:14,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146001391] [2023-11-21 22:23:14,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:14,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:14,774 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-21 22:23:14,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:14,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146001391] [2023-11-21 22:23:14,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146001391] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:14,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:14,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:23:14,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285371648] [2023-11-21 22:23:14,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:14,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:23:14,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:14,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:23:14,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:23:14,778 INFO L87 Difference]: Start difference. First operand 109 states and 118 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-21 22:23:14,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:14,908 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2023-11-21 22:23:14,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:23:14,909 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-21 22:23:14,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:23:14,911 INFO L225 Difference]: With dead ends: 109 [2023-11-21 22:23:14,911 INFO L226 Difference]: Without dead ends: 109 [2023-11-21 22:23:14,912 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-21 22:23:14,918 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:23:14,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 141 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:23:14,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-21 22:23:14,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2023-11-21 22:23:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 53 states have (on average 2.1132075471698113) internal successors, (112), 103 states have internal predecessors, (112), 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-21 22:23:14,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2023-11-21 22:23:14,936 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 4 [2023-11-21 22:23:14,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:23:14,936 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2023-11-21 22:23:14,936 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-21 22:23:14,936 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2023-11-21 22:23:14,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-21 22:23:14,937 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:23:14,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:14,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 22:23:14,937 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-21 22:23:14,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:14,939 INFO L85 PathProgramCache]: Analyzing trace with hash 429166719, now seen corresponding path program 1 times [2023-11-21 22:23:14,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:14,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464806237] [2023-11-21 22:23:14,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:14,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:15,160 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-21 22:23:15,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:15,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464806237] [2023-11-21 22:23:15,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464806237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:15,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:15,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:23:15,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094753165] [2023-11-21 22:23:15,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:15,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:23:15,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:15,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:23:15,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:23:15,163 INFO L87 Difference]: Start difference. First operand 107 states and 116 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-21 22:23:15,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:15,292 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2023-11-21 22:23:15,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:23:15,293 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-21 22:23:15,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:23:15,295 INFO L225 Difference]: With dead ends: 102 [2023-11-21 22:23:15,295 INFO L226 Difference]: Without dead ends: 102 [2023-11-21 22:23:15,295 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-21 22:23:15,299 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 39 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:23:15,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 96 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:23:15,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-21 22:23:15,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-21 22:23:15,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 53 states have (on average 2.018867924528302) internal successors, (107), 98 states have internal predecessors, (107), 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-21 22:23:15,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2023-11-21 22:23:15,318 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 9 [2023-11-21 22:23:15,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:23:15,319 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2023-11-21 22:23:15,319 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-21 22:23:15,319 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2023-11-21 22:23:15,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-21 22:23:15,319 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:23:15,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:15,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 22:23:15,320 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-21 22:23:15,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:15,321 INFO L85 PathProgramCache]: Analyzing trace with hash 429166720, now seen corresponding path program 1 times [2023-11-21 22:23:15,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:15,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111474795] [2023-11-21 22:23:15,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:15,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:15,506 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-21 22:23:15,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:15,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111474795] [2023-11-21 22:23:15,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111474795] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:15,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:15,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:23:15,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755437123] [2023-11-21 22:23:15,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:15,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:23:15,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:15,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:23:15,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:23:15,509 INFO L87 Difference]: Start difference. First operand 102 states and 111 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-21 22:23:15,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:15,597 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2023-11-21 22:23:15,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:23:15,598 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-21 22:23:15,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:23:15,599 INFO L225 Difference]: With dead ends: 97 [2023-11-21 22:23:15,599 INFO L226 Difference]: Without dead ends: 97 [2023-11-21 22:23:15,600 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-21 22:23:15,601 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 34 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:23:15,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 104 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:23:15,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-21 22:23:15,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-11-21 22:23:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 93 states have internal predecessors, (102), 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-21 22:23:15,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2023-11-21 22:23:15,608 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 9 [2023-11-21 22:23:15,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:23:15,608 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2023-11-21 22:23:15,608 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-21 22:23:15,609 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2023-11-21 22:23:15,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-21 22:23:15,609 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:23:15,609 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:15,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 22:23:15,610 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-21 22:23:15,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:15,611 INFO L85 PathProgramCache]: Analyzing trace with hash 419266502, now seen corresponding path program 1 times [2023-11-21 22:23:15,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:15,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687604338] [2023-11-21 22:23:15,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:15,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:15,838 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-21 22:23:15,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:15,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687604338] [2023-11-21 22:23:15,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687604338] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:15,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:15,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:23:15,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080339026] [2023-11-21 22:23:15,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:15,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 22:23:15,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:15,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 22:23:15,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:23:15,842 INFO L87 Difference]: Start difference. First operand 97 states and 106 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-21 22:23:16,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:16,193 INFO L93 Difference]: Finished difference Result 191 states and 208 transitions. [2023-11-21 22:23:16,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:23:16,194 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-21 22:23:16,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:23:16,196 INFO L225 Difference]: With dead ends: 191 [2023-11-21 22:23:16,196 INFO L226 Difference]: Without dead ends: 191 [2023-11-21 22:23:16,196 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-21 22:23:16,197 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 202 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 22:23:16,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 161 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 22:23:16,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-11-21 22:23:16,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 122. [2023-11-21 22:23:16,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 83 states have (on average 1.819277108433735) internal successors, (151), 117 states have internal predecessors, (151), 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-21 22:23:16,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 155 transitions. [2023-11-21 22:23:16,205 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 155 transitions. Word has length 10 [2023-11-21 22:23:16,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:23:16,205 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 155 transitions. [2023-11-21 22:23:16,206 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-21 22:23:16,206 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 155 transitions. [2023-11-21 22:23:16,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-21 22:23:16,206 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:23:16,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:16,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 22:23:16,207 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-21 22:23:16,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:16,208 INFO L85 PathProgramCache]: Analyzing trace with hash 419266503, now seen corresponding path program 1 times [2023-11-21 22:23:16,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:16,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765187239] [2023-11-21 22:23:16,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:16,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:16,513 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-21 22:23:16,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:16,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765187239] [2023-11-21 22:23:16,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765187239] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:16,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:16,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:23:16,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791555399] [2023-11-21 22:23:16,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:16,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 22:23:16,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:16,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 22:23:16,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:23:16,517 INFO L87 Difference]: Start difference. First operand 122 states and 155 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-21 22:23:16,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:16,738 INFO L93 Difference]: Finished difference Result 144 states and 179 transitions. [2023-11-21 22:23:16,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:23:16,739 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-21 22:23:16,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:23:16,740 INFO L225 Difference]: With dead ends: 144 [2023-11-21 22:23:16,740 INFO L226 Difference]: Without dead ends: 144 [2023-11-21 22:23:16,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-21 22:23:16,741 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 24 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 22:23:16,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 194 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 22:23:16,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-21 22:23:16,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2023-11-21 22:23:16,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 101 states have (on average 1.7128712871287128) internal successors, (173), 136 states have internal predecessors, (173), 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-21 22:23:16,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 179 transitions. [2023-11-21 22:23:16,748 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 179 transitions. Word has length 10 [2023-11-21 22:23:16,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:23:16,748 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 179 transitions. [2023-11-21 22:23:16,748 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-21 22:23:16,749 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 179 transitions. [2023-11-21 22:23:16,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-21 22:23:16,749 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:23:16,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:16,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 22:23:16,750 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-21 22:23:16,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:16,751 INFO L85 PathProgramCache]: Analyzing trace with hash 614000174, now seen corresponding path program 1 times [2023-11-21 22:23:16,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:16,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294963605] [2023-11-21 22:23:16,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:16,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:17,469 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-21 22:23:17,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:17,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294963605] [2023-11-21 22:23:17,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294963605] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:17,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:17,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-21 22:23:17,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690766599] [2023-11-21 22:23:17,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:17,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 22:23:17,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:17,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 22:23:17,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-21 22:23:17,472 INFO L87 Difference]: Start difference. First operand 142 states and 179 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-21 22:23:17,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:17,785 INFO L93 Difference]: Finished difference Result 175 states and 211 transitions. [2023-11-21 22:23:17,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:23:17,788 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-21 22:23:17,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:23:17,790 INFO L225 Difference]: With dead ends: 175 [2023-11-21 22:23:17,790 INFO L226 Difference]: Without dead ends: 175 [2023-11-21 22:23:17,790 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-21 22:23:17,791 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 54 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 22:23:17,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 314 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 22:23:17,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-11-21 22:23:17,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 142. [2023-11-21 22:23:17,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 101 states have (on average 1.702970297029703) internal successors, (172), 136 states have internal predecessors, (172), 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-21 22:23:17,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 178 transitions. [2023-11-21 22:23:17,798 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 178 transitions. Word has length 17 [2023-11-21 22:23:17,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:23:17,798 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 178 transitions. [2023-11-21 22:23:17,798 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-21 22:23:17,798 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2023-11-21 22:23:17,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-21 22:23:17,799 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:23:17,799 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-21 22:23:17,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 22:23:17,799 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-21 22:23:17,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:17,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1065709104, now seen corresponding path program 1 times [2023-11-21 22:23:17,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:17,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416239814] [2023-11-21 22:23:17,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:17,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:18,521 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-21 22:23:18,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:18,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416239814] [2023-11-21 22:23:18,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416239814] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:18,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:18,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-21 22:23:18,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781465281] [2023-11-21 22:23:18,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:18,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 22:23:18,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:18,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 22:23:18,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-21 22:23:18,524 INFO L87 Difference]: Start difference. First operand 142 states and 178 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-21 22:23:18,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:18,804 INFO L93 Difference]: Finished difference Result 136 states and 169 transitions. [2023-11-21 22:23:18,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 22:23:18,805 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-21 22:23:18,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:23:18,806 INFO L225 Difference]: With dead ends: 136 [2023-11-21 22:23:18,806 INFO L226 Difference]: Without dead ends: 136 [2023-11-21 22:23:18,806 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-21 22:23:18,807 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 5 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 22:23:18,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 353 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 22:23:18,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-21 22:23:18,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-11-21 22:23:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 95 states have (on average 1.7157894736842105) internal successors, (163), 130 states have internal predecessors, (163), 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-21 22:23:18,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 169 transitions. [2023-11-21 22:23:18,812 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 169 transitions. Word has length 18 [2023-11-21 22:23:18,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:23:18,812 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 169 transitions. [2023-11-21 22:23:18,812 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-21 22:23:18,812 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 169 transitions. [2023-11-21 22:23:18,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-21 22:23:18,813 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:23:18,813 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] [2023-11-21 22:23:18,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 22:23:18,814 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-21 22:23:18,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:18,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1415007606, now seen corresponding path program 1 times [2023-11-21 22:23:18,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:18,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706796007] [2023-11-21 22:23:18,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:18,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:18,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 22:23:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:18,932 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-21 22:23:18,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:18,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706796007] [2023-11-21 22:23:18,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706796007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:18,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:18,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:23:18,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544006468] [2023-11-21 22:23:18,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:18,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:23:18,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:18,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:23:18,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:23:18,936 INFO L87 Difference]: Start difference. First operand 136 states and 169 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-21 22:23:19,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:19,059 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2023-11-21 22:23:19,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:23:19,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 24 [2023-11-21 22:23:19,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:23:19,062 INFO L225 Difference]: With dead ends: 132 [2023-11-21 22:23:19,062 INFO L226 Difference]: Without dead ends: 132 [2023-11-21 22:23:19,063 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-21 22:23:19,063 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 10 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:23:19,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 169 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:23:19,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-21 22:23:19,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 121. [2023-11-21 22:23:19,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 80 states have (on average 1.6375) internal successors, (131), 115 states have internal predecessors, (131), 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-21 22:23:19,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 137 transitions. [2023-11-21 22:23:19,071 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 137 transitions. Word has length 24 [2023-11-21 22:23:19,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:23:19,072 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 137 transitions. [2023-11-21 22:23:19,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-21 22:23:19,072 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 137 transitions. [2023-11-21 22:23:19,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-21 22:23:19,073 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:23:19,073 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-21 22:23:19,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 22:23:19,074 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-21 22:23:19,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:19,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1637619411, now seen corresponding path program 1 times [2023-11-21 22:23:19,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:19,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881081734] [2023-11-21 22:23:19,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:19,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:19,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 22:23:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:19,660 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-21 22:23:19,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:19,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881081734] [2023-11-21 22:23:19,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881081734] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:23:19,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711929201] [2023-11-21 22:23:19,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:19,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:23:19,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:19,667 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:23:19,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 22:23:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:19,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-21 22:23:19,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:23:19,941 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-21 22:23:19,949 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-21 22:23:20,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:23:20,015 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-21 22:23:20,049 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 22:23:20,049 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-21 22:23:20,281 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-21 22:23:20,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:23:20,375 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-21 22:23:20,392 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-21 22:23:20,392 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-21 22:23:20,465 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:23:20,466 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-21 22:23:20,511 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-21 22:23:20,511 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:23:20,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711929201] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:23:20,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 22:23:20,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 16 [2023-11-21 22:23:20,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960167192] [2023-11-21 22:23:20,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 22:23:20,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-21 22:23:20,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:20,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-21 22:23:20,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=355, Unknown=1, NotChecked=38, Total=462 [2023-11-21 22:23:20,849 INFO L87 Difference]: Start difference. First operand 121 states and 137 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-21 22:23:21,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:21,894 INFO L93 Difference]: Finished difference Result 215 states and 231 transitions. [2023-11-21 22:23:21,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-21 22:23:21,895 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-21 22:23:21,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:23:21,897 INFO L225 Difference]: With dead ends: 215 [2023-11-21 22:23:21,897 INFO L226 Difference]: Without dead ends: 215 [2023-11-21 22:23:21,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=630, Unknown=1, NotChecked=52, Total=812 [2023-11-21 22:23:21,898 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 363 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 196 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-21 22:23:21,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 535 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 911 Invalid, 0 Unknown, 196 Unchecked, 0.8s Time] [2023-11-21 22:23:21,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-11-21 22:23:21,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 131. [2023-11-21 22:23:21,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 89 states have (on average 1.5393258426966292) internal successors, (137), 124 states have internal predecessors, (137), 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-21 22:23:21,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2023-11-21 22:23:21,905 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 147 transitions. Word has length 26 [2023-11-21 22:23:21,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:23:21,905 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 147 transitions. [2023-11-21 22:23:21,905 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-21 22:23:21,906 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2023-11-21 22:23:21,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-21 22:23:21,906 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:23:21,907 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-21 22:23:21,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:22,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:23:22,128 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-21 22:23:22,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:22,129 INFO L85 PathProgramCache]: Analyzing trace with hash -757941946, now seen corresponding path program 1 times [2023-11-21 22:23:22,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:22,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860584056] [2023-11-21 22:23:22,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:22,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:22,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 22:23:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:22,529 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-21 22:23:22,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:22,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860584056] [2023-11-21 22:23:22,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860584056] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:23:22,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69672495] [2023-11-21 22:23:22,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:22,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:23:22,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:22,531 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:23:22,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 22:23:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:22,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-21 22:23:22,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:23:22,695 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-21 22:23:22,720 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-21 22:23:22,802 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-21 22:23:22,802 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-21 22:23:22,828 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-21 22:23:22,828 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-21 22:23:22,841 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-21 22:23:22,842 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:23:22,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69672495] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:23:22,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 22:23:22,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2023-11-21 22:23:22,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045668241] [2023-11-21 22:23:22,950 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 22:23:22,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-21 22:23:22,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:22,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-21 22:23:22,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2023-11-21 22:23:22,951 INFO L87 Difference]: Start difference. First operand 131 states and 147 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-21 22:23:23,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:23,357 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2023-11-21 22:23:23,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:23:23,358 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-21 22:23:23,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:23:23,360 INFO L225 Difference]: With dead ends: 160 [2023-11-21 22:23:23,360 INFO L226 Difference]: Without dead ends: 160 [2023-11-21 22:23:23,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=176, Unknown=1, NotChecked=28, Total=272 [2023-11-21 22:23:23,361 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 121 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 22:23:23,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 236 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 351 Invalid, 0 Unknown, 131 Unchecked, 0.3s Time] [2023-11-21 22:23:23,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-11-21 22:23:23,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 132. [2023-11-21 22:23:23,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 91 states have (on average 1.5384615384615385) internal successors, (140), 125 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-21 22:23:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 150 transitions. [2023-11-21 22:23:23,367 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 150 transitions. Word has length 27 [2023-11-21 22:23:23,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:23:23,367 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 150 transitions. [2023-11-21 22:23:23,368 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-21 22:23:23,368 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 150 transitions. [2023-11-21 22:23:23,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-21 22:23:23,369 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:23:23,369 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-21 22:23:23,405 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:23,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:23:23,571 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-21 22:23:23,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:23,571 INFO L85 PathProgramCache]: Analyzing trace with hash -757941945, now seen corresponding path program 1 times [2023-11-21 22:23:23,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:23,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469191179] [2023-11-21 22:23:23,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:23,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:23,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 22:23:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:24,169 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-21 22:23:24,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:24,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469191179] [2023-11-21 22:23:24,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469191179] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:23:24,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128941670] [2023-11-21 22:23:24,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:24,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:23:24,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:24,171 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:23:24,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 22:23:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:24,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-21 22:23:24,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:23:24,359 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-21 22:23:24,366 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-21 22:23:24,431 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-21 22:23:24,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:23:24,521 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-21 22:23:24,529 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 22:23:24,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-21 22:23:24,607 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:23:24,607 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-21 22:23:24,649 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-21 22:23:24,649 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:23:24,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128941670] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:23:24,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 22:23:24,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2023-11-21 22:23:24,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699599279] [2023-11-21 22:23:24,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 22:23:24,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-21 22:23:24,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:24,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-21 22:23:24,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=254, Unknown=1, NotChecked=32, Total=342 [2023-11-21 22:23:24,981 INFO L87 Difference]: Start difference. First operand 132 states and 150 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-21 22:23:25,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:25,895 INFO L93 Difference]: Finished difference Result 254 states and 285 transitions. [2023-11-21 22:23:25,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 22:23:25,896 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-21 22:23:25,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:23:25,898 INFO L225 Difference]: With dead ends: 254 [2023-11-21 22:23:25,898 INFO L226 Difference]: Without dead ends: 254 [2023-11-21 22:23:25,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=376, Unknown=1, NotChecked=40, Total=506 [2023-11-21 22:23:25,900 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 186 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-21 22:23:25,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 393 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 683 Invalid, 0 Unknown, 172 Unchecked, 0.7s Time] [2023-11-21 22:23:25,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-11-21 22:23:25,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 204. [2023-11-21 22:23:25,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 158 states have (on average 1.518987341772152) internal successors, (240), 192 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-21 22:23:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 255 transitions. [2023-11-21 22:23:25,911 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 255 transitions. Word has length 27 [2023-11-21 22:23:25,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:23:25,912 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 255 transitions. [2023-11-21 22:23:25,912 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-21 22:23:25,912 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 255 transitions. [2023-11-21 22:23:25,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-21 22:23:25,914 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:23:25,914 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-21 22:23:25,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:26,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:23:26,127 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-21 22:23:26,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:26,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1617805816, now seen corresponding path program 1 times [2023-11-21 22:23:26,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:26,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535587576] [2023-11-21 22:23:26,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:26,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:27,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 22:23:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:28,742 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-21 22:23:28,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:28,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535587576] [2023-11-21 22:23:28,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535587576] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:23:28,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933136755] [2023-11-21 22:23:28,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:28,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:23:28,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:28,745 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:23:28,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-21 22:23:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:28,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-21 22:23:28,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:23:28,957 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-21 22:23:28,989 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-21 22:23:28,990 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-21 22:23:29,062 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-21 22:23:29,293 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-21 22:23:29,302 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-21 22:23:29,383 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:23:29,384 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-21 22:23:29,391 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-21 22:23:29,425 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:23:29,425 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-21 22:23:29,434 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-21 22:23:29,567 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:23:29,568 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-21 22:23:29,589 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:23:29,589 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-21 22:23:29,758 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:23:29,768 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-21 22:23:29,769 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-21 22:23:29,972 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2023-11-21 22:23:29,972 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-21 22:23:29,986 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-21 22:23:30,043 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-21 22:23:30,057 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-21 22:23:30,121 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-21 22:23:30,127 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-21 22:23:30,150 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-21 22:23:30,156 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-21 22:23:30,215 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-21 22:23:30,219 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-21 22:23:30,258 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-21 22:23:30,258 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:23:30,365 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_append_~head.offset 4))) (and (forall ((v_ArrVal_1093 (Array Int Int)) (v_ArrVal_1092 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_1092) c_append_~head.base) .cse0) 9) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_1093) c_append_~head.base) .cse0)))) (forall ((v_ArrVal_1092 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_1092) c_append_~head.base) .cse0) 5))))) is different from false [2023-11-21 22:23:30,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:23:30,974 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-21 22:23:30,987 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-21 22:23:31,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:23:31,003 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-21 22:23:31,014 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-21 22:23:31,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:23:31,048 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-21 22:23:31,097 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-21 22:23:31,116 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-21 22:23:31,134 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-21 22:23:31,155 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-21 22:23:31,170 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-21 22:23:31,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933136755] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:23:31,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 22:23:31,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 28 [2023-11-21 22:23:31,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146192347] [2023-11-21 22:23:31,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 22:23:31,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-21 22:23:31,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:31,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-21 22:23:31,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1080, Unknown=2, NotChecked=66, Total=1260 [2023-11-21 22:23:31,399 INFO L87 Difference]: Start difference. First operand 204 states and 255 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-21 22:23:33,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:33,656 INFO L93 Difference]: Finished difference Result 243 states and 301 transitions. [2023-11-21 22:23:33,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-21 22:23:33,657 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-21 22:23:33,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:23:33,661 INFO L225 Difference]: With dead ends: 243 [2023-11-21 22:23:33,661 INFO L226 Difference]: Without dead ends: 243 [2023-11-21 22:23:33,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=275, Invalid=1797, Unknown=2, NotChecked=88, Total=2162 [2023-11-21 22:23:33,663 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 226 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-21 22:23:33,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 639 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-21 22:23:33,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-11-21 22:23:33,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 203. [2023-11-21 22:23:33,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 158 states have (on average 1.4873417721518987) internal successors, (235), 191 states have internal predecessors, (235), 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-21 22:23:33,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 250 transitions. [2023-11-21 22:23:33,671 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 250 transitions. Word has length 33 [2023-11-21 22:23:33,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:23:33,672 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 250 transitions. [2023-11-21 22:23:33,672 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-21 22:23:33,672 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 250 transitions. [2023-11-21 22:23:33,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-21 22:23:33,673 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:23:33,673 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-21 22:23:33,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:33,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-21 22:23:33,894 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-21 22:23:33,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:33,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1617805817, now seen corresponding path program 1 times [2023-11-21 22:23:33,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:33,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928709641] [2023-11-21 22:23:33,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:33,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:34,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 22:23:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:35,224 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-21 22:23:35,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:35,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928709641] [2023-11-21 22:23:35,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928709641] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:23:35,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632529311] [2023-11-21 22:23:35,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:35,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:23:35,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:35,227 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:23:35,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-21 22:23:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:35,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-21 22:23:35,461 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:23:35,467 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-21 22:23:35,506 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-21 22:23:35,506 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-21 22:23:35,771 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-21 22:23:35,834 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:23:35,835 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-21 22:23:35,845 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-21 22:23:35,917 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:23:35,917 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-21 22:23:36,006 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:23:36,017 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-21 22:23:36,017 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-21 22:23:36,166 INFO L349 Elim1Store]: treesize reduction 58, result has 34.8 percent of original size [2023-11-21 22:23:36,166 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-21 22:23:36,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2023-11-21 22:23:36,300 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-21 22:23:36,322 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-21 22:23:36,364 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-21 22:23:36,404 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-21 22:23:36,404 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:23:36,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:23:36,776 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-21 22:23:36,781 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-21 22:23:36,789 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-21 22:23:36,803 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-21 22:23:36,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632529311] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:23:36,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 22:23:36,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 25 [2023-11-21 22:23:36,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969935532] [2023-11-21 22:23:36,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 22:23:36,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-21 22:23:36,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:36,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-21 22:23:36,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=879, Unknown=10, NotChecked=0, Total=992 [2023-11-21 22:23:36,892 INFO L87 Difference]: Start difference. First operand 203 states and 250 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-21 22:23:38,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:38,273 INFO L93 Difference]: Finished difference Result 242 states and 300 transitions. [2023-11-21 22:23:38,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-21 22:23:38,274 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-21 22:23:38,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:23:38,276 INFO L225 Difference]: With dead ends: 242 [2023-11-21 22:23:38,276 INFO L226 Difference]: Without dead ends: 242 [2023-11-21 22:23:38,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=224, Invalid=1326, Unknown=10, NotChecked=0, Total=1560 [2023-11-21 22:23:38,278 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 104 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-21 22:23:38,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 680 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-21 22:23:38,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-11-21 22:23:38,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 203. [2023-11-21 22:23:38,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 158 states have (on average 1.481012658227848) internal successors, (234), 191 states have internal predecessors, (234), 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-21 22:23:38,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 249 transitions. [2023-11-21 22:23:38,294 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 249 transitions. Word has length 33 [2023-11-21 22:23:38,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:23:38,295 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 249 transitions. [2023-11-21 22:23:38,295 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-21 22:23:38,296 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 249 transitions. [2023-11-21 22:23:38,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-21 22:23:38,306 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:23:38,306 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-21 22:23:38,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:38,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-21 22:23:38,529 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-21 22:23:38,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:38,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1263010642, now seen corresponding path program 1 times [2023-11-21 22:23:38,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:38,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270397105] [2023-11-21 22:23:38,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:38,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:39,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 22:23:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:41,671 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-21 22:23:41,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:41,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270397105] [2023-11-21 22:23:41,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270397105] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:23:41,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507524706] [2023-11-21 22:23:41,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:41,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:23:41,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:41,673 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:23:41,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_370953d5-013d-4d97-b6a2-2bab167f6cc7/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-21 22:23:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:41,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-21 22:23:41,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:23:41,908 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-21 22:23:41,931 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 22:23:41,932 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-21 22:23:41,983 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-21 22:23:41,991 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-21 22:23:42,070 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-21 22:23:42,081 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-21 22:23:44,604 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-21 22:23:44,611 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-21 22:23:46,801 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-21 22:23:48,831 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-21 22:23:50,017 INFO L349 Elim1Store]: treesize reduction 197, result has 9.2 percent of original size [2023-11-21 22:23:50,018 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-21 22:23:51,472 INFO L349 Elim1Store]: treesize reduction 197, result has 9.2 percent of original size [2023-11-21 22:23:51,473 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-21 22:23:53,026 INFO L224 Elim1Store]: Index analysis took 1345 ms