./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/length_test03-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/length_test03-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d477dcc38abb71f88978d460e8393ef9ba09f24c134f3de362c4df2a3599c9a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:19:03,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:19:03,441 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 16:19:03,445 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:19:03,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:19:03,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:19:03,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:19:03,484 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:19:03,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:19:03,486 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:19:03,487 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:19:03,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:19:03,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:19:03,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:19:03,502 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:19:03,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:19:03,503 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:19:03,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:19:03,503 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:19:03,504 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:19:03,504 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:19:03,507 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:19:03,508 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:19:03,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:19:03,508 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:19:03,508 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:19:03,508 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:19:03,508 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:19:03,509 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:19:03,509 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:19:03,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:19:03,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:19:03,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:19:03,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:19:03,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:19:03,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:19:03,510 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:19:03,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:19:03,510 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:19:03,510 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:19:03,510 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:19:03,511 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:19:03,512 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8d477dcc38abb71f88978d460e8393ef9ba09f24c134f3de362c4df2a3599c9a [2024-10-24 16:19:03,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:19:03,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:19:03,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:19:03,720 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:19:03,720 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:19:03,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2024-10-24 16:19:05,095 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:19:05,316 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:19:05,316 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2024-10-24 16:19:05,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86a734669/2b51e7229e384cfeb9a188870d4d2d68/FLAG4b0ee3a7a [2024-10-24 16:19:05,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86a734669/2b51e7229e384cfeb9a188870d4d2d68 [2024-10-24 16:19:05,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:19:05,668 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:19:05,669 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:19:05,669 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:19:05,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:19:05,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:19:05" (1/1) ... [2024-10-24 16:19:05,674 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@238a07fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:19:05, skipping insertion in model container [2024-10-24 16:19:05,674 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:19:05" (1/1) ... [2024-10-24 16:19:05,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:19:05,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:19:05,920 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:19:05,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:19:05,994 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:19:05,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:19:05 WrapperNode [2024-10-24 16:19:05,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:19:05,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:19:05,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:19:05,996 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:19:06,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:19:05" (1/1) ... [2024-10-24 16:19:06,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:19:05" (1/1) ... [2024-10-24 16:19:06,027 INFO L138 Inliner]: procedures = 123, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 101 [2024-10-24 16:19:06,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:19:06,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:19:06,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:19:06,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:19:06,037 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:19:05" (1/1) ... [2024-10-24 16:19:06,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:19:05" (1/1) ... [2024-10-24 16:19:06,040 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:19:05" (1/1) ... [2024-10-24 16:19:06,056 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 13, 10]. 52 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 13 writes are split as follows [0, 7, 6]. [2024-10-24 16:19:06,056 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:19:05" (1/1) ... [2024-10-24 16:19:06,056 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:19:05" (1/1) ... [2024-10-24 16:19:06,064 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:19:05" (1/1) ... [2024-10-24 16:19:06,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:19:05" (1/1) ... [2024-10-24 16:19:06,069 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:19:05" (1/1) ... [2024-10-24 16:19:06,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:19:05" (1/1) ... [2024-10-24 16:19:06,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:19:06,073 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:19:06,073 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:19:06,073 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:19:06,074 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:19:05" (1/1) ... [2024-10-24 16:19:06,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:19:06,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:19:06,116 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 16:19:06,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 16:19:06,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 16:19:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 16:19:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 16:19:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 16:19:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 16:19:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 16:19:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 16:19:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 16:19:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 16:19:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 16:19:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 16:19:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:19:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 16:19:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 16:19:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 16:19:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:19:06,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:19:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure append [2024-10-24 16:19:06,159 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2024-10-24 16:19:06,301 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:19:06,302 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:19:06,652 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-10-24 16:19:06,652 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:19:06,699 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:19:06,699 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-24 16:19:06,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:19:06 BoogieIcfgContainer [2024-10-24 16:19:06,700 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:19:06,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:19:06,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:19:06,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:19:06,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:19:05" (1/3) ... [2024-10-24 16:19:06,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b97834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:19:06, skipping insertion in model container [2024-10-24 16:19:06,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:19:05" (2/3) ... [2024-10-24 16:19:06,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b97834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:19:06, skipping insertion in model container [2024-10-24 16:19:06,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:19:06" (3/3) ... [2024-10-24 16:19:06,709 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03-2.i [2024-10-24 16:19:06,738 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:19:06,738 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2024-10-24 16:19:06,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:19:06,786 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@7be3877d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:19:06,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2024-10-24 16:19:06,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 50 states have (on average 2.38) internal successors, (119), 109 states have internal predecessors, (119), 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) [2024-10-24 16:19:06,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-24 16:19:06,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:06,795 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-24 16:19:06,796 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:06,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:06,801 INFO L85 PathProgramCache]: Analyzing trace with hash 7041, now seen corresponding path program 1 times [2024-10-24 16:19:06,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:06,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611356021] [2024-10-24 16:19:06,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:06,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:06,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:06,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:06,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611356021] [2024-10-24 16:19:06,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611356021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:19:06,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:19:06,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:19:06,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930606743] [2024-10-24 16:19:06,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:19:06,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:19:06,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:19:06,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:19:06,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:19:06,997 INFO L87 Difference]: Start difference. First operand has 113 states, 50 states have (on average 2.38) internal successors, (119), 109 states have internal predecessors, (119), 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) [2024-10-24 16:19:07,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:19:07,164 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2024-10-24 16:19:07,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:19:07,166 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 [2024-10-24 16:19:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:19:07,173 INFO L225 Difference]: With dead ends: 146 [2024-10-24 16:19:07,174 INFO L226 Difference]: Without dead ends: 145 [2024-10-24 16:19:07,175 INFO L431 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 [2024-10-24 16:19:07,177 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 43 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:19:07,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 133 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:19:07,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-24 16:19:07,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 110. [2024-10-24 16:19:07,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 50 states have (on average 2.24) internal successors, (112), 106 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) [2024-10-24 16:19:07,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2024-10-24 16:19:07,205 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 2 [2024-10-24 16:19:07,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:19:07,206 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2024-10-24 16:19:07,206 INFO L472 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) [2024-10-24 16:19:07,206 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2024-10-24 16:19:07,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-24 16:19:07,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:07,206 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-24 16:19:07,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 16:19:07,207 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:07,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:07,207 INFO L85 PathProgramCache]: Analyzing trace with hash 7042, now seen corresponding path program 1 times [2024-10-24 16:19:07,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:07,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796677339] [2024-10-24 16:19:07,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:07,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:07,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:07,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:07,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796677339] [2024-10-24 16:19:07,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796677339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:19:07,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:19:07,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:19:07,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560488225] [2024-10-24 16:19:07,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:19:07,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:19:07,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:19:07,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:19:07,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:19:07,294 INFO L87 Difference]: Start difference. First operand 110 states and 116 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) [2024-10-24 16:19:07,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:19:07,460 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2024-10-24 16:19:07,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:19:07,461 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 [2024-10-24 16:19:07,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:19:07,462 INFO L225 Difference]: With dead ends: 110 [2024-10-24 16:19:07,462 INFO L226 Difference]: Without dead ends: 110 [2024-10-24 16:19:07,462 INFO L431 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 [2024-10-24 16:19:07,463 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 8 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:19:07,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 148 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:19:07,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-24 16:19:07,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2024-10-24 16:19:07,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 50 states have (on average 2.2) internal successors, (110), 104 states have internal predecessors, (110), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:19:07,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2024-10-24 16:19:07,481 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 2 [2024-10-24 16:19:07,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:19:07,481 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2024-10-24 16:19:07,481 INFO L472 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) [2024-10-24 16:19:07,481 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2024-10-24 16:19:07,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 16:19:07,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:07,485 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 16:19:07,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 16:19:07,485 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:07,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:07,486 INFO L85 PathProgramCache]: Analyzing trace with hash 6771465, now seen corresponding path program 1 times [2024-10-24 16:19:07,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:07,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533203862] [2024-10-24 16:19:07,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:07,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:07,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:07,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:07,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533203862] [2024-10-24 16:19:07,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533203862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:19:07,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:19:07,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:19:07,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231480863] [2024-10-24 16:19:07,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:19:07,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:19:07,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:19:07,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:19:07,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:19:07,544 INFO L87 Difference]: Start difference. First operand 108 states and 114 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) [2024-10-24 16:19:07,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:19:07,647 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2024-10-24 16:19:07,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:19:07,647 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 [2024-10-24 16:19:07,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:19:07,648 INFO L225 Difference]: With dead ends: 123 [2024-10-24 16:19:07,648 INFO L226 Difference]: Without dead ends: 123 [2024-10-24 16:19:07,648 INFO L431 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 [2024-10-24 16:19:07,649 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 20 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:19:07,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 136 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:19:07,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-24 16:19:07,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 111. [2024-10-24 16:19:07,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 55 states have (on average 2.109090909090909) internal successors, (116), 107 states have internal predecessors, (116), 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) [2024-10-24 16:19:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2024-10-24 16:19:07,664 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 4 [2024-10-24 16:19:07,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:19:07,664 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2024-10-24 16:19:07,664 INFO L472 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) [2024-10-24 16:19:07,665 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2024-10-24 16:19:07,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 16:19:07,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:07,665 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 16:19:07,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 16:19:07,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:07,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:07,666 INFO L85 PathProgramCache]: Analyzing trace with hash 6771466, now seen corresponding path program 1 times [2024-10-24 16:19:07,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:07,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537401004] [2024-10-24 16:19:07,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:07,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:07,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:07,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537401004] [2024-10-24 16:19:07,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537401004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:19:07,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:19:07,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:19:07,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376454939] [2024-10-24 16:19:07,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:19:07,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:19:07,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:19:07,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:19:07,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:19:07,765 INFO L87 Difference]: Start difference. First operand 111 states and 120 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) [2024-10-24 16:19:07,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:19:07,874 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2024-10-24 16:19:07,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:19:07,875 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 [2024-10-24 16:19:07,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:19:07,876 INFO L225 Difference]: With dead ends: 111 [2024-10-24 16:19:07,876 INFO L226 Difference]: Without dead ends: 111 [2024-10-24 16:19:07,876 INFO L431 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 [2024-10-24 16:19:07,882 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 3 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:19:07,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 147 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:19:07,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-24 16:19:07,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2024-10-24 16:19:07,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 55 states have (on average 2.0727272727272728) 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) [2024-10-24 16:19:07,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2024-10-24 16:19:07,913 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 4 [2024-10-24 16:19:07,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:19:07,914 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2024-10-24 16:19:07,914 INFO L472 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) [2024-10-24 16:19:07,914 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2024-10-24 16:19:07,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 16:19:07,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:07,914 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:19:07,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 16:19:07,915 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:07,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:07,915 INFO L85 PathProgramCache]: Analyzing trace with hash -489860542, now seen corresponding path program 1 times [2024-10-24 16:19:07,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:07,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484143120] [2024-10-24 16:19:07,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:07,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:08,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:08,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:08,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484143120] [2024-10-24 16:19:08,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484143120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:19:08,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:19:08,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:19:08,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179801356] [2024-10-24 16:19:08,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:19:08,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:19:08,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:19:08,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:19:08,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:19:08,009 INFO L87 Difference]: Start difference. First operand 109 states and 118 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) [2024-10-24 16:19:08,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:19:08,083 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2024-10-24 16:19:08,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:19:08,083 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 [2024-10-24 16:19:08,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:19:08,084 INFO L225 Difference]: With dead ends: 104 [2024-10-24 16:19:08,084 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 16:19:08,084 INFO L431 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 [2024-10-24 16:19:08,085 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 31 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:19:08,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 105 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:19:08,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 16:19:08,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-24 16:19:08,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 55 states have (on average 1.981818181818182) internal successors, (109), 100 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) [2024-10-24 16:19:08,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2024-10-24 16:19:08,094 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 9 [2024-10-24 16:19:08,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:19:08,094 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2024-10-24 16:19:08,094 INFO L472 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) [2024-10-24 16:19:08,094 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2024-10-24 16:19:08,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 16:19:08,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:08,094 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:19:08,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 16:19:08,095 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:08,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:08,097 INFO L85 PathProgramCache]: Analyzing trace with hash -489860541, now seen corresponding path program 1 times [2024-10-24 16:19:08,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:08,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020162130] [2024-10-24 16:19:08,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:08,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:08,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:08,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020162130] [2024-10-24 16:19:08,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020162130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:19:08,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:19:08,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:19:08,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552330038] [2024-10-24 16:19:08,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:19:08,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:19:08,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:19:08,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:19:08,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:19:08,189 INFO L87 Difference]: Start difference. First operand 104 states and 113 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) [2024-10-24 16:19:08,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:19:08,257 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2024-10-24 16:19:08,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:19:08,258 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 [2024-10-24 16:19:08,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:19:08,258 INFO L225 Difference]: With dead ends: 99 [2024-10-24 16:19:08,258 INFO L226 Difference]: Without dead ends: 99 [2024-10-24 16:19:08,259 INFO L431 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 [2024-10-24 16:19:08,260 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 31 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:19:08,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 113 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:19:08,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-24 16:19:08,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-24 16:19:08,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 95 states have internal predecessors, (104), 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) [2024-10-24 16:19:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2024-10-24 16:19:08,268 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 9 [2024-10-24 16:19:08,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:19:08,268 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2024-10-24 16:19:08,269 INFO L472 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) [2024-10-24 16:19:08,269 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2024-10-24 16:19:08,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 16:19:08,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:08,269 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:19:08,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 16:19:08,270 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:08,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:08,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1994192483, now seen corresponding path program 1 times [2024-10-24 16:19:08,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:08,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755079419] [2024-10-24 16:19:08,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:08,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:08,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:08,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755079419] [2024-10-24 16:19:08,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755079419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:19:08,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:19:08,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:19:08,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824733421] [2024-10-24 16:19:08,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:19:08,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:19:08,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:19:08,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:19:08,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:19:08,522 INFO L87 Difference]: Start difference. First operand 99 states and 108 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) [2024-10-24 16:19:08,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:19:08,746 INFO L93 Difference]: Finished difference Result 191 states and 212 transitions. [2024-10-24 16:19:08,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:19:08,747 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 [2024-10-24 16:19:08,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:19:08,748 INFO L225 Difference]: With dead ends: 191 [2024-10-24 16:19:08,748 INFO L226 Difference]: Without dead ends: 191 [2024-10-24 16:19:08,748 INFO L431 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 [2024-10-24 16:19:08,750 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 199 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:19:08,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 157 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:19:08,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-24 16:19:08,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 125. [2024-10-24 16:19:08,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 86 states have (on average 1.7906976744186047) internal successors, (154), 120 states have internal predecessors, (154), 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) [2024-10-24 16:19:08,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 158 transitions. [2024-10-24 16:19:08,762 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 158 transitions. Word has length 10 [2024-10-24 16:19:08,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:19:08,762 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 158 transitions. [2024-10-24 16:19:08,762 INFO L472 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) [2024-10-24 16:19:08,762 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 158 transitions. [2024-10-24 16:19:08,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 16:19:08,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:08,763 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:19:08,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 16:19:08,763 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:08,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:08,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1994192484, now seen corresponding path program 1 times [2024-10-24 16:19:08,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:08,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178455450] [2024-10-24 16:19:08,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:08,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:09,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:09,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:09,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178455450] [2024-10-24 16:19:09,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178455450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:19:09,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:19:09,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:19:09,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997469067] [2024-10-24 16:19:09,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:19:09,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:19:09,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:19:09,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:19:09,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:19:09,012 INFO L87 Difference]: Start difference. First operand 125 states and 158 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) [2024-10-24 16:19:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:19:09,172 INFO L93 Difference]: Finished difference Result 143 states and 179 transitions. [2024-10-24 16:19:09,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:19:09,172 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 [2024-10-24 16:19:09,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:19:09,176 INFO L225 Difference]: With dead ends: 143 [2024-10-24 16:19:09,176 INFO L226 Difference]: Without dead ends: 143 [2024-10-24 16:19:09,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:19:09,177 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 19 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:19:09,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 240 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:19:09,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-24 16:19:09,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2024-10-24 16:19:09,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 101 states have (on average 1.7128712871287128) internal successors, (173), 135 states have internal predecessors, (173), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:19:09,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 179 transitions. [2024-10-24 16:19:09,181 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 179 transitions. Word has length 10 [2024-10-24 16:19:09,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:19:09,181 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 179 transitions. [2024-10-24 16:19:09,181 INFO L472 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) [2024-10-24 16:19:09,181 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 179 transitions. [2024-10-24 16:19:09,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 16:19:09,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:09,182 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:19:09,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 16:19:09,182 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:09,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:09,183 INFO L85 PathProgramCache]: Analyzing trace with hash 629331503, now seen corresponding path program 1 times [2024-10-24 16:19:09,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:09,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136891768] [2024-10-24 16:19:09,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:09,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:09,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:09,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:09,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136891768] [2024-10-24 16:19:09,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136891768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:19:09,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:19:09,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 16:19:09,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634595558] [2024-10-24 16:19:09,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:19:09,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:19:09,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:19:09,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:19:09,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:19:09,518 INFO L87 Difference]: Start difference. First operand 141 states and 179 transitions. Second operand has 8 states, 8 states have (on average 2.0) 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) [2024-10-24 16:19:09,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:19:09,758 INFO L93 Difference]: Finished difference Result 143 states and 178 transitions. [2024-10-24 16:19:09,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:19:09,759 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) 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 [2024-10-24 16:19:09,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:19:09,759 INFO L225 Difference]: With dead ends: 143 [2024-10-24 16:19:09,760 INFO L226 Difference]: Without dead ends: 143 [2024-10-24 16:19:09,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:19:09,760 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 28 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:19:09,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 422 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:19:09,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-24 16:19:09,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2024-10-24 16:19:09,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 101 states have (on average 1.702970297029703) internal successors, (172), 135 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:19:09,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 178 transitions. [2024-10-24 16:19:09,764 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 178 transitions. Word has length 17 [2024-10-24 16:19:09,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:19:09,764 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 178 transitions. [2024-10-24 16:19:09,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) 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) [2024-10-24 16:19:09,765 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 178 transitions. [2024-10-24 16:19:09,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 16:19:09,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:09,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:19:09,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 16:19:09,765 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:09,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:09,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1867377042, now seen corresponding path program 1 times [2024-10-24 16:19:09,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:09,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644819256] [2024-10-24 16:19:09,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:09,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:10,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:10,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:10,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644819256] [2024-10-24 16:19:10,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644819256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:19:10,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:19:10,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 16:19:10,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826771052] [2024-10-24 16:19:10,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:19:10,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:19:10,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:19:10,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:19:10,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:19:10,058 INFO L87 Difference]: Start difference. First operand 141 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) [2024-10-24 16:19:10,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:19:10,234 INFO L93 Difference]: Finished difference Result 166 states and 201 transitions. [2024-10-24 16:19:10,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:19:10,234 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 [2024-10-24 16:19:10,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:19:10,235 INFO L225 Difference]: With dead ends: 166 [2024-10-24 16:19:10,235 INFO L226 Difference]: Without dead ends: 166 [2024-10-24 16:19:10,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:19:10,236 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 128 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:19:10,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 341 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:19:10,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-24 16:19:10,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 134. [2024-10-24 16:19:10,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 95 states have (on average 1.694736842105263) internal successors, (161), 128 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:19:10,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 167 transitions. [2024-10-24 16:19:10,239 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 167 transitions. Word has length 18 [2024-10-24 16:19:10,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:19:10,239 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 167 transitions. [2024-10-24 16:19:10,239 INFO L472 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) [2024-10-24 16:19:10,239 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 167 transitions. [2024-10-24 16:19:10,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-24 16:19:10,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:10,240 INFO L215 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] [2024-10-24 16:19:10,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 16:19:10,240 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:10,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:10,241 INFO L85 PathProgramCache]: Analyzing trace with hash 116187578, now seen corresponding path program 1 times [2024-10-24 16:19:10,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:10,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292898295] [2024-10-24 16:19:10,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:10,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:10,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 16:19:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:10,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:10,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:10,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292898295] [2024-10-24 16:19:10,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292898295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:19:10,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:19:10,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:19:10,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409631374] [2024-10-24 16:19:10,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:19:10,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:19:10,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:19:10,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:19:10,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:19:10,341 INFO L87 Difference]: Start difference. First operand 134 states and 167 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) [2024-10-24 16:19:10,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:19:10,468 INFO L93 Difference]: Finished difference Result 128 states and 146 transitions. [2024-10-24 16:19:10,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:19:10,468 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 [2024-10-24 16:19:10,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:19:10,469 INFO L225 Difference]: With dead ends: 128 [2024-10-24 16:19:10,470 INFO L226 Difference]: Without dead ends: 128 [2024-10-24 16:19:10,470 INFO L431 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 [2024-10-24 16:19:10,471 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 10 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:19:10,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 176 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:19:10,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-24 16:19:10,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 117. [2024-10-24 16:19:10,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 78 states have (on average 1.641025641025641) internal successors, (128), 111 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:19:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 134 transitions. [2024-10-24 16:19:10,474 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 134 transitions. Word has length 24 [2024-10-24 16:19:10,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:19:10,475 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 134 transitions. [2024-10-24 16:19:10,475 INFO L472 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) [2024-10-24 16:19:10,475 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions. [2024-10-24 16:19:10,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-24 16:19:10,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:10,476 INFO L215 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] [2024-10-24 16:19:10,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 16:19:10,476 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:10,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:10,476 INFO L85 PathProgramCache]: Analyzing trace with hash 36702541, now seen corresponding path program 1 times [2024-10-24 16:19:10,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:10,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580863175] [2024-10-24 16:19:10,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:10,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:10,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 16:19:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:10,813 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:10,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:10,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580863175] [2024-10-24 16:19:10,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580863175] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:19:10,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149588829] [2024-10-24 16:19:10,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:10,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:19:10,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:19:10,816 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:19:10,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 16:19:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:10,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-24 16:19:10,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:19:11,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:19:11,159 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 [2024-10-24 16:19:11,170 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:19:11,171 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 [2024-10-24 16:19:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:11,179 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:19:11,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2024-10-24 16:19:11,493 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-10-24 16:19:11,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2024-10-24 16:19:11,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:19:11,605 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 29 treesize of output 33 [2024-10-24 16:19:11,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:19:11,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 76 [2024-10-24 16:19:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:11,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149588829] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:19:11,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:19:11,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2024-10-24 16:19:11,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565908964] [2024-10-24 16:19:11,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:19:11,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 16:19:11,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:19:11,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 16:19:11,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2024-10-24 16:19:11,751 INFO L87 Difference]: Start difference. First operand 117 states and 134 transitions. Second operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 17 states have internal predecessors, (57), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:19:12,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:19:12,316 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2024-10-24 16:19:12,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 16:19:12,317 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 17 states have internal predecessors, (57), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-10-24 16:19:12,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:19:12,317 INFO L225 Difference]: With dead ends: 151 [2024-10-24 16:19:12,318 INFO L226 Difference]: Without dead ends: 151 [2024-10-24 16:19:12,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2024-10-24 16:19:12,318 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 376 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:19:12,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 358 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 16:19:12,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-24 16:19:12,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 114. [2024-10-24 16:19:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 76 states have (on average 1.5526315789473684) internal successors, (118), 108 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:19:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2024-10-24 16:19:12,321 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 26 [2024-10-24 16:19:12,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:19:12,322 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2024-10-24 16:19:12,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 17 states have internal predecessors, (57), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:19:12,322 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2024-10-24 16:19:12,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-24 16:19:12,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:12,322 INFO L215 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] [2024-10-24 16:19:12,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 16:19:12,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-24 16:19:12,527 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:12,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:12,527 INFO L85 PathProgramCache]: Analyzing trace with hash -393568986, now seen corresponding path program 1 times [2024-10-24 16:19:12,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:12,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393762214] [2024-10-24 16:19:12,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:12,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:12,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 16:19:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:12,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:12,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393762214] [2024-10-24 16:19:12,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393762214] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:19:12,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534256565] [2024-10-24 16:19:12,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:12,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:19:12,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:19:12,780 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:19:12,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 16:19:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:12,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 16:19:12,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:19:12,887 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 [2024-10-24 16:19:12,901 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base 1))) is different from true [2024-10-24 16:19:12,927 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-24 16:19:12,928 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 [2024-10-24 16:19:12,946 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-24 16:19:12,946 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 [2024-10-24 16:19:12,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-24 16:19:12,953 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:19:13,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:13,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534256565] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:19:13,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:19:13,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 11 [2024-10-24 16:19:13,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120880087] [2024-10-24 16:19:13,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:19:13,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 16:19:13,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:19:13,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 16:19:13,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=83, Unknown=1, NotChecked=18, Total=132 [2024-10-24 16:19:13,053 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 16:19:13,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:19:13,515 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2024-10-24 16:19:13,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 16:19:13,516 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-10-24 16:19:13,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:19:13,516 INFO L225 Difference]: With dead ends: 149 [2024-10-24 16:19:13,516 INFO L226 Difference]: Without dead ends: 149 [2024-10-24 16:19:13,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=340, Unknown=1, NotChecked=40, Total=506 [2024-10-24 16:19:13,517 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 135 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:19:13,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 245 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 342 Invalid, 0 Unknown, 130 Unchecked, 0.2s Time] [2024-10-24 16:19:13,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-24 16:19:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 122. [2024-10-24 16:19:13,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 84 states have (on average 1.5238095238095237) internal successors, (128), 116 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:19:13,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2024-10-24 16:19:13,520 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 27 [2024-10-24 16:19:13,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:19:13,521 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2024-10-24 16:19:13,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 16:19:13,521 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2024-10-24 16:19:13,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-24 16:19:13,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:13,521 INFO L215 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] [2024-10-24 16:19:13,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 16:19:13,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-24 16:19:13,726 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:13,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:13,726 INFO L85 PathProgramCache]: Analyzing trace with hash -393568985, now seen corresponding path program 1 times [2024-10-24 16:19:13,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:13,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038727380] [2024-10-24 16:19:13,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:13,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:14,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 16:19:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:14,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:14,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:14,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038727380] [2024-10-24 16:19:14,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038727380] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:19:14,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726427173] [2024-10-24 16:19:14,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:14,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:19:14,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:19:14,169 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:19:14,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 16:19:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:14,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-24 16:19:14,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:19:14,306 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 [2024-10-24 16:19:14,313 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 [2024-10-24 16:19:14,378 WARN L873 $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) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base 1)))) is different from true [2024-10-24 16:19:14,508 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-24 16:19:14,509 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 [2024-10-24 16:19:14,513 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 [2024-10-24 16:19:14,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:19:14,686 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 [2024-10-24 16:19:14,708 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-24 16:19:14,709 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 [2024-10-24 16:19:14,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-24 16:19:14,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:19:15,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726427173] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:19:15,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:19:15,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2024-10-24 16:19:15,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847106777] [2024-10-24 16:19:15,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:19:15,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 16:19:15,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:19:15,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 16:19:15,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=197, Unknown=1, NotChecked=28, Total=272 [2024-10-24 16:19:15,043 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:19:16,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:19:16,016 INFO L93 Difference]: Finished difference Result 275 states and 309 transitions. [2024-10-24 16:19:16,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-24 16:19:16,017 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-10-24 16:19:16,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:19:16,018 INFO L225 Difference]: With dead ends: 275 [2024-10-24 16:19:16,018 INFO L226 Difference]: Without dead ends: 275 [2024-10-24 16:19:16,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=200, Invalid=795, Unknown=1, NotChecked=60, Total=1056 [2024-10-24 16:19:16,018 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 234 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 228 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:19:16,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 333 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 581 Invalid, 0 Unknown, 228 Unchecked, 0.5s Time] [2024-10-24 16:19:16,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-24 16:19:16,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 170. [2024-10-24 16:19:16,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 129 states have (on average 1.550387596899225) internal successors, (200), 160 states have internal predecessors, (200), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-24 16:19:16,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 212 transitions. [2024-10-24 16:19:16,023 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 212 transitions. Word has length 27 [2024-10-24 16:19:16,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:19:16,023 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 212 transitions. [2024-10-24 16:19:16,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:19:16,023 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 212 transitions. [2024-10-24 16:19:16,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 16:19:16,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:16,024 INFO L215 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] [2024-10-24 16:19:16,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 16:19:16,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:19:16,229 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:16,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:16,229 INFO L85 PathProgramCache]: Analyzing trace with hash 669604646, now seen corresponding path program 1 times [2024-10-24 16:19:16,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:16,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616873368] [2024-10-24 16:19:16,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:16,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:16,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 16:19:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:16,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:16,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616873368] [2024-10-24 16:19:16,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616873368] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:19:16,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449496711] [2024-10-24 16:19:16,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:16,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:19:16,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:19:16,900 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:19:16,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 16:19:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:17,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-24 16:19:17,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:19:17,044 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 [2024-10-24 16:19:17,049 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 [2024-10-24 16:19:17,136 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 19 treesize of output 1 [2024-10-24 16:19:17,142 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 [2024-10-24 16:19:17,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:19:17,251 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 20 treesize of output 15 [2024-10-24 16:19:17,262 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-10-24 16:19:17,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-10-24 16:19:17,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-24 16:19:17,317 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:17,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:19:17,603 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 76 treesize of output 70 [2024-10-24 16:19:17,605 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 106 treesize of output 94 [2024-10-24 16:19:17,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2024-10-24 16:19:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:17,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449496711] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:19:17,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:19:17,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 21 [2024-10-24 16:19:17,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599366776] [2024-10-24 16:19:17,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:19:17,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-24 16:19:17,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:19:17,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-24 16:19:17,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-10-24 16:19:17,808 INFO L87 Difference]: Start difference. First operand 170 states and 212 transitions. Second operand has 22 states, 21 states have (on average 3.9523809523809526) internal successors, (83), 20 states have internal predecessors, (83), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:19:18,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:19:18,523 INFO L93 Difference]: Finished difference Result 179 states and 220 transitions. [2024-10-24 16:19:18,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 16:19:18,524 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.9523809523809526) internal successors, (83), 20 states have internal predecessors, (83), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-10-24 16:19:18,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:19:18,525 INFO L225 Difference]: With dead ends: 179 [2024-10-24 16:19:18,525 INFO L226 Difference]: Without dead ends: 179 [2024-10-24 16:19:18,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2024-10-24 16:19:18,526 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 148 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:19:18,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 625 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 16:19:18,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-24 16:19:18,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2024-10-24 16:19:18,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 134 states have (on average 1.5223880597014925) internal successors, (204), 166 states have internal predecessors, (204), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-24 16:19:18,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 216 transitions. [2024-10-24 16:19:18,536 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 216 transitions. Word has length 33 [2024-10-24 16:19:18,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:19:18,536 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 216 transitions. [2024-10-24 16:19:18,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.9523809523809526) internal successors, (83), 20 states have internal predecessors, (83), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:19:18,536 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 216 transitions. [2024-10-24 16:19:18,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 16:19:18,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:18,538 INFO L215 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] [2024-10-24 16:19:18,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 16:19:18,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-24 16:19:18,743 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:18,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:18,744 INFO L85 PathProgramCache]: Analyzing trace with hash 669604645, now seen corresponding path program 1 times [2024-10-24 16:19:18,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:18,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150332341] [2024-10-24 16:19:18,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:18,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:19,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 16:19:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:19,343 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:19,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:19,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150332341] [2024-10-24 16:19:19,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150332341] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:19:19,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333757599] [2024-10-24 16:19:19,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:19,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:19:19,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:19:19,346 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:19:19,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 16:19:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:19,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-24 16:19:19,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:19:19,509 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 [2024-10-24 16:19:19,556 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 19 treesize of output 1 [2024-10-24 16:19:19,610 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2024-10-24 16:19:19,611 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 25 treesize of output 28 [2024-10-24 16:19:19,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-24 16:19:19,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:19,638 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:19:19,773 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 40 treesize of output 34 [2024-10-24 16:19:20,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:20,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333757599] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:19:20,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:19:20,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 19 [2024-10-24 16:19:20,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543577686] [2024-10-24 16:19:20,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:19:20,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-24 16:19:20,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:19:20,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-24 16:19:20,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-10-24 16:19:20,040 INFO L87 Difference]: Start difference. First operand 176 states and 216 transitions. Second operand has 20 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 18 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:19:20,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:19:20,540 INFO L93 Difference]: Finished difference Result 178 states and 219 transitions. [2024-10-24 16:19:20,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:19:20,540 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 18 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-10-24 16:19:20,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:19:20,541 INFO L225 Difference]: With dead ends: 178 [2024-10-24 16:19:20,541 INFO L226 Difference]: Without dead ends: 178 [2024-10-24 16:19:20,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2024-10-24 16:19:20,542 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 142 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:19:20,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 531 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 16:19:20,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-24 16:19:20,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2024-10-24 16:19:20,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 134 states have (on average 1.5149253731343284) internal successors, (203), 166 states have internal predecessors, (203), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-24 16:19:20,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 215 transitions. [2024-10-24 16:19:20,545 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 215 transitions. Word has length 33 [2024-10-24 16:19:20,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:19:20,546 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 215 transitions. [2024-10-24 16:19:20,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 18 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:19:20,546 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 215 transitions. [2024-10-24 16:19:20,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 16:19:20,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:20,547 INFO L215 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] [2024-10-24 16:19:20,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-24 16:19:20,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-24 16:19:20,750 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:20,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:20,751 INFO L85 PathProgramCache]: Analyzing trace with hash 181640716, now seen corresponding path program 1 times [2024-10-24 16:19:20,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:20,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162566174] [2024-10-24 16:19:20,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:20,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:21,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 16:19:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:21,239 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:21,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:21,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162566174] [2024-10-24 16:19:21,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162566174] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:19:21,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045856299] [2024-10-24 16:19:21,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:21,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:19:21,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:19:21,242 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:19:21,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 16:19:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:21,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-24 16:19:21,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:19:21,377 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 [2024-10-24 16:19:21,384 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:19:21,384 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 [2024-10-24 16:19:21,389 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 [2024-10-24 16:19:21,393 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 [2024-10-24 16:19:21,398 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 [2024-10-24 16:19:21,402 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 [2024-10-24 16:19:21,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:21,642 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:19:21,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045856299] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:19:21,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:19:21,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2024-10-24 16:19:21,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959092379] [2024-10-24 16:19:21,719 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:19:21,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 16:19:21,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:19:21,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 16:19:21,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=281, Unknown=7, NotChecked=0, Total=342 [2024-10-24 16:19:21,720 INFO L87 Difference]: Start difference. First operand 176 states and 215 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 14 states have internal predecessors, (43), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:19:22,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:19:22,158 INFO L93 Difference]: Finished difference Result 244 states and 300 transitions. [2024-10-24 16:19:22,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 16:19:22,158 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 14 states have internal predecessors, (43), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2024-10-24 16:19:22,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:19:22,159 INFO L225 Difference]: With dead ends: 244 [2024-10-24 16:19:22,159 INFO L226 Difference]: Without dead ends: 244 [2024-10-24 16:19:22,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=528, Unknown=7, NotChecked=0, Total=650 [2024-10-24 16:19:22,160 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 197 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:19:22,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 450 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:19:22,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-24 16:19:22,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 186. [2024-10-24 16:19:22,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 142 states have (on average 1.4929577464788732) internal successors, (212), 174 states have internal predecessors, (212), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2024-10-24 16:19:22,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 228 transitions. [2024-10-24 16:19:22,164 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 228 transitions. Word has length 34 [2024-10-24 16:19:22,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:19:22,164 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 228 transitions. [2024-10-24 16:19:22,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 14 states have internal predecessors, (43), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:19:22,165 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 228 transitions. [2024-10-24 16:19:22,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 16:19:22,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:22,165 INFO L215 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, 1, 1] [2024-10-24 16:19:22,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-24 16:19:22,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-24 16:19:22,374 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:22,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:22,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1434077745, now seen corresponding path program 1 times [2024-10-24 16:19:22,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:22,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553115132] [2024-10-24 16:19:22,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:22,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:22,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 16:19:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:23,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:23,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:23,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553115132] [2024-10-24 16:19:23,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553115132] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:19:23,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605318291] [2024-10-24 16:19:23,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:23,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:19:23,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:19:23,069 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:19:23,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-24 16:19:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:23,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-24 16:19:23,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:19:23,224 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 [2024-10-24 16:19:23,241 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:19:23,241 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 [2024-10-24 16:19:23,255 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 13 treesize of output 9 [2024-10-24 16:19:23,258 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 13 treesize of output 9 [2024-10-24 16:19:27,395 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (and (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| |c_#memory_$Pointer$#1.base|))) (and (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0) (not (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse1)) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)) |c_#memory_$Pointer$#1.base|)))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0))) is different from false [2024-10-24 16:19:27,408 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (and (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| |c_#memory_$Pointer$#1.base|))) (and (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0) (not (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse1)) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)) |c_#memory_$Pointer$#1.base|)))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0))) is different from true [2024-10-24 16:19:27,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:19:27,509 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:19:28,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605318291] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:19:28,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:19:28,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2024-10-24 16:19:28,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983522495] [2024-10-24 16:19:28,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:19:28,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-24 16:19:28,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:19:28,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-24 16:19:28,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=428, Unknown=12, NotChecked=42, Total=552 [2024-10-24 16:19:28,395 INFO L87 Difference]: Start difference. First operand 186 states and 228 transitions. Second operand has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 17 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:19:32,517 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|))) (and (= (select .cse0 4) 0) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| |c_#memory_$Pointer$#1.base|))) (and (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0) (not (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse2)) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2)) |c_#memory_$Pointer$#1.base|)))) (= (select .cse0 .cse1) 0)) (= |c_ULTIMATE.start_main_~list2~0#1.offset| 0) (= (select .cse3 .cse1) 0) (= (select .cse3 4) 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)))) is different from false [2024-10-24 16:19:32,520 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|))) (and (= (select .cse0 4) 0) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| |c_#memory_$Pointer$#1.base|))) (and (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0) (not (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse2)) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2)) |c_#memory_$Pointer$#1.base|)))) (= (select .cse0 .cse1) 0)) (= |c_ULTIMATE.start_main_~list2~0#1.offset| 0) (= (select .cse3 .cse1) 0) (= (select .cse3 4) 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)))) is different from true [2024-10-24 16:19:32,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:19:32,961 INFO L93 Difference]: Finished difference Result 234 states and 291 transitions. [2024-10-24 16:19:32,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 16:19:32,965 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 17 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2024-10-24 16:19:32,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:19:32,966 INFO L225 Difference]: With dead ends: 234 [2024-10-24 16:19:32,966 INFO L226 Difference]: Without dead ends: 234 [2024-10-24 16:19:32,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=132, Invalid=674, Unknown=14, NotChecked=110, Total=930 [2024-10-24 16:19:32,967 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 66 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:19:32,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 711 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 729 Invalid, 0 Unknown, 156 Unchecked, 0.4s Time] [2024-10-24 16:19:32,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-24 16:19:32,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 197. [2024-10-24 16:19:32,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 183 states have internal predecessors, (223), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (10), 6 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-24 16:19:32,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 241 transitions. [2024-10-24 16:19:32,978 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 241 transitions. Word has length 35 [2024-10-24 16:19:32,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:19:32,979 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 241 transitions. [2024-10-24 16:19:32,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 17 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:19:32,980 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 241 transitions. [2024-10-24 16:19:32,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 16:19:32,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:32,982 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:19:33,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-24 16:19:33,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:19:33,183 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:33,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:33,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1196597603, now seen corresponding path program 1 times [2024-10-24 16:19:33,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:33,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415231162] [2024-10-24 16:19:33,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:33,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:33,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 16:19:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:33,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 16:19:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:33,296 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 16:19:33,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:33,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415231162] [2024-10-24 16:19:33,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415231162] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:19:33,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533871832] [2024-10-24 16:19:33,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:33,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:19:33,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:19:33,299 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:19:33,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-24 16:19:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:33,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 16:19:33,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:19:33,500 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 16:19:33,500 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:19:33,523 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 16:19:33,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533871832] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:19:33,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:19:33,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-10-24 16:19:33,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070294420] [2024-10-24 16:19:33,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:19:33,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:19:33,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:19:33,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:19:33,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:19:33,524 INFO L87 Difference]: Start difference. First operand 197 states and 241 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:19:33,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:19:33,633 INFO L93 Difference]: Finished difference Result 243 states and 301 transitions. [2024-10-24 16:19:33,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:19:33,633 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 39 [2024-10-24 16:19:33,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:19:33,634 INFO L225 Difference]: With dead ends: 243 [2024-10-24 16:19:33,635 INFO L226 Difference]: Without dead ends: 243 [2024-10-24 16:19:33,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:19:33,635 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 56 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:19:33,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 244 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:19:33,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-10-24 16:19:33,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 233. [2024-10-24 16:19:33,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 184 states have (on average 1.4945652173913044) internal successors, (275), 213 states have internal predecessors, (275), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2024-10-24 16:19:33,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 301 transitions. [2024-10-24 16:19:33,641 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 301 transitions. Word has length 39 [2024-10-24 16:19:33,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:19:33,641 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 301 transitions. [2024-10-24 16:19:33,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:19:33,642 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 301 transitions. [2024-10-24 16:19:33,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 16:19:33,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:33,643 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 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] [2024-10-24 16:19:33,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-24 16:19:33,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:19:33,848 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:33,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:33,849 INFO L85 PathProgramCache]: Analyzing trace with hash -287814160, now seen corresponding path program 1 times [2024-10-24 16:19:33,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:33,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335112765] [2024-10-24 16:19:33,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:33,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:34,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 16:19:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:34,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 16:19:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:34,621 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:19:34,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:34,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335112765] [2024-10-24 16:19:34,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335112765] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:19:34,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995850752] [2024-10-24 16:19:34,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:34,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:19:34,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:19:34,623 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:19:34,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-24 16:19:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:34,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-24 16:19:34,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:19:34,807 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 [2024-10-24 16:19:34,812 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 [2024-10-24 16:19:34,876 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 [2024-10-24 16:19:34,881 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 19 treesize of output 1 [2024-10-24 16:19:34,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:19:34,956 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 20 treesize of output 15 [2024-10-24 16:19:34,963 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-10-24 16:19:34,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-10-24 16:19:35,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-24 16:19:35,021 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:19:35,021 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:19:35,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2024-10-24 16:19:35,292 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 76 treesize of output 70 [2024-10-24 16:19:35,294 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 106 treesize of output 94 [2024-10-24 16:19:35,475 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:19:35,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995850752] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:19:35,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:19:35,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6, 6] total 24 [2024-10-24 16:19:35,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178882206] [2024-10-24 16:19:35,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:19:35,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-24 16:19:35,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:19:35,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-24 16:19:35,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2024-10-24 16:19:35,478 INFO L87 Difference]: Start difference. First operand 233 states and 301 transitions. Second operand has 25 states, 24 states have (on average 4.208333333333333) internal successors, (101), 23 states have internal predecessors, (101), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 16:19:36,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:19:36,316 INFO L93 Difference]: Finished difference Result 299 states and 379 transitions. [2024-10-24 16:19:36,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 16:19:36,317 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.208333333333333) internal successors, (101), 23 states have internal predecessors, (101), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2024-10-24 16:19:36,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:19:36,318 INFO L225 Difference]: With dead ends: 299 [2024-10-24 16:19:36,318 INFO L226 Difference]: Without dead ends: 299 [2024-10-24 16:19:36,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=1088, Unknown=0, NotChecked=0, Total=1260 [2024-10-24 16:19:36,319 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 264 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:19:36,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 458 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 16:19:36,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-24 16:19:36,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 241. [2024-10-24 16:19:36,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 191 states have (on average 1.4240837696335078) internal successors, (272), 221 states have internal predecessors, (272), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2024-10-24 16:19:36,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 298 transitions. [2024-10-24 16:19:36,333 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 298 transitions. Word has length 49 [2024-10-24 16:19:36,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:19:36,334 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 298 transitions. [2024-10-24 16:19:36,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.208333333333333) internal successors, (101), 23 states have internal predecessors, (101), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 16:19:36,334 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 298 transitions. [2024-10-24 16:19:36,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 16:19:36,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:36,338 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 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] [2024-10-24 16:19:36,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-24 16:19:36,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:19:36,539 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:36,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:36,540 INFO L85 PathProgramCache]: Analyzing trace with hash -287814161, now seen corresponding path program 1 times [2024-10-24 16:19:36,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:36,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784448171] [2024-10-24 16:19:36,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:36,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:37,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 16:19:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:37,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 16:19:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:37,455 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:19:37,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:37,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784448171] [2024-10-24 16:19:37,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784448171] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:19:37,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70087785] [2024-10-24 16:19:37,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:37,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:19:37,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:19:37,458 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:19:37,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-24 16:19:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:37,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-24 16:19:37,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:19:37,653 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 [2024-10-24 16:19:37,724 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 19 treesize of output 1 [2024-10-24 16:19:37,797 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2024-10-24 16:19:37,797 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 25 treesize of output 28 [2024-10-24 16:19:37,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-24 16:19:37,815 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:19:37,816 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:19:37,938 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 40 treesize of output 34 [2024-10-24 16:19:38,205 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:19:38,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70087785] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:19:38,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:19:38,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6, 6] total 21 [2024-10-24 16:19:38,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272854451] [2024-10-24 16:19:38,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:19:38,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-24 16:19:38,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:19:38,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-24 16:19:38,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2024-10-24 16:19:38,208 INFO L87 Difference]: Start difference. First operand 241 states and 298 transitions. Second operand has 22 states, 21 states have (on average 4.333333333333333) internal successors, (91), 20 states have internal predecessors, (91), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 16:19:38,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:19:38,713 INFO L93 Difference]: Finished difference Result 273 states and 327 transitions. [2024-10-24 16:19:38,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 16:19:38,713 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.333333333333333) internal successors, (91), 20 states have internal predecessors, (91), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2024-10-24 16:19:38,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:19:38,714 INFO L225 Difference]: With dead ends: 273 [2024-10-24 16:19:38,714 INFO L226 Difference]: Without dead ends: 273 [2024-10-24 16:19:38,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2024-10-24 16:19:38,715 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 190 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:19:38,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 535 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 16:19:38,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-24 16:19:38,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 241. [2024-10-24 16:19:38,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 191 states have (on average 1.4136125654450262) internal successors, (270), 221 states have internal predecessors, (270), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2024-10-24 16:19:38,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 296 transitions. [2024-10-24 16:19:38,720 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 296 transitions. Word has length 49 [2024-10-24 16:19:38,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:19:38,720 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 296 transitions. [2024-10-24 16:19:38,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.333333333333333) internal successors, (91), 20 states have internal predecessors, (91), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 16:19:38,720 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 296 transitions. [2024-10-24 16:19:38,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-24 16:19:38,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:38,721 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:19:38,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-24 16:19:38,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-24 16:19:38,925 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:38,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:38,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1007553657, now seen corresponding path program 1 times [2024-10-24 16:19:38,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:38,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27617030] [2024-10-24 16:19:38,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:38,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:38,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 16:19:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:38,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 16:19:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:39,008 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 16:19:39,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:39,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27617030] [2024-10-24 16:19:39,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27617030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:19:39,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:19:39,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:19:39,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629106341] [2024-10-24 16:19:39,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:19:39,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:19:39,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:19:39,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:19:39,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:19:39,010 INFO L87 Difference]: Start difference. First operand 241 states and 296 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:19:39,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:19:39,088 INFO L93 Difference]: Finished difference Result 239 states and 293 transitions. [2024-10-24 16:19:39,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:19:39,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2024-10-24 16:19:39,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:19:39,090 INFO L225 Difference]: With dead ends: 239 [2024-10-24 16:19:39,090 INFO L226 Difference]: Without dead ends: 239 [2024-10-24 16:19:39,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:19:39,090 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:19:39,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:19:39,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-24 16:19:39,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2024-10-24 16:19:39,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 189 states have (on average 1.4126984126984128) internal successors, (267), 219 states have internal predecessors, (267), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2024-10-24 16:19:39,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 293 transitions. [2024-10-24 16:19:39,097 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 293 transitions. Word has length 50 [2024-10-24 16:19:39,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:19:39,097 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 293 transitions. [2024-10-24 16:19:39,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:19:39,098 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 293 transitions. [2024-10-24 16:19:39,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-24 16:19:39,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:39,098 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:19:39,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 16:19:39,098 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:39,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:39,099 INFO L85 PathProgramCache]: Analyzing trace with hash 338435944, now seen corresponding path program 1 times [2024-10-24 16:19:39,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:39,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331164166] [2024-10-24 16:19:39,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:39,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:39,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 16:19:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:39,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 16:19:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:39,488 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:19:39,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:39,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331164166] [2024-10-24 16:19:39,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331164166] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:19:39,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414889342] [2024-10-24 16:19:39,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:39,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:19:39,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:19:39,490 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:19:39,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-24 16:19:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:39,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-24 16:19:39,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:19:39,694 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 [2024-10-24 16:19:39,711 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:19:39,711 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 [2024-10-24 16:19:39,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-24 16:19:39,726 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 13 treesize of output 9 [2024-10-24 16:19:39,839 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 [2024-10-24 16:19:39,844 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 [2024-10-24 16:19:39,899 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 [2024-10-24 16:19:39,903 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 [2024-10-24 16:19:39,985 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 16:19:39,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:19:40,041 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (and (forall ((v_ArrVal_3024 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_3024) |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_3025 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_3025) |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0)))) is different from false [2024-10-24 16:19:40,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414889342] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:19:40,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:19:40,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2024-10-24 16:19:40,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382948496] [2024-10-24 16:19:40,043 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:19:40,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-24 16:19:40,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:19:40,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-24 16:19:40,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=449, Unknown=1, NotChecked=42, Total=552 [2024-10-24 16:19:40,044 INFO L87 Difference]: Start difference. First operand 239 states and 293 transitions. Second operand has 23 states, 23 states have (on average 3.260869565217391) internal successors, (75), 20 states have internal predecessors, (75), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:19:41,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:19:41,137 INFO L93 Difference]: Finished difference Result 268 states and 320 transitions. [2024-10-24 16:19:41,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-24 16:19:41,138 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.260869565217391) internal successors, (75), 20 states have internal predecessors, (75), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 51 [2024-10-24 16:19:41,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:19:41,138 INFO L225 Difference]: With dead ends: 268 [2024-10-24 16:19:41,139 INFO L226 Difference]: Without dead ends: 268 [2024-10-24 16:19:41,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=316, Invalid=2039, Unknown=1, NotChecked=94, Total=2450 [2024-10-24 16:19:41,140 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 269 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 16:19:41,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 603 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 16:19:41,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-24 16:19:41,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 206. [2024-10-24 16:19:41,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 160 states have (on average 1.4125) internal successors, (226), 188 states have internal predecessors, (226), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 16:19:41,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 248 transitions. [2024-10-24 16:19:41,144 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 248 transitions. Word has length 51 [2024-10-24 16:19:41,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:19:41,144 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 248 transitions. [2024-10-24 16:19:41,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.260869565217391) internal successors, (75), 20 states have internal predecessors, (75), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:19:41,145 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 248 transitions. [2024-10-24 16:19:41,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-24 16:19:41,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:41,145 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:19:41,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-24 16:19:41,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-24 16:19:41,350 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:41,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:41,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1354466599, now seen corresponding path program 1 times [2024-10-24 16:19:41,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:41,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162705955] [2024-10-24 16:19:41,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:41,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:41,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 16:19:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:41,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 16:19:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:41,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 16:19:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:41,982 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-24 16:19:41,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:41,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162705955] [2024-10-24 16:19:41,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162705955] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:19:41,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300739281] [2024-10-24 16:19:41,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:41,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:19:41,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:19:41,986 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:19:41,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-24 16:19:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:42,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-10-24 16:19:42,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:19:42,228 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 [2024-10-24 16:19:42,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:19:42,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 16:19:42,353 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-10-24 16:19:42,353 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 26 treesize of output 19 [2024-10-24 16:19:42,371 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2024-10-24 16:19:42,371 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 33 [2024-10-24 16:19:42,527 WARN L873 $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 [2024-10-24 16:19:42,545 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 22 treesize of output 10 [2024-10-24 16:19:42,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:19:42,551 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 [2024-10-24 16:19:42,567 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-24 16:19:42,568 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 [2024-10-24 16:19:42,675 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-24 16:19:42,676 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 [2024-10-24 16:19:42,816 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-10-24 16:19:42,816 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 3 case distinctions, treesize of input 26 treesize of output 38 [2024-10-24 16:19:42,913 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-24 16:19:42,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:19:47,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300739281] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:19:47,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:19:47,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 24 [2024-10-24 16:19:47,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937446532] [2024-10-24 16:19:47,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:19:47,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-24 16:19:47,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:19:47,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-24 16:19:47,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=609, Unknown=1, NotChecked=50, Total=756 [2024-10-24 16:19:47,187 INFO L87 Difference]: Start difference. First operand 206 states and 248 transitions. Second operand has 25 states, 24 states have (on average 4.083333333333333) internal successors, (98), 19 states have internal predecessors, (98), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-24 16:19:51,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:19:55,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:19:56,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:19:56,376 INFO L93 Difference]: Finished difference Result 217 states and 255 transitions. [2024-10-24 16:19:56,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 16:19:56,377 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.083333333333333) internal successors, (98), 19 states have internal predecessors, (98), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 61 [2024-10-24 16:19:56,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:19:56,378 INFO L225 Difference]: With dead ends: 217 [2024-10-24 16:19:56,378 INFO L226 Difference]: Without dead ends: 217 [2024-10-24 16:19:56,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=230, Invalid=1333, Unknown=1, NotChecked=76, Total=1640 [2024-10-24 16:19:56,379 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 215 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 21 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-10-24 16:19:56,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 599 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 986 Invalid, 2 Unknown, 123 Unchecked, 8.7s Time] [2024-10-24 16:19:56,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-24 16:19:56,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 138. [2024-10-24 16:19:56,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 106 states have (on average 1.3584905660377358) internal successors, (144), 128 states have internal predecessors, (144), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:19:56,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 156 transitions. [2024-10-24 16:19:56,382 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 156 transitions. Word has length 61 [2024-10-24 16:19:56,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:19:56,383 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 156 transitions. [2024-10-24 16:19:56,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.083333333333333) internal successors, (98), 19 states have internal predecessors, (98), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-24 16:19:56,383 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 156 transitions. [2024-10-24 16:19:56,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 16:19:56,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:56,384 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:19:56,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-24 16:19:56,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-24 16:19:56,585 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:56,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:56,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1682704199, now seen corresponding path program 2 times [2024-10-24 16:19:56,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:56,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646728504] [2024-10-24 16:19:56,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:56,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:56,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 16:19:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:56,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 16:19:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:56,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 16:19:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:57,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 16:19:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:57,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 16:19:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:57,101 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 37 proven. 55 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-24 16:19:57,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:57,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646728504] [2024-10-24 16:19:57,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646728504] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:19:57,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493883512] [2024-10-24 16:19:57,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:19:57,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:19:57,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:19:57,104 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:19:57,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-24 16:19:57,570 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:19:57,570 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:19:57,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 16:19:57,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:19:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-24 16:19:57,641 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:19:57,718 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-24 16:19:57,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493883512] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:19:57,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:19:57,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2024-10-24 16:19:57,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307451328] [2024-10-24 16:19:57,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:19:57,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 16:19:57,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:19:57,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 16:19:57,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-10-24 16:19:57,720 INFO L87 Difference]: Start difference. First operand 138 states and 156 transitions. Second operand has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 17 states have internal predecessors, (64), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-24 16:19:58,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:19:58,130 INFO L93 Difference]: Finished difference Result 168 states and 176 transitions. [2024-10-24 16:19:58,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 16:19:58,130 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 17 states have internal predecessors, (64), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 84 [2024-10-24 16:19:58,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:19:58,131 INFO L225 Difference]: With dead ends: 168 [2024-10-24 16:19:58,131 INFO L226 Difference]: Without dead ends: 168 [2024-10-24 16:19:58,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 175 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2024-10-24 16:19:58,132 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 221 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:19:58,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 370 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:19:58,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-24 16:19:58,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 148. [2024-10-24 16:19:58,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 114 states have (on average 1.4035087719298245) internal successors, (160), 136 states have internal predecessors, (160), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 16:19:58,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 176 transitions. [2024-10-24 16:19:58,136 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 176 transitions. Word has length 84 [2024-10-24 16:19:58,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:19:58,136 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 176 transitions. [2024-10-24 16:19:58,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 17 states have internal predecessors, (64), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-24 16:19:58,136 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 176 transitions. [2024-10-24 16:19:58,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 16:19:58,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:19:58,137 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:19:58,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-24 16:19:58,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-24 16:19:58,337 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:19:58,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:19:58,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1316747392, now seen corresponding path program 1 times [2024-10-24 16:19:58,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:19:58,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115880586] [2024-10-24 16:19:58,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:58,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:19:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:59,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 16:19:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:59,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 16:19:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:59,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 16:19:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:59,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 16:19:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:59,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 16:19:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:59,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 16:19:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:59,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 16:19:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-10-24 16:19:59,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:19:59,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115880586] [2024-10-24 16:19:59,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115880586] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:19:59,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758713823] [2024-10-24 16:19:59,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:19:59,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:19:59,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:19:59,368 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:19:59,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-24 16:19:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:19:59,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 1139 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-10-24 16:19:59,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:19:59,790 WARN L873 $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 [2024-10-24 16:19:59,853 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-24 16:19:59,853 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 [2024-10-24 16:19:59,932 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-24 16:19:59,933 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 [2024-10-24 16:20:00,044 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 19 treesize of output 1 [2024-10-24 16:20:00,079 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-10-24 16:20:00,080 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 26 treesize of output 19 [2024-10-24 16:20:00,212 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 27 treesize of output 15 [2024-10-24 16:20:00,224 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-24 16:20:00,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2024-10-24 16:20:00,297 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 19 treesize of output 1 [2024-10-24 16:20:00,310 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-10-24 16:20:00,310 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 26 treesize of output 19 [2024-10-24 16:20:00,376 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 27 treesize of output 15 [2024-10-24 16:20:00,384 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-24 16:20:00,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2024-10-24 16:20:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 28 proven. 84 refuted. 0 times theorem prover too weak. 62 trivial. 89 not checked. [2024-10-24 16:20:00,398 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:20:00,737 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 30 treesize of output 24 [2024-10-24 16:20:01,201 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 30 treesize of output 24 [2024-10-24 16:20:01,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758713823] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:01,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:20:01,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13] total 17 [2024-10-24 16:20:01,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062367037] [2024-10-24 16:20:01,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:20:01,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 16:20:01,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:01,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 16:20:01,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=494, Unknown=1, NotChecked=46, Total=650 [2024-10-24 16:20:01,404 INFO L87 Difference]: Start difference. First operand 148 states and 176 transitions. Second operand has 18 states, 17 states have (on average 5.588235294117647) internal successors, (95), 15 states have internal predecessors, (95), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 16:20:01,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:01,864 INFO L93 Difference]: Finished difference Result 169 states and 197 transitions. [2024-10-24 16:20:01,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:20:01,865 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.588235294117647) internal successors, (95), 15 states have internal predecessors, (95), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 119 [2024-10-24 16:20:01,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:01,866 INFO L225 Difference]: With dead ends: 169 [2024-10-24 16:20:01,866 INFO L226 Difference]: Without dead ends: 169 [2024-10-24 16:20:01,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 182 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=894, Unknown=1, NotChecked=64, Total=1190 [2024-10-24 16:20:01,867 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 92 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:01,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 331 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 400 Invalid, 0 Unknown, 88 Unchecked, 0.2s Time] [2024-10-24 16:20:01,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-24 16:20:01,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 147. [2024-10-24 16:20:01,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 114 states have (on average 1.394736842105263) internal successors, (159), 135 states have internal predecessors, (159), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 16:20:01,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 175 transitions. [2024-10-24 16:20:01,870 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 175 transitions. Word has length 119 [2024-10-24 16:20:01,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:01,870 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 175 transitions. [2024-10-24 16:20:01,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.588235294117647) internal successors, (95), 15 states have internal predecessors, (95), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 16:20:01,870 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 175 transitions. [2024-10-24 16:20:01,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 16:20:01,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:01,871 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:01,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-24 16:20:02,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:02,072 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:20:02,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:02,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1316747391, now seen corresponding path program 1 times [2024-10-24 16:20:02,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:02,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631813493] [2024-10-24 16:20:02,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:02,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:03,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 16:20:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:03,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 16:20:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:03,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 16:20:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:03,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 16:20:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:03,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 16:20:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:03,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 16:20:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:03,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 16:20:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-10-24 16:20:03,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:03,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631813493] [2024-10-24 16:20:03,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631813493] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:03,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700144465] [2024-10-24 16:20:03,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:03,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:03,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:03,571 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:20:03,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-24 16:20:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:03,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 1139 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-10-24 16:20:03,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:20:04,085 WARN L873 $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) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))) is different from true [2024-10-24 16:20:04,140 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-24 16:20:04,140 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 [2024-10-24 16:20:04,145 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 [2024-10-24 16:20:04,164 WARN L873 $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 [2024-10-24 16:20:04,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:20:04,198 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 [2024-10-24 16:20:04,204 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:20:04,204 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 [2024-10-24 16:20:04,278 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-24 16:20:04,279 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 [2024-10-24 16:20:04,387 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 19 treesize of output 1 [2024-10-24 16:20:04,391 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 19 treesize of output 1 [2024-10-24 16:20:04,435 INFO L349 Elim1Store]: treesize reduction 48, result has 44.8 percent of original size [2024-10-24 16:20:04,435 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 3 case distinctions, treesize of input 31 treesize of output 45 [2024-10-24 16:20:04,727 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 0 case distinctions, treesize of input 54 treesize of output 23 [2024-10-24 16:20:04,729 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 0 case distinctions, treesize of input 42 treesize of output 11 [2024-10-24 16:20:04,738 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-10-24 16:20:04,738 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 30 treesize of output 23 [2024-10-24 16:20:04,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-10-24 16:20:04,991 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 23 treesize of output 11 [2024-10-24 16:20:05,009 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-10-24 16:20:05,009 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 3 case distinctions, treesize of input 23 treesize of output 37 [2024-10-24 16:20:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 48 proven. 113 refuted. 0 times theorem prover too weak. 7 trivial. 95 not checked. [2024-10-24 16:20:05,072 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:20:05,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700144465] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:05,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:20:05,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 25] total 37 [2024-10-24 16:20:05,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690710504] [2024-10-24 16:20:05,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:20:05,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-24 16:20:05,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:05,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-24 16:20:05,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1263, Unknown=2, NotChecked=146, Total=1560 [2024-10-24 16:20:05,242 INFO L87 Difference]: Start difference. First operand 147 states and 175 transitions. Second operand has 38 states, 37 states have (on average 4.351351351351352) internal successors, (161), 33 states have internal predecessors, (161), 7 states have call successors, (10), 5 states have call predecessors, (10), 11 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-24 16:20:09,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:20:13,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:20:17,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:20:21,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:20:22,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:22,690 INFO L93 Difference]: Finished difference Result 168 states and 196 transitions. [2024-10-24 16:20:22,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-24 16:20:22,690 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 4.351351351351352) internal successors, (161), 33 states have internal predecessors, (161), 7 states have call successors, (10), 5 states have call predecessors, (10), 11 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) Word has length 119 [2024-10-24 16:20:22,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:22,691 INFO L225 Difference]: With dead ends: 168 [2024-10-24 16:20:22,691 INFO L226 Difference]: Without dead ends: 168 [2024-10-24 16:20:22,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 114 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=412, Invalid=2671, Unknown=5, NotChecked=218, Total=3306 [2024-10-24 16:20:22,692 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 306 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 20 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:22,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 409 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 610 Invalid, 4 Unknown, 204 Unchecked, 16.4s Time] [2024-10-24 16:20:22,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-24 16:20:22,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 146. [2024-10-24 16:20:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 134 states have internal predecessors, (158), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 16:20:22,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 174 transitions. [2024-10-24 16:20:22,695 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 174 transitions. Word has length 119 [2024-10-24 16:20:22,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:22,695 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 174 transitions. [2024-10-24 16:20:22,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 4.351351351351352) internal successors, (161), 33 states have internal predecessors, (161), 7 states have call successors, (10), 5 states have call predecessors, (10), 11 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-24 16:20:22,695 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2024-10-24 16:20:22,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 16:20:22,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:22,696 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:22,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-24 16:20:22,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-24 16:20:22,900 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:20:22,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:22,901 INFO L85 PathProgramCache]: Analyzing trace with hash 2130508202, now seen corresponding path program 1 times [2024-10-24 16:20:22,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:22,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055913226] [2024-10-24 16:20:22,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:22,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:24,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 16:20:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:24,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 16:20:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:24,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 16:20:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:24,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 16:20:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:24,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 16:20:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:24,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 16:20:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:24,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 16:20:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2024-10-24 16:20:24,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:24,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055913226] [2024-10-24 16:20:24,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055913226] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:24,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575878397] [2024-10-24 16:20:24,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:24,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:24,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:24,626 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:20:24,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-24 16:20:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:25,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 126 conjuncts are in the unsatisfiable core [2024-10-24 16:20:25,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:20:25,191 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 [2024-10-24 16:20:25,199 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:20:25,199 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 [2024-10-24 16:20:25,208 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 [2024-10-24 16:20:25,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 16:20:25,267 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 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-24 16:20:25,463 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 [2024-10-24 16:20:25,478 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-10-24 16:20:25,478 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 23 treesize of output 24 [2024-10-24 16:20:25,623 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-10-24 16:20:25,623 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 30 treesize of output 27 [2024-10-24 16:20:25,626 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 43 treesize of output 23 [2024-10-24 16:20:25,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 22 [2024-10-24 16:20:25,821 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2024-10-24 16:20:25,822 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 30 treesize of output 46 [2024-10-24 16:20:26,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2024-10-24 16:20:26,076 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:20:26,083 INFO L349 Elim1Store]: treesize reduction 60, result has 13.0 percent of original size [2024-10-24 16:20:26,084 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 3 case distinctions, treesize of input 25 treesize of output 21 [2024-10-24 16:20:26,087 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 9 treesize of output 5 [2024-10-24 16:20:26,196 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 [2024-10-24 16:20:26,204 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-10-24 16:20:26,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2024-10-24 16:20:26,277 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 [2024-10-24 16:20:26,286 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-10-24 16:20:26,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2024-10-24 16:20:26,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-24 16:20:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 36 proven. 185 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-24 16:20:26,302 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:20:26,339 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6187 (Array Int Int)) (v_append_~node~0.base_137 Int)) (= (select (store |c_#valid| v_append_~node~0.base_137 1) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base| v_ArrVal_6187) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 1)) is different from false [2024-10-24 16:20:26,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575878397] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:26,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:20:26,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 27] total 35 [2024-10-24 16:20:26,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623487317] [2024-10-24 16:20:26,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:20:26,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-24 16:20:26,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:26,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-24 16:20:26,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1115, Unknown=1, NotChecked=68, Total=1332 [2024-10-24 16:20:26,342 INFO L87 Difference]: Start difference. First operand 146 states and 174 transitions. Second operand has 36 states, 35 states have (on average 3.3142857142857145) internal successors, (116), 34 states have internal predecessors, (116), 4 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-24 16:20:27,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:27,329 INFO L93 Difference]: Finished difference Result 170 states and 193 transitions. [2024-10-24 16:20:27,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-24 16:20:27,329 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.3142857142857145) internal successors, (116), 34 states have internal predecessors, (116), 4 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 120 [2024-10-24 16:20:27,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:27,331 INFO L225 Difference]: With dead ends: 170 [2024-10-24 16:20:27,331 INFO L226 Difference]: Without dead ends: 170 [2024-10-24 16:20:27,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=411, Invalid=2672, Unknown=1, NotChecked=108, Total=3192 [2024-10-24 16:20:27,333 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 166 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:27,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 448 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 16:20:27,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-24 16:20:27,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 145. [2024-10-24 16:20:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 116 states have (on average 1.3275862068965518) internal successors, (154), 133 states have internal predecessors, (154), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 16:20:27,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 170 transitions. [2024-10-24 16:20:27,341 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 170 transitions. Word has length 120 [2024-10-24 16:20:27,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:27,341 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 170 transitions. [2024-10-24 16:20:27,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.3142857142857145) internal successors, (116), 34 states have internal predecessors, (116), 4 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-24 16:20:27,342 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 170 transitions. [2024-10-24 16:20:27,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 16:20:27,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:27,342 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:27,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-24 16:20:27,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-24 16:20:27,543 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-10-24 16:20:27,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:27,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2130508203, now seen corresponding path program 1 times [2024-10-24 16:20:27,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:27,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579431124] [2024-10-24 16:20:27,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:27,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:29,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 16:20:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:29,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 16:20:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:29,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 16:20:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:29,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 16:20:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:30,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 16:20:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:30,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 16:20:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:30,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 16:20:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:30,374 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 188 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-24 16:20:30,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:30,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579431124] [2024-10-24 16:20:30,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579431124] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:30,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847483447] [2024-10-24 16:20:30,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:30,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:30,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:30,376 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:20:30,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-24 16:20:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:30,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 189 conjuncts are in the unsatisfiable core [2024-10-24 16:20:30,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:20:30,819 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 [2024-10-24 16:20:30,826 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:20:30,827 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 [2024-10-24 16:20:30,835 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 [2024-10-24 16:20:30,840 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 [2024-10-24 16:20:30,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:20:30,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 16:20:30,943 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 0 case distinctions, treesize of input 38 treesize of output 18 [2024-10-24 16:20:30,948 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 [2024-10-24 16:20:31,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2024-10-24 16:20:31,327 INFO L349 Elim1Store]: treesize reduction 50, result has 32.4 percent of original size [2024-10-24 16:20:31,327 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 41 treesize of output 30 [2024-10-24 16:20:31,330 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 41 treesize of output 32 [2024-10-24 16:20:31,333 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 30 treesize of output 13 [2024-10-24 16:20:31,339 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 25 treesize of output 18 [2024-10-24 16:20:31,795 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 25 treesize of output 18 [2024-10-24 16:20:31,815 INFO L349 Elim1Store]: treesize reduction 42, result has 36.4 percent of original size [2024-10-24 16:20:31,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 41 [2024-10-24 16:20:31,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 37 [2024-10-24 16:20:31,828 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 30 treesize of output 13 [2024-10-24 16:20:32,262 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 25 treesize of output 18 [2024-10-24 16:20:32,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 54 [2024-10-24 16:20:32,279 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 31 treesize of output 19 [2024-10-24 16:20:32,313 INFO L349 Elim1Store]: treesize reduction 85, result has 26.7 percent of original size [2024-10-24 16:20:32,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 33 treesize of output 43 [2024-10-24 16:20:32,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-24 16:20:32,595 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 25 treesize of output 18 [2024-10-24 16:20:32,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-24 16:20:32,620 INFO L349 Elim1Store]: treesize reduction 20, result has 45.9 percent of original size [2024-10-24 16:20:32,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 29 [2024-10-24 16:20:32,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-24 16:20:32,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:20:32,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2024-10-24 16:20:32,905 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-10-24 16:20:32,905 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 30 treesize of output 27 [2024-10-24 16:20:32,908 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 43 treesize of output 23 [2024-10-24 16:20:33,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40 [2024-10-24 16:20:33,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2024-10-24 16:20:33,317 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-24 16:20:33,317 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 26 treesize of output 29 [2024-10-24 16:20:33,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2024-10-24 16:20:33,325 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 19 treesize of output 11 [2024-10-24 16:20:33,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-24 16:20:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 21 proven. 235 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 16:20:33,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:20:33,686 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse3)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse3) 9))) (and (forall ((v_ArrVal_6959 Int)) (or (< v_ArrVal_6959 9) (forall ((v_append_~node~0.base_142 Int)) (let ((.cse0 (store |c_#length| v_append_~node~0.base_142 v_ArrVal_6959))) (or (forall ((v_ArrVal_6960 (Array Int Int)) (v_ArrVal_6961 (Array Int Int))) (<= (+ 9 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base| v_ArrVal_6960) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base| v_ArrVal_6961) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (< (select .cse0 .cse1) .cse2)))))) (or (forall ((v_ArrVal_6960 (Array Int Int))) (<= 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base| v_ArrVal_6960) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_6959 Int) (v_append_~node~0.base_142 Int)) (or (< v_ArrVal_6959 9) (< (select (store |c_#length| v_append_~node~0.base_142 v_ArrVal_6959) .cse1) .cse2))))))) is different from false [2024-10-24 16:20:33,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847483447] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:33,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:20:33,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 36] total 54 [2024-10-24 16:20:33,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23894236] [2024-10-24 16:20:33,689 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:20:33,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-10-24 16:20:33,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:33,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-10-24 16:20:33,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=2917, Unknown=1, NotChecked=110, Total=3306 [2024-10-24 16:20:33,690 INFO L87 Difference]: Start difference. First operand 145 states and 170 transitions. Second operand has 55 states, 54 states have (on average 3.2037037037037037) internal successors, (173), 52 states have internal predecessors, (173), 9 states have call successors, (10), 4 states have call predecessors, (10), 11 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12)