./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 a046e57d 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-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:43:19,357 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:43:19,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 10:43:19,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:43:19,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:43:19,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:43:19,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:43:19,468 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:43:19,469 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:43:19,471 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:43:19,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:43:19,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:43:19,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:43:19,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:43:19,476 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:43:19,476 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:43:19,476 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:43:19,477 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:43:19,477 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:43:19,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:43:19,480 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:43:19,482 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:43:19,482 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:43:19,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:43:19,483 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:43:19,484 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:43:19,484 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:43:19,484 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:43:19,484 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:43:19,485 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:43:19,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:43:19,485 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:43:19,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:43:19,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:43:19,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:43:19,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:43:19,487 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:43:19,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:43:19,488 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:43:19,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:43:19,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:43:19,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:43:19,489 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-13 10:43:19,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:43:19,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:43:19,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:43:19,782 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:43:19,783 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:43:19,784 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-13 10:43:21,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:43:21,537 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:43:21,537 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2024-10-13 10:43:21,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d32de0e0b/45301e1341c14bb5b3d1494a9d6e8f60/FLAG1d33abbfe [2024-10-13 10:43:21,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d32de0e0b/45301e1341c14bb5b3d1494a9d6e8f60 [2024-10-13 10:43:21,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:43:21,568 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:43:21,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:43:21,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:43:21,577 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:43:21,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:43:21" (1/1) ... [2024-10-13 10:43:21,580 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54ae6f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:21, skipping insertion in model container [2024-10-13 10:43:21,580 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:43:21" (1/1) ... [2024-10-13 10:43:21,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:43:21,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:43:21,984 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:43:22,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:43:22,079 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:43:22,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:22 WrapperNode [2024-10-13 10:43:22,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:43:22,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:43:22,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:43:22,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:43:22,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:22" (1/1) ... [2024-10-13 10:43:22,102 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:22" (1/1) ... [2024-10-13 10:43:22,130 INFO L138 Inliner]: procedures = 123, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 101 [2024-10-13 10:43:22,131 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:43:22,132 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:43:22,132 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:43:22,132 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:43:22,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:22" (1/1) ... [2024-10-13 10:43:22,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:22" (1/1) ... [2024-10-13 10:43:22,148 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:22" (1/1) ... [2024-10-13 10:43:22,177 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-13 10:43:22,177 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:22" (1/1) ... [2024-10-13 10:43:22,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:22" (1/1) ... [2024-10-13 10:43:22,186 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:22" (1/1) ... [2024-10-13 10:43:22,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:22" (1/1) ... [2024-10-13 10:43:22,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:22" (1/1) ... [2024-10-13 10:43:22,193 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:22" (1/1) ... [2024-10-13 10:43:22,196 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:43:22,197 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:43:22,197 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:43:22,197 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:43:22,198 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:22" (1/1) ... [2024-10-13 10:43:22,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:43:22,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:43:22,237 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-13 10:43:22,258 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-13 10:43:22,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 10:43:22,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 10:43:22,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 10:43:22,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:43:22,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:43:22,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:43:22,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:43:22,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 10:43:22,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:43:22,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:43:22,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 10:43:22,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:43:22,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 10:43:22,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 10:43:22,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 10:43:22,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:43:22,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:43:22,305 INFO L130 BoogieDeclarations]: Found specification of procedure append [2024-10-13 10:43:22,306 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2024-10-13 10:43:22,399 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:43:22,401 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:43:22,756 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-10-13 10:43:22,757 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:43:22,814 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:43:22,815 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-13 10:43:22,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:43:22 BoogieIcfgContainer [2024-10-13 10:43:22,815 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:43:22,818 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:43:22,818 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:43:22,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:43:22,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:43:21" (1/3) ... [2024-10-13 10:43:22,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f08b8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:43:22, skipping insertion in model container [2024-10-13 10:43:22,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:22" (2/3) ... [2024-10-13 10:43:22,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f08b8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:43:22, skipping insertion in model container [2024-10-13 10:43:22,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:43:22" (3/3) ... [2024-10-13 10:43:22,826 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03-2.i [2024-10-13 10:43:22,843 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:43:22,843 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2024-10-13 10:43:22,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:43:22,901 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;@5c50043e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:43:22,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2024-10-13 10:43:22,906 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-13 10:43:22,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 10:43:22,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:22,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 10:43:22,911 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-13 10:43:22,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:22,916 INFO L85 PathProgramCache]: Analyzing trace with hash 7041, now seen corresponding path program 1 times [2024-10-13 10:43:22,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:22,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938049020] [2024-10-13 10:43:22,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:22,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:23,137 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-13 10:43:23,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:23,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938049020] [2024-10-13 10:43:23,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938049020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:43:23,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:43:23,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:43:23,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352520394] [2024-10-13 10:43:23,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:43:23,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:43:23,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:23,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:43:23,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:43:23,212 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-13 10:43:23,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:23,398 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2024-10-13 10:43:23,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:43:23,401 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-13 10:43:23,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:23,414 INFO L225 Difference]: With dead ends: 146 [2024-10-13 10:43:23,415 INFO L226 Difference]: Without dead ends: 145 [2024-10-13 10:43:23,416 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-13 10:43:23,422 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.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:43:23,423 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.2s Time] [2024-10-13 10:43:23,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-13 10:43:23,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 110. [2024-10-13 10:43:23,459 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-13 10:43:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2024-10-13 10:43:23,462 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 2 [2024-10-13 10:43:23,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:23,462 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2024-10-13 10:43:23,463 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-13 10:43:23,463 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2024-10-13 10:43:23,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 10:43:23,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:23,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 10:43:23,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:43:23,464 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-13 10:43:23,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:23,465 INFO L85 PathProgramCache]: Analyzing trace with hash 7042, now seen corresponding path program 1 times [2024-10-13 10:43:23,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:23,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788514247] [2024-10-13 10:43:23,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:23,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:23,563 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-13 10:43:23,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:23,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788514247] [2024-10-13 10:43:23,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788514247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:43:23,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:43:23,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:43:23,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011440321] [2024-10-13 10:43:23,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:43:23,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:43:23,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:23,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:43:23,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:43:23,569 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-13 10:43:23,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:23,705 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2024-10-13 10:43:23,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:43:23,707 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-13 10:43:23,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:23,708 INFO L225 Difference]: With dead ends: 110 [2024-10-13 10:43:23,708 INFO L226 Difference]: Without dead ends: 110 [2024-10-13 10:43:23,709 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-13 10:43:23,710 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.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:43:23,712 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.1s Time] [2024-10-13 10:43:23,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-13 10:43:23,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2024-10-13 10:43:23,724 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-13 10:43:23,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2024-10-13 10:43:23,726 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 2 [2024-10-13 10:43:23,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:23,726 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2024-10-13 10:43:23,726 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-13 10:43:23,727 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2024-10-13 10:43:23,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 10:43:23,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:23,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 10:43:23,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:43:23,727 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-13 10:43:23,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:23,728 INFO L85 PathProgramCache]: Analyzing trace with hash 6771465, now seen corresponding path program 1 times [2024-10-13 10:43:23,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:23,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648739084] [2024-10-13 10:43:23,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:23,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:23,811 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-13 10:43:23,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:23,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648739084] [2024-10-13 10:43:23,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648739084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:43:23,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:43:23,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:43:23,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568314387] [2024-10-13 10:43:23,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:43:23,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:43:23,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:23,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:43:23,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:43:23,814 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-13 10:43:23,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:23,926 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2024-10-13 10:43:23,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:43:23,927 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-13 10:43:23,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:23,928 INFO L225 Difference]: With dead ends: 123 [2024-10-13 10:43:23,928 INFO L226 Difference]: Without dead ends: 123 [2024-10-13 10:43:23,928 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-13 10:43:23,929 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-13 10:43:23,930 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-13 10:43:23,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-13 10:43:23,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 111. [2024-10-13 10:43:23,943 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-13 10:43:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2024-10-13 10:43:23,946 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 4 [2024-10-13 10:43:23,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:23,946 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2024-10-13 10:43:23,948 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-13 10:43:23,948 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2024-10-13 10:43:23,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 10:43:23,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:23,949 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 10:43:23,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:43:23,949 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-13 10:43:23,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:23,950 INFO L85 PathProgramCache]: Analyzing trace with hash 6771466, now seen corresponding path program 1 times [2024-10-13 10:43:23,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:23,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306602371] [2024-10-13 10:43:23,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:23,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:24,087 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-13 10:43:24,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:24,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306602371] [2024-10-13 10:43:24,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306602371] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:43:24,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:43:24,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:43:24,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233820818] [2024-10-13 10:43:24,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:43:24,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:43:24,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:24,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:43:24,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:43:24,090 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-13 10:43:24,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:24,187 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2024-10-13 10:43:24,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:43:24,188 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-13 10:43:24,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:24,189 INFO L225 Difference]: With dead ends: 111 [2024-10-13 10:43:24,189 INFO L226 Difference]: Without dead ends: 111 [2024-10-13 10:43:24,189 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-13 10:43:24,190 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-13 10:43:24,191 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-13 10:43:24,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-13 10:43:24,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2024-10-13 10:43:24,203 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-13 10:43:24,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2024-10-13 10:43:24,207 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 4 [2024-10-13 10:43:24,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:24,207 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2024-10-13 10:43:24,208 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-13 10:43:24,208 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2024-10-13 10:43:24,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 10:43:24,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:24,208 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:43:24,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:43:24,209 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-13 10:43:24,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:24,209 INFO L85 PathProgramCache]: Analyzing trace with hash -489860542, now seen corresponding path program 1 times [2024-10-13 10:43:24,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:24,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377342797] [2024-10-13 10:43:24,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:24,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:24,293 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-13 10:43:24,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:24,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377342797] [2024-10-13 10:43:24,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377342797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:43:24,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:43:24,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:43:24,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049624740] [2024-10-13 10:43:24,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:43:24,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:43:24,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:24,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:43:24,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:43:24,298 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-13 10:43:24,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:24,388 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2024-10-13 10:43:24,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:43:24,388 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-13 10:43:24,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:24,389 INFO L225 Difference]: With dead ends: 104 [2024-10-13 10:43:24,390 INFO L226 Difference]: Without dead ends: 104 [2024-10-13 10:43:24,390 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-13 10:43:24,391 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-13 10:43:24,391 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-13 10:43:24,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-13 10:43:24,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-13 10:43:24,404 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-13 10:43:24,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2024-10-13 10:43:24,405 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 9 [2024-10-13 10:43:24,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:24,405 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2024-10-13 10:43:24,406 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-13 10:43:24,406 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2024-10-13 10:43:24,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 10:43:24,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:24,406 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:43:24,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:43:24,407 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-13 10:43:24,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:24,407 INFO L85 PathProgramCache]: Analyzing trace with hash -489860541, now seen corresponding path program 1 times [2024-10-13 10:43:24,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:24,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944741333] [2024-10-13 10:43:24,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:24,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:24,571 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-13 10:43:24,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:24,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944741333] [2024-10-13 10:43:24,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944741333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:43:24,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:43:24,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:43:24,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400672466] [2024-10-13 10:43:24,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:43:24,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:43:24,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:24,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:43:24,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:43:24,578 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-13 10:43:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:24,657 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2024-10-13 10:43:24,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:43:24,658 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-13 10:43:24,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:24,659 INFO L225 Difference]: With dead ends: 99 [2024-10-13 10:43:24,659 INFO L226 Difference]: Without dead ends: 99 [2024-10-13 10:43:24,659 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-13 10:43:24,660 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-13 10:43:24,660 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-13 10:43:24,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-13 10:43:24,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-13 10:43:24,667 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-13 10:43:24,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2024-10-13 10:43:24,668 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 9 [2024-10-13 10:43:24,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:24,669 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2024-10-13 10:43:24,669 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-13 10:43:24,669 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2024-10-13 10:43:24,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:43:24,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:24,670 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:43:24,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:43:24,671 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-13 10:43:24,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:24,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1994192483, now seen corresponding path program 1 times [2024-10-13 10:43:24,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:24,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286638484] [2024-10-13 10:43:24,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:24,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:24,918 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-13 10:43:24,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:24,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286638484] [2024-10-13 10:43:24,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286638484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:43:24,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:43:24,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:43:24,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526144259] [2024-10-13 10:43:24,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:43:24,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:43:24,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:24,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:43:24,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:43:24,921 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-13 10:43:25,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:25,156 INFO L93 Difference]: Finished difference Result 191 states and 212 transitions. [2024-10-13 10:43:25,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:43:25,157 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-13 10:43:25,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:25,158 INFO L225 Difference]: With dead ends: 191 [2024-10-13 10:43:25,158 INFO L226 Difference]: Without dead ends: 191 [2024-10-13 10:43:25,158 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-13 10:43:25,159 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-13 10:43:25,159 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-13 10:43:25,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-13 10:43:25,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 125. [2024-10-13 10:43:25,165 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-13 10:43:25,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 158 transitions. [2024-10-13 10:43:25,166 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 158 transitions. Word has length 10 [2024-10-13 10:43:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:25,166 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 158 transitions. [2024-10-13 10:43:25,166 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-13 10:43:25,166 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 158 transitions. [2024-10-13 10:43:25,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:43:25,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:25,167 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:43:25,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:43:25,168 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-13 10:43:25,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:25,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1994192484, now seen corresponding path program 1 times [2024-10-13 10:43:25,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:25,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236359144] [2024-10-13 10:43:25,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:25,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:25,432 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-13 10:43:25,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:25,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236359144] [2024-10-13 10:43:25,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236359144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:43:25,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:43:25,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:43:25,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404489936] [2024-10-13 10:43:25,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:43:25,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:43:25,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:25,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:43:25,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:43:25,435 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-13 10:43:25,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:25,625 INFO L93 Difference]: Finished difference Result 143 states and 179 transitions. [2024-10-13 10:43:25,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:43:25,626 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-13 10:43:25,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:25,627 INFO L225 Difference]: With dead ends: 143 [2024-10-13 10:43:25,627 INFO L226 Difference]: Without dead ends: 143 [2024-10-13 10:43:25,627 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-13 10:43:25,628 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.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:43:25,628 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.2s Time] [2024-10-13 10:43:25,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-13 10:43:25,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2024-10-13 10:43:25,640 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-13 10:43:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 179 transitions. [2024-10-13 10:43:25,641 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 179 transitions. Word has length 10 [2024-10-13 10:43:25,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:25,641 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 179 transitions. [2024-10-13 10:43:25,642 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-13 10:43:25,642 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 179 transitions. [2024-10-13 10:43:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 10:43:25,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:25,642 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:43:25,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:43:25,642 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-13 10:43:25,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:25,643 INFO L85 PathProgramCache]: Analyzing trace with hash 629331503, now seen corresponding path program 1 times [2024-10-13 10:43:25,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:25,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085644628] [2024-10-13 10:43:25,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:25,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:26,100 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-13 10:43:26,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:26,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085644628] [2024-10-13 10:43:26,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085644628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:43:26,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:43:26,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:43:26,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093540070] [2024-10-13 10:43:26,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:43:26,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:43:26,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:26,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:43:26,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:43:26,103 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-13 10:43:26,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:26,313 INFO L93 Difference]: Finished difference Result 143 states and 178 transitions. [2024-10-13 10:43:26,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:43:26,314 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-13 10:43:26,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:26,315 INFO L225 Difference]: With dead ends: 143 [2024-10-13 10:43:26,315 INFO L226 Difference]: Without dead ends: 143 [2024-10-13 10:43:26,315 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-13 10:43:26,316 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-13 10:43:26,316 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-13 10:43:26,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-13 10:43:26,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2024-10-13 10:43:26,321 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-13 10:43:26,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 178 transitions. [2024-10-13 10:43:26,323 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 178 transitions. Word has length 17 [2024-10-13 10:43:26,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:26,323 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 178 transitions. [2024-10-13 10:43:26,323 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-13 10:43:26,324 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 178 transitions. [2024-10-13 10:43:26,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 10:43:26,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:26,324 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-13 10:43:26,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 10:43:26,325 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-13 10:43:26,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:26,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1867377042, now seen corresponding path program 1 times [2024-10-13 10:43:26,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:26,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113621215] [2024-10-13 10:43:26,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:26,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:26,692 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-13 10:43:26,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:26,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113621215] [2024-10-13 10:43:26,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113621215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:43:26,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:43:26,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:43:26,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508078916] [2024-10-13 10:43:26,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:43:26,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:43:26,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:26,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:43:26,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:43:26,694 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-13 10:43:26,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:26,936 INFO L93 Difference]: Finished difference Result 166 states and 201 transitions. [2024-10-13 10:43:26,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:43:26,937 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-13 10:43:26,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:26,938 INFO L225 Difference]: With dead ends: 166 [2024-10-13 10:43:26,938 INFO L226 Difference]: Without dead ends: 166 [2024-10-13 10:43:26,938 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-13 10:43:26,939 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 128 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:43:26,939 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.2s Time] [2024-10-13 10:43:26,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-13 10:43:26,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 134. [2024-10-13 10:43:26,944 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-13 10:43:26,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 167 transitions. [2024-10-13 10:43:26,945 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 167 transitions. Word has length 18 [2024-10-13 10:43:26,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:26,945 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 167 transitions. [2024-10-13 10:43:26,945 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-13 10:43:26,946 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 167 transitions. [2024-10-13 10:43:26,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:43:26,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:26,947 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-13 10:43:26,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 10:43:26,947 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-13 10:43:26,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:26,948 INFO L85 PathProgramCache]: Analyzing trace with hash 116187578, now seen corresponding path program 1 times [2024-10-13 10:43:26,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:26,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112764679] [2024-10-13 10:43:26,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:26,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:27,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 10:43:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:27,042 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-13 10:43:27,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:27,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112764679] [2024-10-13 10:43:27,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112764679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:43:27,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:43:27,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:43:27,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386517673] [2024-10-13 10:43:27,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:43:27,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:43:27,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:27,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:43:27,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:43:27,045 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-13 10:43:27,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:27,148 INFO L93 Difference]: Finished difference Result 128 states and 146 transitions. [2024-10-13 10:43:27,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:43:27,149 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-13 10:43:27,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:27,150 INFO L225 Difference]: With dead ends: 128 [2024-10-13 10:43:27,150 INFO L226 Difference]: Without dead ends: 128 [2024-10-13 10:43:27,150 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-13 10:43:27,151 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-13 10:43:27,151 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-13 10:43:27,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-13 10:43:27,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 117. [2024-10-13 10:43:27,155 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-13 10:43:27,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 134 transitions. [2024-10-13 10:43:27,156 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 134 transitions. Word has length 24 [2024-10-13 10:43:27,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:27,156 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 134 transitions. [2024-10-13 10:43:27,156 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-13 10:43:27,156 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions. [2024-10-13 10:43:27,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:43:27,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:27,157 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-13 10:43:27,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 10:43:27,158 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-13 10:43:27,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:27,158 INFO L85 PathProgramCache]: Analyzing trace with hash 36702541, now seen corresponding path program 1 times [2024-10-13 10:43:27,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:27,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082664252] [2024-10-13 10:43:27,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:27,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:27,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 10:43:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:27,548 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-13 10:43:27,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:27,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082664252] [2024-10-13 10:43:27,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082664252] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:43:27,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610584649] [2024-10-13 10:43:27,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:27,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:43:27,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:43:27,552 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-13 10:43:27,553 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-13 10:43:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:27,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-13 10:43:27,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:43:27,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:43:27,943 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-13 10:43:27,957 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:43:27,958 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-13 10:43:27,978 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-13 10:43:27,979 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:43:28,319 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-13 10:43:28,347 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-10-13 10:43:28,348 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-13 10:43:28,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:43:28,554 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-13 10:43:28,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:43:28,691 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-13 10:43:28,783 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-13 10:43:28,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610584649] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:43:28,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:43:28,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2024-10-13 10:43:28,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003002033] [2024-10-13 10:43:28,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:43:28,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-13 10:43:28,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:28,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 10:43:28,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2024-10-13 10:43:28,788 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-13 10:43:29,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:29,549 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2024-10-13 10:43:29,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 10:43:29,550 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-13 10:43:29,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:29,551 INFO L225 Difference]: With dead ends: 151 [2024-10-13 10:43:29,551 INFO L226 Difference]: Without dead ends: 151 [2024-10-13 10:43:29,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2024-10-13 10:43:29,552 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 376 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:43:29,552 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.6s Time] [2024-10-13 10:43:29,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-13 10:43:29,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 114. [2024-10-13 10:43:29,556 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-13 10:43:29,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2024-10-13 10:43:29,557 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 26 [2024-10-13 10:43:29,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:29,557 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2024-10-13 10:43:29,557 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-13 10:43:29,557 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2024-10-13 10:43:29,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 10:43:29,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:29,559 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-13 10:43:29,578 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-13 10:43:29,763 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-13 10:43:29,764 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-13 10:43:29,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:29,764 INFO L85 PathProgramCache]: Analyzing trace with hash -393568986, now seen corresponding path program 1 times [2024-10-13 10:43:29,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:29,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142313230] [2024-10-13 10:43:29,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:29,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:30,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 10:43:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:30,131 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-13 10:43:30,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:30,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142313230] [2024-10-13 10:43:30,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142313230] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:43:30,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208699216] [2024-10-13 10:43:30,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:30,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:43:30,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:43:30,134 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-13 10:43:30,135 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-13 10:43:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:30,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 10:43:30,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:43:30,283 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-13 10:43:30,305 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-13 10:43:30,342 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 10:43:30,343 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-13 10:43:30,368 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 10:43:30,369 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-13 10:43:30,380 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-13 10:43:30,381 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:43:30,518 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-13 10:43:30,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208699216] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:43:30,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:43:30,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 11 [2024-10-13 10:43:30,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843585850] [2024-10-13 10:43:30,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:43:30,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 10:43:30,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:30,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 10:43:30,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=83, Unknown=1, NotChecked=18, Total=132 [2024-10-13 10:43:30,520 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-13 10:43:30,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:30,966 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2024-10-13 10:43:30,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 10:43:30,966 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-13 10:43:30,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:30,967 INFO L225 Difference]: With dead ends: 149 [2024-10-13 10:43:30,968 INFO L226 Difference]: Without dead ends: 149 [2024-10-13 10:43:30,968 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-13 10:43:30,969 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-13 10:43:30,969 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-13 10:43:30,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-13 10:43:30,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 122. [2024-10-13 10:43:30,972 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-13 10:43:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2024-10-13 10:43:30,973 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 27 [2024-10-13 10:43:30,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:30,973 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2024-10-13 10:43:30,973 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-13 10:43:30,973 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2024-10-13 10:43:30,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 10:43:30,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:30,974 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-13 10:43:30,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 10:43:31,178 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-13 10:43:31,179 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-13 10:43:31,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:31,179 INFO L85 PathProgramCache]: Analyzing trace with hash -393568985, now seen corresponding path program 1 times [2024-10-13 10:43:31,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:31,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077685057] [2024-10-13 10:43:31,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:31,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:31,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 10:43:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:31,557 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-13 10:43:31,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:31,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077685057] [2024-10-13 10:43:31,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077685057] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:43:31,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107230501] [2024-10-13 10:43:31,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:31,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:43:31,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:43:31,560 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-13 10:43:31,561 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-13 10:43:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:31,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-13 10:43:31,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:43:31,703 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-13 10:43:31,709 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-13 10:43:31,749 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-13 10:43:31,855 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-13 10:43:31,856 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-13 10:43:31,861 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-13 10:43:32,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:43:32,003 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-13 10:43:32,017 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-13 10:43:32,018 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-13 10:43:32,025 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-13 10:43:32,025 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:43:32,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107230501] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:43:32,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:43:32,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2024-10-13 10:43:32,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70859649] [2024-10-13 10:43:32,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:43:32,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 10:43:32,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:32,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 10:43:32,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=197, Unknown=1, NotChecked=28, Total=272 [2024-10-13 10:43:32,296 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-13 10:43:33,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:33,375 INFO L93 Difference]: Finished difference Result 275 states and 309 transitions. [2024-10-13 10:43:33,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-13 10:43:33,376 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-13 10:43:33,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:33,377 INFO L225 Difference]: With dead ends: 275 [2024-10-13 10:43:33,378 INFO L226 Difference]: Without dead ends: 275 [2024-10-13 10:43:33,378 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-13 10:43:33,379 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 234 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-13 10:43:33,380 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-13 10:43:33,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-13 10:43:33,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 170. [2024-10-13 10:43:33,388 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-13 10:43:33,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 212 transitions. [2024-10-13 10:43:33,389 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 212 transitions. Word has length 27 [2024-10-13 10:43:33,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:33,390 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 212 transitions. [2024-10-13 10:43:33,390 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-13 10:43:33,390 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 212 transitions. [2024-10-13 10:43:33,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 10:43:33,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:33,392 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-13 10:43:33,406 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-13 10:43:33,595 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-13 10:43:33,595 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-13 10:43:33,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:33,596 INFO L85 PathProgramCache]: Analyzing trace with hash 669604646, now seen corresponding path program 1 times [2024-10-13 10:43:33,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:33,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10190136] [2024-10-13 10:43:33,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:33,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:34,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 10:43:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:34,599 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-13 10:43:34,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:34,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10190136] [2024-10-13 10:43:34,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10190136] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:43:34,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592423104] [2024-10-13 10:43:34,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:34,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:43:34,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:43:34,602 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-13 10:43:34,605 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-13 10:43:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:34,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-13 10:43:34,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:43:34,773 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-13 10:43:34,777 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-13 10:43:34,867 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-13 10:43:34,870 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-13 10:43:34,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:43:34,973 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-13 10:43:34,982 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-10-13 10:43:34,983 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-13 10:43:35,034 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-13 10:43:35,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-13 10:43:35,038 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:43:35,433 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-13 10:43:35,437 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-13 10:43:35,462 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-13 10:43:35,670 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-13 10:43:35,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592423104] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:43:35,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:43:35,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 21 [2024-10-13 10:43:35,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691892642] [2024-10-13 10:43:35,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:43:35,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-13 10:43:35,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:35,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 10:43:35,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-10-13 10:43:35,673 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-13 10:43:36,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:36,541 INFO L93 Difference]: Finished difference Result 179 states and 220 transitions. [2024-10-13 10:43:36,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 10:43:36,542 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-13 10:43:36,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:36,543 INFO L225 Difference]: With dead ends: 179 [2024-10-13 10:43:36,543 INFO L226 Difference]: Without dead ends: 179 [2024-10-13 10:43:36,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2024-10-13 10:43:36,546 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 148 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:43:36,546 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.6s Time] [2024-10-13 10:43:36,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-13 10:43:36,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2024-10-13 10:43:36,555 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-13 10:43:36,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 216 transitions. [2024-10-13 10:43:36,556 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 216 transitions. Word has length 33 [2024-10-13 10:43:36,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:36,556 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 216 transitions. [2024-10-13 10:43:36,556 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-13 10:43:36,557 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 216 transitions. [2024-10-13 10:43:36,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 10:43:36,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:36,559 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-13 10:43:36,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 10:43:36,763 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-13 10:43:36,764 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-13 10:43:36,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:36,764 INFO L85 PathProgramCache]: Analyzing trace with hash 669604645, now seen corresponding path program 1 times [2024-10-13 10:43:36,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:36,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212537643] [2024-10-13 10:43:36,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:36,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:37,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 10:43:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:37,405 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-13 10:43:37,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:37,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212537643] [2024-10-13 10:43:37,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212537643] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:43:37,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14427767] [2024-10-13 10:43:37,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:37,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:43:37,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:43:37,408 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-13 10:43:37,410 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-13 10:43:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:37,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-13 10:43:37,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:43:37,591 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-13 10:43:37,647 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-13 10:43:37,709 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2024-10-13 10:43:37,709 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-13 10:43:37,736 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-13 10:43:37,738 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-13 10:43:37,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:43:37,913 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-13 10:43:38,265 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-13 10:43:38,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14427767] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:43:38,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:43:38,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 19 [2024-10-13 10:43:38,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319793678] [2024-10-13 10:43:38,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:43:38,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-13 10:43:38,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:38,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-13 10:43:38,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-10-13 10:43:38,268 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-13 10:43:38,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:38,818 INFO L93 Difference]: Finished difference Result 178 states and 219 transitions. [2024-10-13 10:43:38,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 10:43:38,819 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-13 10:43:38,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:38,820 INFO L225 Difference]: With dead ends: 178 [2024-10-13 10:43:38,823 INFO L226 Difference]: Without dead ends: 178 [2024-10-13 10:43:38,823 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-13 10:43:38,824 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 142 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-13 10:43:38,824 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-13 10:43:38,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-13 10:43:38,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2024-10-13 10:43:38,830 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-13 10:43:38,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 215 transitions. [2024-10-13 10:43:38,832 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 215 transitions. Word has length 33 [2024-10-13 10:43:38,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:38,832 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 215 transitions. [2024-10-13 10:43:38,832 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-13 10:43:38,833 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 215 transitions. [2024-10-13 10:43:38,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 10:43:38,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:38,836 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-13 10:43:38,851 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-13 10:43:39,036 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-13 10:43:39,037 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-13 10:43:39,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:39,037 INFO L85 PathProgramCache]: Analyzing trace with hash 181640716, now seen corresponding path program 1 times [2024-10-13 10:43:39,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:39,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947330972] [2024-10-13 10:43:39,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:39,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:39,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 10:43:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:39,626 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-13 10:43:39,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:39,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947330972] [2024-10-13 10:43:39,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947330972] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:43:39,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580909759] [2024-10-13 10:43:39,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:39,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:43:39,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:43:39,629 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-13 10:43:39,630 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-13 10:43:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:39,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-13 10:43:39,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:43:39,801 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-13 10:43:39,810 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:43:39,810 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-13 10:43:39,815 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-13 10:43:39,820 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-13 10:43:39,827 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-13 10:43:39,834 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-13 10:43:40,132 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-13 10:43:40,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:43:40,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580909759] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:43:40,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:43:40,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2024-10-13 10:43:40,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731236565] [2024-10-13 10:43:40,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:43:40,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 10:43:40,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:40,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 10:43:40,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=281, Unknown=7, NotChecked=0, Total=342 [2024-10-13 10:43:40,233 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-13 10:43:40,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:40,685 INFO L93 Difference]: Finished difference Result 244 states and 300 transitions. [2024-10-13 10:43:40,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 10:43:40,686 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-13 10:43:40,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:40,687 INFO L225 Difference]: With dead ends: 244 [2024-10-13 10:43:40,687 INFO L226 Difference]: Without dead ends: 244 [2024-10-13 10:43:40,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=528, Unknown=7, NotChecked=0, Total=650 [2024-10-13 10:43:40,688 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-13 10:43:40,688 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-13 10:43:40,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-13 10:43:40,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 186. [2024-10-13 10:43:40,693 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-13 10:43:40,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 228 transitions. [2024-10-13 10:43:40,694 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 228 transitions. Word has length 34 [2024-10-13 10:43:40,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:40,695 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 228 transitions. [2024-10-13 10:43:40,695 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-13 10:43:40,695 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 228 transitions. [2024-10-13 10:43:40,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-13 10:43:40,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:40,696 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-13 10:43:40,713 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-13 10:43:40,900 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-13 10:43:40,901 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-13 10:43:40,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:40,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1434077745, now seen corresponding path program 1 times [2024-10-13 10:43:40,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:40,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411521939] [2024-10-13 10:43:40,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:40,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:41,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 10:43:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:41,783 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-13 10:43:41,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:41,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411521939] [2024-10-13 10:43:41,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411521939] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:43:41,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427868562] [2024-10-13 10:43:41,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:41,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:43:41,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:43:41,787 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-13 10:43:41,788 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-13 10:43:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:41,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-13 10:43:41,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:43:41,969 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-13 10:43:41,988 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:43:41,989 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-13 10:43:42,008 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-13 10:43:42,012 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-13 10:43:46,208 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-13 10:43:46,218 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-13 10:43:46,314 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-13 10:43:46,314 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:43:46,382 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (and (forall ((v_ArrVal_1696 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_1697 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1697) |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0)))) is different from false [2024-10-13 10:43:46,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427868562] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:43:46,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:43:46,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2024-10-13 10:43:46,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773203537] [2024-10-13 10:43:46,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:43:46,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-13 10:43:46,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:46,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 10:43:46,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=399, Unknown=3, NotChecked=82, Total=552 [2024-10-13 10:43:46,385 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-13 10:43:50,503 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-13 10:43:50,506 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-13 10:43:50,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:50,864 INFO L93 Difference]: Finished difference Result 234 states and 291 transitions. [2024-10-13 10:43:50,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 10:43:50,865 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-13 10:43:50,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:50,866 INFO L225 Difference]: With dead ends: 234 [2024-10-13 10:43:50,866 INFO L226 Difference]: Without dead ends: 234 [2024-10-13 10:43:50,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=129, Invalid=634, Unknown=5, NotChecked=162, Total=930 [2024-10-13 10:43:50,867 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 66 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:43:50,867 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.3s Time] [2024-10-13 10:43:50,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-13 10:43:50,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 197. [2024-10-13 10:43:50,876 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-13 10:43:50,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 241 transitions. [2024-10-13 10:43:50,877 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 241 transitions. Word has length 35 [2024-10-13 10:43:50,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:50,878 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 241 transitions. [2024-10-13 10:43:50,878 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-13 10:43:50,878 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 241 transitions. [2024-10-13 10:43:50,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 10:43:50,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:50,879 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-13 10:43:50,896 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-13 10:43:51,083 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-13 10:43:51,084 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-13 10:43:51,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:51,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1196597603, now seen corresponding path program 1 times [2024-10-13 10:43:51,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:51,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213777146] [2024-10-13 10:43:51,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:51,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:51,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 10:43:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:51,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 10:43:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:51,212 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-13 10:43:51,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:51,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213777146] [2024-10-13 10:43:51,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213777146] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:43:51,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139546538] [2024-10-13 10:43:51,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:51,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:43:51,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:43:51,215 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-13 10:43:51,216 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-13 10:43:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:51,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:43:51,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:43:51,425 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-13 10:43:51,425 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:43:51,452 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-13 10:43:51,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139546538] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:43:51,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:43:51,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-10-13 10:43:51,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375046427] [2024-10-13 10:43:51,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:43:51,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:43:51,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:51,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:43:51,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:43:51,456 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-13 10:43:51,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:51,594 INFO L93 Difference]: Finished difference Result 243 states and 301 transitions. [2024-10-13 10:43:51,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:43:51,595 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-13 10:43:51,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:51,596 INFO L225 Difference]: With dead ends: 243 [2024-10-13 10:43:51,596 INFO L226 Difference]: Without dead ends: 243 [2024-10-13 10:43:51,596 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-13 10:43:51,597 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-13 10:43:51,597 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-13 10:43:51,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-10-13 10:43:51,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 233. [2024-10-13 10:43:51,602 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-13 10:43:51,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 301 transitions. [2024-10-13 10:43:51,603 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 301 transitions. Word has length 39 [2024-10-13 10:43:51,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:51,604 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 301 transitions. [2024-10-13 10:43:51,604 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-13 10:43:51,604 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 301 transitions. [2024-10-13 10:43:51,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-13 10:43:51,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:51,607 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-13 10:43:51,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-13 10:43:51,808 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-13 10:43:51,808 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-13 10:43:51,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:51,809 INFO L85 PathProgramCache]: Analyzing trace with hash -287814160, now seen corresponding path program 1 times [2024-10-13 10:43:51,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:51,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241160461] [2024-10-13 10:43:51,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:51,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:52,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 10:43:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:52,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 10:43:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:52,987 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-13 10:43:52,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:52,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241160461] [2024-10-13 10:43:52,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241160461] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:43:52,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563826931] [2024-10-13 10:43:52,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:52,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:43:52,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:43:52,990 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-13 10:43:52,992 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-13 10:43:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:53,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-13 10:43:53,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:43:53,226 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-13 10:43:53,232 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-13 10:43:53,311 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-13 10:43:53,317 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-13 10:43:53,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:43:53,397 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-13 10:43:53,404 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-10-13 10:43:53,405 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-13 10:43:53,452 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-13 10:43:53,476 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-13 10:43:53,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:43:53,825 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-13 10:43:53,835 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-13 10:43:53,838 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-13 10:43:54,069 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-13 10:43:54,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563826931] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:43:54,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:43:54,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6, 6] total 24 [2024-10-13 10:43:54,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492817192] [2024-10-13 10:43:54,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:43:54,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-13 10:43:54,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:54,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-13 10:43:54,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2024-10-13 10:43:54,072 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-13 10:43:54,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:54,929 INFO L93 Difference]: Finished difference Result 299 states and 379 transitions. [2024-10-13 10:43:54,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 10:43:54,929 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-13 10:43:54,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:54,931 INFO L225 Difference]: With dead ends: 299 [2024-10-13 10:43:54,931 INFO L226 Difference]: Without dead ends: 299 [2024-10-13 10:43:54,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=1088, Unknown=0, NotChecked=0, Total=1260 [2024-10-13 10:43:54,934 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-13 10:43:54,935 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-13 10:43:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-13 10:43:54,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 241. [2024-10-13 10:43:54,947 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-13 10:43:54,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 298 transitions. [2024-10-13 10:43:54,949 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 298 transitions. Word has length 49 [2024-10-13 10:43:54,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:54,949 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 298 transitions. [2024-10-13 10:43:54,950 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-13 10:43:54,950 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 298 transitions. [2024-10-13 10:43:54,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-13 10:43:54,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:54,950 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-13 10:43:54,969 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-13 10:43:55,151 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-13 10:43:55,151 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-13 10:43:55,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:55,152 INFO L85 PathProgramCache]: Analyzing trace with hash -287814161, now seen corresponding path program 1 times [2024-10-13 10:43:55,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:55,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136410252] [2024-10-13 10:43:55,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:55,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:55,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 10:43:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:55,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 10:43:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:55,867 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-13 10:43:55,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:55,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136410252] [2024-10-13 10:43:55,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136410252] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:43:55,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45239535] [2024-10-13 10:43:55,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:55,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:43:55,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:43:55,870 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-13 10:43:55,871 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-13 10:43:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:56,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-13 10:43:56,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:43:56,126 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-13 10:43:56,177 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-13 10:43:56,230 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2024-10-13 10:43:56,230 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-13 10:43:56,261 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-13 10:43:56,263 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-13 10:43:56,263 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:43:56,403 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-13 10:43:56,718 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-13 10:43:56,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45239535] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:43:56,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:43:56,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6, 6] total 21 [2024-10-13 10:43:56,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440543329] [2024-10-13 10:43:56,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:43:56,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-13 10:43:56,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:56,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 10:43:56,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2024-10-13 10:43:56,720 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-13 10:43:57,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:57,311 INFO L93 Difference]: Finished difference Result 273 states and 327 transitions. [2024-10-13 10:43:57,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 10:43:57,311 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-13 10:43:57,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:57,312 INFO L225 Difference]: With dead ends: 273 [2024-10-13 10:43:57,312 INFO L226 Difference]: Without dead ends: 273 [2024-10-13 10:43:57,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2024-10-13 10:43:57,313 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.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:43:57,314 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.5s Time] [2024-10-13 10:43:57,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-13 10:43:57,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 241. [2024-10-13 10:43:57,318 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-13 10:43:57,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 296 transitions. [2024-10-13 10:43:57,321 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 296 transitions. Word has length 49 [2024-10-13 10:43:57,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:57,321 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 296 transitions. [2024-10-13 10:43:57,321 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-13 10:43:57,321 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 296 transitions. [2024-10-13 10:43:57,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-13 10:43:57,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:57,322 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-13 10:43:57,338 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-13 10:43:57,522 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-13 10:43:57,523 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-13 10:43:57,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:57,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1007553657, now seen corresponding path program 1 times [2024-10-13 10:43:57,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:57,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584376548] [2024-10-13 10:43:57,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:57,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:57,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 10:43:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:57,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-13 10:43:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:57,631 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-13 10:43:57,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:57,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584376548] [2024-10-13 10:43:57,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584376548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:43:57,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:43:57,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:43:57,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344133434] [2024-10-13 10:43:57,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:43:57,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:43:57,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:57,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:43:57,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:43:57,633 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-13 10:43:57,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:57,725 INFO L93 Difference]: Finished difference Result 239 states and 293 transitions. [2024-10-13 10:43:57,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:43:57,727 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-13 10:43:57,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:57,728 INFO L225 Difference]: With dead ends: 239 [2024-10-13 10:43:57,728 INFO L226 Difference]: Without dead ends: 239 [2024-10-13 10:43:57,728 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-13 10:43:57,729 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-13 10:43:57,729 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-13 10:43:57,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-13 10:43:57,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2024-10-13 10:43:57,734 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-13 10:43:57,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 293 transitions. [2024-10-13 10:43:57,735 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 293 transitions. Word has length 50 [2024-10-13 10:43:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:57,735 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 293 transitions. [2024-10-13 10:43:57,736 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-13 10:43:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 293 transitions. [2024-10-13 10:43:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-13 10:43:57,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:57,736 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-13 10:43:57,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 10:43:57,737 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-13 10:43:57,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:57,737 INFO L85 PathProgramCache]: Analyzing trace with hash 338435944, now seen corresponding path program 1 times [2024-10-13 10:43:57,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:57,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103723234] [2024-10-13 10:43:57,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:57,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:58,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 10:43:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:58,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-13 10:43:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:58,262 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-13 10:43:58,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:58,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103723234] [2024-10-13 10:43:58,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103723234] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:43:58,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510625441] [2024-10-13 10:43:58,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:58,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:43:58,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:43:58,265 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-13 10:43:58,266 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-13 10:43:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:58,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-13 10:43:58,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:43:58,521 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-13 10:43:58,541 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:43:58,542 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-13 10:43:58,564 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-13 10:43:58,568 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-13 10:43:58,691 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-13 10:43:58,697 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-13 10:43:58,765 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-13 10:43:58,768 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-13 10:43:58,861 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-13 10:43:58,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:43:58,923 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-13 10:43:58,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510625441] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:43:58,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:43:58,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2024-10-13 10:43:58,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455035440] [2024-10-13 10:43:58,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:43:58,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-13 10:43:58,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:58,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 10:43:58,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=449, Unknown=1, NotChecked=42, Total=552 [2024-10-13 10:43:58,926 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-13 10:43:59,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:59,911 INFO L93 Difference]: Finished difference Result 268 states and 320 transitions. [2024-10-13 10:43:59,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-13 10:43:59,911 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-13 10:43:59,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:59,913 INFO L225 Difference]: With dead ends: 268 [2024-10-13 10:43:59,913 INFO L226 Difference]: Without dead ends: 268 [2024-10-13 10:43:59,914 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-13 10:43:59,915 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.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:43:59,915 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.5s Time] [2024-10-13 10:43:59,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-13 10:43:59,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 206. [2024-10-13 10:43:59,923 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-13 10:43:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 248 transitions. [2024-10-13 10:43:59,924 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 248 transitions. Word has length 51 [2024-10-13 10:43:59,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:59,925 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 248 transitions. [2024-10-13 10:43:59,926 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-13 10:43:59,926 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 248 transitions. [2024-10-13 10:43:59,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-13 10:43:59,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:59,927 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-13 10:43:59,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-13 10:44:00,130 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-13 10:44:00,131 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-13 10:44:00,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:00,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1354466599, now seen corresponding path program 1 times [2024-10-13 10:44:00,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:00,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524742233] [2024-10-13 10:44:00,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:00,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:00,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 10:44:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:00,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-13 10:44:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:00,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 10:44:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:01,029 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-13 10:44:01,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:01,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524742233] [2024-10-13 10:44:01,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524742233] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:44:01,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673094779] [2024-10-13 10:44:01,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:01,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:44:01,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:44:01,032 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-13 10:44:01,033 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-13 10:44:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:01,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-10-13 10:44:01,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:44:01,297 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-13 10:44:01,300 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-13 10:44:01,411 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-13 10:44:01,463 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-10-13 10:44:01,463 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-13 10:44:01,487 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2024-10-13 10:44:01,488 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-13 10:44:01,652 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-13 10:44:01,667 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-13 10:44:01,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:44:01,671 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-13 10:44:01,682 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-13 10:44:01,683 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-13 10:44:01,774 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-13 10:44:01,774 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-13 10:44:01,904 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-10-13 10:44:01,904 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-13 10:44:01,995 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-13 10:44:01,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:44:06,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673094779] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:44:06,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:44:06,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 24 [2024-10-13 10:44:06,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493641349] [2024-10-13 10:44:06,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:44:06,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-13 10:44:06,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:06,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-13 10:44:06,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=609, Unknown=1, NotChecked=50, Total=756 [2024-10-13 10:44:06,273 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-13 10:44:10,312 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-13 10:44:14,356 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-13 10:44:15,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:15,500 INFO L93 Difference]: Finished difference Result 217 states and 255 transitions. [2024-10-13 10:44:15,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 10:44:15,501 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-13 10:44:15,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:15,502 INFO L225 Difference]: With dead ends: 217 [2024-10-13 10:44:15,502 INFO L226 Difference]: Without dead ends: 217 [2024-10-13 10:44:15,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=230, Invalid=1333, Unknown=1, NotChecked=76, Total=1640 [2024-10-13 10:44:15,503 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-13 10:44:15,503 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-13 10:44:15,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-13 10:44:15,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 138. [2024-10-13 10:44:15,507 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-13 10:44:15,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 156 transitions. [2024-10-13 10:44:15,507 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 156 transitions. Word has length 61 [2024-10-13 10:44:15,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:15,508 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 156 transitions. [2024-10-13 10:44:15,508 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-13 10:44:15,508 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 156 transitions. [2024-10-13 10:44:15,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-13 10:44:15,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:15,509 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-13 10:44:15,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-13 10:44:15,710 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-13 10:44:15,711 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-13 10:44:15,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:15,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1682704199, now seen corresponding path program 2 times [2024-10-13 10:44:15,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:15,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974407438] [2024-10-13 10:44:15,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:15,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:16,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 10:44:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:16,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 10:44:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:16,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 10:44:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:16,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 10:44:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:16,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 10:44:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:16,410 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-13 10:44:16,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:16,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974407438] [2024-10-13 10:44:16,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974407438] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:44:16,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363976931] [2024-10-13 10:44:16,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:44:16,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:44:16,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:44:16,412 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-13 10:44:16,413 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-13 10:44:17,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:44:17,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:44:17,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:44:17,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:44:17,094 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-13 10:44:17,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:44:17,193 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-13 10:44:17,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363976931] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:44:17,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:44:17,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2024-10-13 10:44:17,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181411675] [2024-10-13 10:44:17,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:44:17,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 10:44:17,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:17,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 10:44:17,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-10-13 10:44:17,195 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-13 10:44:17,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:17,642 INFO L93 Difference]: Finished difference Result 168 states and 176 transitions. [2024-10-13 10:44:17,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 10:44:17,643 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-13 10:44:17,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:17,644 INFO L225 Difference]: With dead ends: 168 [2024-10-13 10:44:17,644 INFO L226 Difference]: Without dead ends: 168 [2024-10-13 10:44:17,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 175 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2024-10-13 10:44:17,645 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.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:44:17,645 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.3s Time] [2024-10-13 10:44:17,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-13 10:44:17,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 148. [2024-10-13 10:44:17,650 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-13 10:44:17,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 176 transitions. [2024-10-13 10:44:17,651 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 176 transitions. Word has length 84 [2024-10-13 10:44:17,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:17,651 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 176 transitions. [2024-10-13 10:44:17,651 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-13 10:44:17,652 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 176 transitions. [2024-10-13 10:44:17,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-13 10:44:17,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:17,653 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-13 10:44:17,676 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-13 10:44:17,853 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-13 10:44:17,853 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-13 10:44:17,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:17,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1316747392, now seen corresponding path program 1 times [2024-10-13 10:44:17,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:17,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027281289] [2024-10-13 10:44:17,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:17,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:18,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 10:44:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:19,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 10:44:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:19,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 10:44:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:19,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 10:44:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:19,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 10:44:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:19,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 10:44:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:19,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 10:44:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:19,471 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-13 10:44:19,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:19,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027281289] [2024-10-13 10:44:19,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027281289] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:44:19,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110644275] [2024-10-13 10:44:19,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:19,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:44:19,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:44:19,475 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-13 10:44:19,477 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-13 10:44:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:19,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 1139 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-10-13 10:44:19,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:44:20,027 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-13 10:44:20,080 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-13 10:44:20,081 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-13 10:44:20,152 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-13 10:44:20,153 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-13 10:44:20,232 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-13 10:44:20,259 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-10-13 10:44:20,260 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-13 10:44:20,437 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-13 10:44:20,451 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-13 10:44:20,451 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-13 10:44:20,531 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-13 10:44:20,550 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-10-13 10:44:20,551 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-13 10:44:20,650 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-13 10:44:20,665 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-13 10:44:20,665 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-13 10:44:20,688 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-13 10:44:20,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:44:21,141 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-13 10:44:21,921 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-13 10:44:22,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110644275] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:44:22,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:44:22,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13] total 17 [2024-10-13 10:44:22,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004599231] [2024-10-13 10:44:22,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:44:22,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 10:44:22,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:22,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 10:44:22,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=494, Unknown=1, NotChecked=46, Total=650 [2024-10-13 10:44:22,202 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-13 10:44:22,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:22,874 INFO L93 Difference]: Finished difference Result 169 states and 197 transitions. [2024-10-13 10:44:22,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 10:44:22,875 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-13 10:44:22,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:22,876 INFO L225 Difference]: With dead ends: 169 [2024-10-13 10:44:22,876 INFO L226 Difference]: Without dead ends: 169 [2024-10-13 10:44:22,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 182 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=231, Invalid=894, Unknown=1, NotChecked=64, Total=1190 [2024-10-13 10:44:22,878 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 92 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:44:22,878 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.3s Time] [2024-10-13 10:44:22,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-13 10:44:22,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 147. [2024-10-13 10:44:22,882 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-13 10:44:22,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 175 transitions. [2024-10-13 10:44:22,883 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 175 transitions. Word has length 119 [2024-10-13 10:44:22,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:22,883 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 175 transitions. [2024-10-13 10:44:22,884 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-13 10:44:22,884 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 175 transitions. [2024-10-13 10:44:22,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-13 10:44:22,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:22,885 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-13 10:44:22,910 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-13 10:44:23,089 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-13 10:44:23,090 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-13 10:44:23,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:23,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1316747391, now seen corresponding path program 1 times [2024-10-13 10:44:23,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:23,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759021430] [2024-10-13 10:44:23,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:23,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:24,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 10:44:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:24,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 10:44:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:24,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 10:44:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:24,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 10:44:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:24,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 10:44:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:25,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 10:44:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:25,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 10:44:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:25,233 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-13 10:44:25,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:25,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759021430] [2024-10-13 10:44:25,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759021430] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:44:25,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49947005] [2024-10-13 10:44:25,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:25,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:44:25,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:44:25,236 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-13 10:44:25,238 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-13 10:44:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:25,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 1139 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-10-13 10:44:25,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:44:25,962 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-13 10:44:26,036 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-13 10:44:26,036 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-13 10:44:26,042 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-13 10:44:26,067 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-13 10:44:26,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:44:26,114 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-13 10:44:26,124 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:44:26,124 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-13 10:44:26,232 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-13 10:44:26,234 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-13 10:44:26,389 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-13 10:44:26,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 10:44:26,464 INFO L349 Elim1Store]: treesize reduction 48, result has 44.8 percent of original size [2024-10-13 10:44:26,465 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-13 10:44:26,801 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-13 10:44:26,805 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-13 10:44:26,820 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-10-13 10:44:26,821 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-13 10:44:27,129 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-13 10:44:27,139 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-13 10:44:27,163 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-10-13 10:44:27,164 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-13 10:44:27,221 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-13 10:44:27,221 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:44:27,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49947005] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:44:27,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:44:27,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 25] total 37 [2024-10-13 10:44:27,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716145376] [2024-10-13 10:44:27,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:44:27,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-13 10:44:27,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:27,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-13 10:44:27,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1263, Unknown=2, NotChecked=146, Total=1560 [2024-10-13 10:44:27,406 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-13 10:44:31,451 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-13 10:44:35,466 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-13 10:44:39,476 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]