./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/length_test03-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:24:21,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:24:21,843 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 13:24:21,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:24:21,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:24:21,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:24:21,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:24:21,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:24:21,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:24:21,876 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:24:21,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:24:21,877 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:24:21,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:24:21,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:24:21,878 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:24:21,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:24:21,880 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:24:21,880 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:24:21,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:24:21,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:24:21,881 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:24:21,882 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:24:21,882 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:24:21,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:24:21,882 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:24:21,883 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:24:21,883 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:24:21,883 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:24:21,883 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:24:21,883 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:24:21,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:24:21,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:24:21,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:24:21,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:24:21,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:24:21,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:24:21,885 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:24:21,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:24:21,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:24:21,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:24:21,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:24:21,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:24:21,887 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-11-12 13:24:22,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:24:22,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:24:22,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:24:22,115 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:24:22,116 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:24:22,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2024-11-12 13:24:23,475 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:24:23,687 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:24:23,689 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2024-11-12 13:24:23,705 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d846871c5/2c6785d320214132be77ee89fa49f973/FLAG94cc15dbf [2024-11-12 13:24:24,041 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d846871c5/2c6785d320214132be77ee89fa49f973 [2024-11-12 13:24:24,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:24:24,044 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:24:24,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:24:24,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:24:24,049 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:24:24,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:24:24" (1/1) ... [2024-11-12 13:24:24,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29ec8eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:24:24, skipping insertion in model container [2024-11-12 13:24:24,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:24:24" (1/1) ... [2024-11-12 13:24:24,075 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:24:24,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:24:24,369 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:24:24,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:24:24,443 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:24:24,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:24:24 WrapperNode [2024-11-12 13:24:24,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:24:24,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:24:24,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:24:24,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:24:24,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:24:24" (1/1) ... [2024-11-12 13:24:24,461 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:24:24" (1/1) ... [2024-11-12 13:24:24,488 INFO L138 Inliner]: procedures = 123, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 101 [2024-11-12 13:24:24,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:24:24,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:24:24,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:24:24,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:24:24,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:24:24" (1/1) ... [2024-11-12 13:24:24,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:24:24" (1/1) ... [2024-11-12 13:24:24,515 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:24:24" (1/1) ... [2024-11-12 13:24:24,537 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-11-12 13:24:24,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:24:24" (1/1) ... [2024-11-12 13:24:24,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:24:24" (1/1) ... [2024-11-12 13:24:24,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:24:24" (1/1) ... [2024-11-12 13:24:24,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:24:24" (1/1) ... [2024-11-12 13:24:24,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:24:24" (1/1) ... [2024-11-12 13:24:24,554 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:24:24" (1/1) ... [2024-11-12 13:24:24,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:24:24,560 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:24:24,560 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:24:24,561 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:24:24,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:24:24" (1/1) ... [2024-11-12 13:24:24,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:24:24,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:24,595 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-11-12 13:24:24,603 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-11-12 13:24:24,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 13:24:24,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 13:24:24,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 13:24:24,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 13:24:24,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 13:24:24,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 13:24:24,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 13:24:24,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 13:24:24,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 13:24:24,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 13:24:24,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 13:24:24,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:24:24,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 13:24:24,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 13:24:24,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 13:24:24,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:24:24,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:24:24,642 INFO L130 BoogieDeclarations]: Found specification of procedure append [2024-11-12 13:24:24,642 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2024-11-12 13:24:24,740 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:24:24,742 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:24:25,039 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-11-12 13:24:25,039 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:24:25,050 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:24:25,050 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-12 13:24:25,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:24:25 BoogieIcfgContainer [2024-11-12 13:24:25,051 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:24:25,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:24:25,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:24:25,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:24:25,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:24:24" (1/3) ... [2024-11-12 13:24:25,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4269d58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:24:25, skipping insertion in model container [2024-11-12 13:24:25,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:24:24" (2/3) ... [2024-11-12 13:24:25,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4269d58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:24:25, skipping insertion in model container [2024-11-12 13:24:25,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:24:25" (3/3) ... [2024-11-12 13:24:25,057 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03-2.i [2024-11-12 13:24:25,070 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:24:25,070 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2024-11-12 13:24:25,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:24:25,110 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;@15359f4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:24:25,110 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2024-11-12 13:24:25,114 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 67 states have (on average 2.029850746268657) internal successors, (136), 126 states have internal predecessors, (136), 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-11-12 13:24:25,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-12 13:24:25,117 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:25,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-12 13:24:25,118 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-11-12 13:24:25,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:25,124 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-12 13:24:25,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:25,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842990459] [2024-11-12 13:24:25,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:25,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:25,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:25,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:25,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842990459] [2024-11-12 13:24:25,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842990459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:24:25,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:24:25,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:24:25,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796135826] [2024-11-12 13:24:25,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:24:25,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:24:25,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:25,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:24:25,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:24:25,332 INFO L87 Difference]: Start difference. First operand has 130 states, 67 states have (on average 2.029850746268657) internal successors, (136), 126 states have internal predecessors, (136), 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.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-12 13:24:25,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:25,546 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2024-11-12 13:24:25,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:24:25,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-12 13:24:25,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:25,559 INFO L225 Difference]: With dead ends: 167 [2024-11-12 13:24:25,559 INFO L226 Difference]: Without dead ends: 165 [2024-11-12 13:24:25,560 INFO L434 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-11-12 13:24:25,563 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 51 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:25,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 172 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:24:25,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-12 13:24:25,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 126. [2024-11-12 13:24:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 66 states have (on average 1.9393939393939394) internal successors, (128), 122 states have internal predecessors, (128), 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-11-12 13:24:25,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2024-11-12 13:24:25,598 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 3 [2024-11-12 13:24:25,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:25,599 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2024-11-12 13:24:25,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-12 13:24:25,599 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2024-11-12 13:24:25,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-12 13:24:25,599 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:25,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-12 13:24:25,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 13:24:25,600 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-11-12 13:24:25,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:25,601 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-12 13:24:25,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:25,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135461047] [2024-11-12 13:24:25,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:25,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:25,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:25,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:25,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135461047] [2024-11-12 13:24:25,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135461047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:24:25,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:24:25,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:24:25,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577355733] [2024-11-12 13:24:25,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:24:25,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:24:25,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:25,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:24:25,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:24:25,665 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-12 13:24:25,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:25,755 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2024-11-12 13:24:25,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:24:25,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-12 13:24:25,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:25,756 INFO L225 Difference]: With dead ends: 126 [2024-11-12 13:24:25,756 INFO L226 Difference]: Without dead ends: 126 [2024-11-12 13:24:25,757 INFO L434 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-11-12 13:24:25,757 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 10 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:25,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 193 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:24:25,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-12 13:24:25,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2024-11-12 13:24:25,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 120 states have internal predecessors, (126), 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-11-12 13:24:25,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2024-11-12 13:24:25,764 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 3 [2024-11-12 13:24:25,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:25,765 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2024-11-12 13:24:25,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-12 13:24:25,765 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2024-11-12 13:24:25,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 13:24:25,765 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:25,765 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 13:24:25,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 13:24:25,766 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-11-12 13:24:25,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:25,766 INFO L85 PathProgramCache]: Analyzing trace with hash 889446152, now seen corresponding path program 1 times [2024-11-12 13:24:25,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:25,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677107441] [2024-11-12 13:24:25,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:25,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:25,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:25,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:25,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677107441] [2024-11-12 13:24:25,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677107441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:24:25,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:24:25,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:24:25,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792983007] [2024-11-12 13:24:25,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:24:25,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:24:25,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:25,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:24:25,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:24:25,818 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-12 13:24:25,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:25,892 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2024-11-12 13:24:25,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:24:25,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-12 13:24:25,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:25,893 INFO L225 Difference]: With dead ends: 140 [2024-11-12 13:24:25,893 INFO L226 Difference]: Without dead ends: 140 [2024-11-12 13:24:25,893 INFO L434 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-11-12 13:24:25,894 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 24 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:25,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 177 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:24:25,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-12 13:24:25,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 127. [2024-11-12 13:24:25,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.8591549295774648) internal successors, (132), 123 states have internal predecessors, (132), 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-11-12 13:24:25,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2024-11-12 13:24:25,901 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 6 [2024-11-12 13:24:25,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:25,901 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2024-11-12 13:24:25,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-12 13:24:25,901 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2024-11-12 13:24:25,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 13:24:25,902 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:25,902 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 13:24:25,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 13:24:25,902 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-11-12 13:24:25,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:25,903 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2024-11-12 13:24:25,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:25,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985170036] [2024-11-12 13:24:25,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:25,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:25,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:25,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:25,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985170036] [2024-11-12 13:24:25,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985170036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:24:25,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:24:25,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:24:25,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810166170] [2024-11-12 13:24:25,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:24:25,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:24:25,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:25,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:24:25,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:24:25,967 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-12 13:24:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:26,027 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2024-11-12 13:24:26,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:24:26,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-12 13:24:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:26,028 INFO L225 Difference]: With dead ends: 127 [2024-11-12 13:24:26,028 INFO L226 Difference]: Without dead ends: 127 [2024-11-12 13:24:26,028 INFO L434 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-11-12 13:24:26,029 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 4 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:26,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 194 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:24:26,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-12 13:24:26,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2024-11-12 13:24:26,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 71 states have (on average 1.8309859154929577) internal successors, (130), 121 states have internal predecessors, (130), 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-11-12 13:24:26,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2024-11-12 13:24:26,035 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 6 [2024-11-12 13:24:26,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:26,035 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2024-11-12 13:24:26,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-12 13:24:26,035 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2024-11-12 13:24:26,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 13:24:26,036 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:26,036 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:24:26,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 13:24:26,036 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-11-12 13:24:26,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:26,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1036552302, now seen corresponding path program 1 times [2024-11-12 13:24:26,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:26,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829958075] [2024-11-12 13:24:26,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:26,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:26,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:26,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:26,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829958075] [2024-11-12 13:24:26,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829958075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:24:26,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:24:26,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:24:26,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183063117] [2024-11-12 13:24:26,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:24:26,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:24:26,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:26,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:24:26,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:24:26,113 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-11-12 13:24:26,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:26,174 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2024-11-12 13:24:26,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:24:26,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2024-11-12 13:24:26,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:26,175 INFO L225 Difference]: With dead ends: 120 [2024-11-12 13:24:26,175 INFO L226 Difference]: Without dead ends: 120 [2024-11-12 13:24:26,175 INFO L434 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-11-12 13:24:26,176 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 35 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:26,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 145 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:24:26,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-12 13:24:26,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-12 13:24:26,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 71 states have (on average 1.7605633802816902) internal successors, (125), 116 states have internal predecessors, (125), 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-11-12 13:24:26,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2024-11-12 13:24:26,181 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 12 [2024-11-12 13:24:26,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:26,182 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2024-11-12 13:24:26,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-11-12 13:24:26,182 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2024-11-12 13:24:26,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 13:24:26,182 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:26,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:24:26,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 13:24:26,183 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-11-12 13:24:26,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:26,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1036552303, now seen corresponding path program 1 times [2024-11-12 13:24:26,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:26,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752591002] [2024-11-12 13:24:26,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:26,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:26,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:26,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:26,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752591002] [2024-11-12 13:24:26,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752591002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:24:26,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:24:26,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:24:26,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289061265] [2024-11-12 13:24:26,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:24:26,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:24:26,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:26,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:24:26,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:24:26,361 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-11-12 13:24:26,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:26,411 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2024-11-12 13:24:26,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:24:26,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2024-11-12 13:24:26,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:26,413 INFO L225 Difference]: With dead ends: 115 [2024-11-12 13:24:26,413 INFO L226 Difference]: Without dead ends: 115 [2024-11-12 13:24:26,413 INFO L434 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-11-12 13:24:26,414 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 35 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:26,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 154 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:24:26,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-12 13:24:26,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-12 13:24:26,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 71 states have (on average 1.6901408450704225) internal successors, (120), 111 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:24:26,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2024-11-12 13:24:26,418 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 12 [2024-11-12 13:24:26,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:26,419 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2024-11-12 13:24:26,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-11-12 13:24:26,419 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2024-11-12 13:24:26,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 13:24:26,419 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:26,419 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:24:26,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 13:24:26,419 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-11-12 13:24:26,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:26,420 INFO L85 PathProgramCache]: Analyzing trace with hash 2068350391, now seen corresponding path program 1 times [2024-11-12 13:24:26,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:26,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549411865] [2024-11-12 13:24:26,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:26,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:26,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:26,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:26,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549411865] [2024-11-12 13:24:26,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549411865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:24:26,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:24:26,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:24:26,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438333262] [2024-11-12 13:24:26,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:24:26,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:24:26,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:26,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:24:26,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:24:26,602 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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-11-12 13:24:26,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:26,781 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2024-11-12 13:24:26,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:24:26,782 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 13 [2024-11-12 13:24:26,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:26,783 INFO L225 Difference]: With dead ends: 221 [2024-11-12 13:24:26,783 INFO L226 Difference]: Without dead ends: 221 [2024-11-12 13:24:26,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-11-12 13:24:26,784 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 240 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:26,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 220 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:24:26,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-12 13:24:26,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 149. [2024-11-12 13:24:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 110 states have (on average 1.6181818181818182) internal successors, (178), 144 states have internal predecessors, (178), 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-11-12 13:24:26,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 182 transitions. [2024-11-12 13:24:26,790 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 182 transitions. Word has length 13 [2024-11-12 13:24:26,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:26,790 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 182 transitions. [2024-11-12 13:24:26,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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-11-12 13:24:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 182 transitions. [2024-11-12 13:24:26,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 13:24:26,791 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:26,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:24:26,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 13:24:26,791 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-11-12 13:24:26,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:26,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2068350392, now seen corresponding path program 1 times [2024-11-12 13:24:26,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:26,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907009376] [2024-11-12 13:24:26,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:26,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:26,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:26,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:26,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907009376] [2024-11-12 13:24:26,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907009376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:24:26,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:24:26,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:24:26,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314888330] [2024-11-12 13:24:26,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:24:26,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:24:26,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:26,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:24:26,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:24:26,982 INFO L87 Difference]: Start difference. First operand 149 states and 182 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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-11-12 13:24:27,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:27,147 INFO L93 Difference]: Finished difference Result 171 states and 207 transitions. [2024-11-12 13:24:27,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:24:27,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 13 [2024-11-12 13:24:27,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:27,149 INFO L225 Difference]: With dead ends: 171 [2024-11-12 13:24:27,149 INFO L226 Difference]: Without dead ends: 171 [2024-11-12 13:24:27,149 INFO L434 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-11-12 13:24:27,150 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 25 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:27,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 330 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:24:27,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-12 13:24:27,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2024-11-12 13:24:27,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 129 states have (on average 1.558139534883721) internal successors, (201), 163 states have internal predecessors, (201), 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-11-12 13:24:27,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 207 transitions. [2024-11-12 13:24:27,155 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 207 transitions. Word has length 13 [2024-11-12 13:24:27,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:27,155 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 207 transitions. [2024-11-12 13:24:27,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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-11-12 13:24:27,156 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 207 transitions. [2024-11-12 13:24:27,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:24:27,156 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:27,156 INFO L218 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] [2024-11-12 13:24:27,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 13:24:27,157 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-11-12 13:24:27,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:27,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1480883050, now seen corresponding path program 1 times [2024-11-12 13:24:27,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:27,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445082098] [2024-11-12 13:24:27,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:27,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:27,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:27,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:27,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445082098] [2024-11-12 13:24:27,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445082098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:24:27,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:24:27,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:24:27,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276872950] [2024-11-12 13:24:27,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:24:27,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:24:27,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:27,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:24:27,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:24:27,459 INFO L87 Difference]: Start difference. First operand 169 states and 207 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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-11-12 13:24:27,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:27,690 INFO L93 Difference]: Finished difference Result 171 states and 206 transitions. [2024-11-12 13:24:27,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:24:27,690 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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 22 [2024-11-12 13:24:27,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:27,691 INFO L225 Difference]: With dead ends: 171 [2024-11-12 13:24:27,691 INFO L226 Difference]: Without dead ends: 171 [2024-11-12 13:24:27,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:24:27,692 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 38 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:27,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 676 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:24:27,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-12 13:24:27,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2024-11-12 13:24:27,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 129 states have (on average 1.550387596899225) internal successors, (200), 163 states have internal predecessors, (200), 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-11-12 13:24:27,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 206 transitions. [2024-11-12 13:24:27,706 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 206 transitions. Word has length 22 [2024-11-12 13:24:27,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:27,706 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 206 transitions. [2024-11-12 13:24:27,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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-11-12 13:24:27,707 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 206 transitions. [2024-11-12 13:24:27,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 13:24:27,708 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:27,708 INFO L218 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-11-12 13:24:27,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 13:24:27,708 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-11-12 13:24:27,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:27,708 INFO L85 PathProgramCache]: Analyzing trace with hash -439263795, now seen corresponding path program 1 times [2024-11-12 13:24:27,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:27,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560269824] [2024-11-12 13:24:27,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:27,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:28,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:28,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:28,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560269824] [2024-11-12 13:24:28,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560269824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:24:28,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:24:28,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 13:24:28,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881580389] [2024-11-12 13:24:28,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:24:28,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 13:24:28,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:28,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 13:24:28,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:24:28,126 INFO L87 Difference]: Start difference. First operand 169 states and 206 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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-11-12 13:24:28,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:28,347 INFO L93 Difference]: Finished difference Result 196 states and 231 transitions. [2024-11-12 13:24:28,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:24:28,347 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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 24 [2024-11-12 13:24:28,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:28,348 INFO L225 Difference]: With dead ends: 196 [2024-11-12 13:24:28,348 INFO L226 Difference]: Without dead ends: 196 [2024-11-12 13:24:28,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-12 13:24:28,349 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 113 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:28,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 509 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:24:28,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-12 13:24:28,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 160. [2024-11-12 13:24:28,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 121 states have (on average 1.5454545454545454) internal successors, (187), 154 states have internal predecessors, (187), 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-11-12 13:24:28,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 193 transitions. [2024-11-12 13:24:28,352 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 193 transitions. Word has length 24 [2024-11-12 13:24:28,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:28,352 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 193 transitions. [2024-11-12 13:24:28,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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-11-12 13:24:28,352 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 193 transitions. [2024-11-12 13:24:28,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-12 13:24:28,353 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:28,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:24:28,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 13:24:28,353 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-11-12 13:24:28,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:28,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1442887251, now seen corresponding path program 1 times [2024-11-12 13:24:28,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:28,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227663968] [2024-11-12 13:24:28,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:28,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:28,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:28,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:28,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:28,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227663968] [2024-11-12 13:24:28,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227663968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:24:28,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:24:28,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:24:28,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120701581] [2024-11-12 13:24:28,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:24:28,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:24:28,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:28,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:24:28,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:24:28,518 INFO L87 Difference]: Start difference. First operand 160 states and 193 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-11-12 13:24:28,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:28,667 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2024-11-12 13:24:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:24:28,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 30 [2024-11-12 13:24:28,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:28,672 INFO L225 Difference]: With dead ends: 153 [2024-11-12 13:24:28,672 INFO L226 Difference]: Without dead ends: 153 [2024-11-12 13:24:28,672 INFO L434 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-11-12 13:24:28,672 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 13 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:28,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 248 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:24:28,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-12 13:24:28,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 139. [2024-11-12 13:24:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 100 states have (on average 1.5) internal successors, (150), 133 states have internal predecessors, (150), 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-11-12 13:24:28,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 156 transitions. [2024-11-12 13:24:28,679 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 156 transitions. Word has length 30 [2024-11-12 13:24:28,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:28,679 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 156 transitions. [2024-11-12 13:24:28,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-11-12 13:24:28,679 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 156 transitions. [2024-11-12 13:24:28,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-12 13:24:28,679 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:28,680 INFO L218 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, 1, 1, 1, 1, 1, 1] [2024-11-12 13:24:28,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 13:24:28,680 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-11-12 13:24:28,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:28,680 INFO L85 PathProgramCache]: Analyzing trace with hash -610198618, now seen corresponding path program 1 times [2024-11-12 13:24:28,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:28,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851290969] [2024-11-12 13:24:28,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:28,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:28,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:29,053 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:29,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:29,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851290969] [2024-11-12 13:24:29,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851290969] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:29,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051531980] [2024-11-12 13:24:29,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:29,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:29,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:29,056 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-11-12 13:24:29,057 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-11-12 13:24:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:29,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-12 13:24:29,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:29,383 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 13:24:29,383 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-11-12 13:24:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:29,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:29,605 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 37 treesize of output 33 [2024-11-12 13:24:29,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:24:29,866 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 32 treesize of output 34 [2024-11-12 13:24:29,968 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:29,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051531980] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:24:29,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:24:29,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 21 [2024-11-12 13:24:29,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603647719] [2024-11-12 13:24:29,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:29,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 13:24:29,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:29,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 13:24:29,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2024-11-12 13:24:29,971 INFO L87 Difference]: Start difference. First operand 139 states and 156 transitions. Second operand has 22 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 18 states have internal predecessors, (77), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:24:30,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:30,504 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2024-11-12 13:24:30,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 13:24:30,504 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 18 states have internal predecessors, (77), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2024-11-12 13:24:30,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:30,505 INFO L225 Difference]: With dead ends: 147 [2024-11-12 13:24:30,505 INFO L226 Difference]: Without dead ends: 147 [2024-11-12 13:24:30,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2024-11-12 13:24:30,506 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 330 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:30,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 651 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:24:30,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-12 13:24:30,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2024-11-12 13:24:30,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 130 states have internal predecessors, (140), 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-11-12 13:24:30,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2024-11-12 13:24:30,509 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 32 [2024-11-12 13:24:30,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:30,509 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2024-11-12 13:24:30,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 18 states have internal predecessors, (77), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:24:30,509 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2024-11-12 13:24:30,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 13:24:30,510 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:30,510 INFO L218 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, 1, 1, 1, 1, 1, 1] [2024-11-12 13:24:30,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 13:24:30,711 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-11-12 13:24:30,711 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-11-12 13:24:30,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:30,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1027331565, now seen corresponding path program 1 times [2024-11-12 13:24:30,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:30,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853540463] [2024-11-12 13:24:30,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:30,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:30,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:30,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:30,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:30,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853540463] [2024-11-12 13:24:30,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853540463] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:30,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675112278] [2024-11-12 13:24:30,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:30,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:30,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:30,924 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-11-12 13:24:30,951 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-11-12 13:24:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:31,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-12 13:24:31,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:31,065 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-11-12 13:24:31,084 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-11-12 13:24:31,144 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-12 13:24:31,145 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-11-12 13:24:31,169 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-12 13:24:31,169 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-11-12 13:24:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-12 13:24:31,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:31,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675112278] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:31,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:24:31,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2024-11-12 13:24:31,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827393635] [2024-11-12 13:24:31,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:31,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 13:24:31,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:31,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 13:24:31,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2024-11-12 13:24:31,238 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 13:24:31,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:31,567 INFO L93 Difference]: Finished difference Result 169 states and 182 transitions. [2024-11-12 13:24:31,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 13:24:31,568 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-11-12 13:24:31,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:31,569 INFO L225 Difference]: With dead ends: 169 [2024-11-12 13:24:31,569 INFO L226 Difference]: Without dead ends: 169 [2024-11-12 13:24:31,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=283, Unknown=1, NotChecked=36, Total=420 [2024-11-12 13:24:31,570 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 139 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:31,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 300 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 322 Invalid, 0 Unknown, 145 Unchecked, 0.2s Time] [2024-11-12 13:24:31,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-12 13:24:31,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 139. [2024-11-12 13:24:31,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 101 states have (on average 1.4257425742574257) internal successors, (144), 133 states have internal predecessors, (144), 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-11-12 13:24:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 151 transitions. [2024-11-12 13:24:31,574 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 151 transitions. Word has length 33 [2024-11-12 13:24:31,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:31,574 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 151 transitions. [2024-11-12 13:24:31,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 13:24:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 151 transitions. [2024-11-12 13:24:31,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 13:24:31,575 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:31,575 INFO L218 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, 1, 1, 1, 1, 1, 1] [2024-11-12 13:24:31,590 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-11-12 13:24:31,775 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-11-12 13:24:31,776 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-11-12 13:24:31,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:31,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1027331566, now seen corresponding path program 1 times [2024-11-12 13:24:31,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:31,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660712928] [2024-11-12 13:24:31,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:31,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:31,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:32,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:32,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660712928] [2024-11-12 13:24:32,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660712928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:32,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092492950] [2024-11-12 13:24:32,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:32,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:32,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:32,084 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-11-12 13:24:32,085 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-11-12 13:24:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:32,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 13:24:32,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:32,196 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-11-12 13:24:32,201 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-11-12 13:24:32,245 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-11-12 13:24:32,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:24:32,303 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-11-12 13:24:32,308 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:24:32,308 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-11-12 13:24:32,358 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 13:24:32,359 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-11-12 13:24:32,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-12 13:24:32,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:32,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092492950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:32,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:24:32,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2024-11-12 13:24:32,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90693717] [2024-11-12 13:24:32,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:32,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 13:24:32,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:32,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 13:24:32,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=253, Unknown=1, NotChecked=32, Total=342 [2024-11-12 13:24:32,581 INFO L87 Difference]: Start difference. First operand 139 states and 151 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:24:33,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:33,038 INFO L93 Difference]: Finished difference Result 232 states and 256 transitions. [2024-11-12 13:24:33,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 13:24:33,038 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-11-12 13:24:33,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:33,039 INFO L225 Difference]: With dead ends: 232 [2024-11-12 13:24:33,039 INFO L226 Difference]: Without dead ends: 232 [2024-11-12 13:24:33,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=491, Unknown=1, NotChecked=46, Total=650 [2024-11-12 13:24:33,040 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 151 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:33,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 488 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 495 Invalid, 0 Unknown, 186 Unchecked, 0.3s Time] [2024-11-12 13:24:33,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-12 13:24:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 196. [2024-11-12 13:24:33,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 156 states have (on average 1.4423076923076923) internal successors, (225), 187 states have internal predecessors, (225), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-12 13:24:33,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 234 transitions. [2024-11-12 13:24:33,044 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 234 transitions. Word has length 33 [2024-11-12 13:24:33,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:33,044 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 234 transitions. [2024-11-12 13:24:33,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:24:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 234 transitions. [2024-11-12 13:24:33,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-12 13:24:33,045 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:33,045 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:24:33,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 13:24:33,246 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-11-12 13:24:33,247 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-11-12 13:24:33,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:33,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1240813252, now seen corresponding path program 1 times [2024-11-12 13:24:33,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:33,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193038461] [2024-11-12 13:24:33,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:33,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:33,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:33,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:33,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193038461] [2024-11-12 13:24:33,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193038461] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:33,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277562056] [2024-11-12 13:24:33,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:33,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:33,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:33,982 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-11-12 13:24:33,983 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-11-12 13:24:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:34,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-12 13:24:34,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:34,113 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-11-12 13:24:34,115 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-11-12 13:24:34,199 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-11-12 13:24:34,202 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-11-12 13:24:34,317 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-12 13:24:34,318 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-11-12 13:24:34,322 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-11-12 13:24:34,371 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-11-12 13:24:34,375 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:34,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:34,691 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-11-12 13:24:34,694 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-11-12 13:24:34,713 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-11-12 13:24:34,892 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:34,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277562056] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:24:34,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:24:34,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 21 [2024-11-12 13:24:34,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065553496] [2024-11-12 13:24:34,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:34,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 13:24:34,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:34,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 13:24:34,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-11-12 13:24:34,894 INFO L87 Difference]: Start difference. First operand 196 states and 234 transitions. Second operand has 22 states, 21 states have (on average 4.904761904761905) internal successors, (103), 20 states have internal predecessors, (103), 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-11-12 13:24:35,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:35,503 INFO L93 Difference]: Finished difference Result 205 states and 242 transitions. [2024-11-12 13:24:35,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 13:24:35,503 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.904761904761905) internal successors, (103), 20 states have internal predecessors, (103), 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 41 [2024-11-12 13:24:35,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:35,504 INFO L225 Difference]: With dead ends: 205 [2024-11-12 13:24:35,504 INFO L226 Difference]: Without dead ends: 205 [2024-11-12 13:24:35,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2024-11-12 13:24:35,505 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 186 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:35,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 702 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:24:35,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-12 13:24:35,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 200. [2024-11-12 13:24:35,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 160 states have (on average 1.425) internal successors, (228), 191 states have internal predecessors, (228), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:24:35,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 236 transitions. [2024-11-12 13:24:35,509 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 236 transitions. Word has length 41 [2024-11-12 13:24:35,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:35,509 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 236 transitions. [2024-11-12 13:24:35,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.904761904761905) internal successors, (103), 20 states have internal predecessors, (103), 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-11-12 13:24:35,509 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 236 transitions. [2024-11-12 13:24:35,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-12 13:24:35,510 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:35,510 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:24:35,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 13:24:35,711 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-11-12 13:24:35,711 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-11-12 13:24:35,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:35,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1240813253, now seen corresponding path program 1 times [2024-11-12 13:24:35,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:35,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270822980] [2024-11-12 13:24:35,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:35,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:36,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:36,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:36,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:36,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270822980] [2024-11-12 13:24:36,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270822980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:36,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931734313] [2024-11-12 13:24:36,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:36,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:36,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:36,135 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-11-12 13:24:36,136 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-11-12 13:24:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:36,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-12 13:24:36,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:36,269 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-11-12 13:24:36,330 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-11-12 13:24:36,374 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2024-11-12 13:24:36,374 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-11-12 13:24:36,399 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-11-12 13:24:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:36,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:36,534 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-11-12 13:24:36,875 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:36,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931734313] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:24:36,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:24:36,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 19 [2024-11-12 13:24:36,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806868129] [2024-11-12 13:24:36,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:36,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-12 13:24:36,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:36,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-12 13:24:36,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-11-12 13:24:36,877 INFO L87 Difference]: Start difference. First operand 200 states and 236 transitions. Second operand has 20 states, 19 states have (on average 4.842105263157895) internal successors, (92), 18 states have internal predecessors, (92), 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-11-12 13:24:37,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:37,395 INFO L93 Difference]: Finished difference Result 202 states and 239 transitions. [2024-11-12 13:24:37,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 13:24:37,396 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.842105263157895) internal successors, (92), 18 states have internal predecessors, (92), 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 41 [2024-11-12 13:24:37,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:37,396 INFO L225 Difference]: With dead ends: 202 [2024-11-12 13:24:37,396 INFO L226 Difference]: Without dead ends: 202 [2024-11-12 13:24:37,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 75 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-11-12 13:24:37,397 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 143 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:37,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 857 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:24:37,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-12 13:24:37,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2024-11-12 13:24:37,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 160 states have (on average 1.41875) internal successors, (227), 191 states have internal predecessors, (227), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:24:37,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 235 transitions. [2024-11-12 13:24:37,401 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 235 transitions. Word has length 41 [2024-11-12 13:24:37,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:37,401 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 235 transitions. [2024-11-12 13:24:37,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.842105263157895) internal successors, (92), 18 states have internal predecessors, (92), 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-11-12 13:24:37,401 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 235 transitions. [2024-11-12 13:24:37,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-12 13:24:37,402 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:37,402 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:24:37,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-12 13:24:37,604 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-11-12 13:24:37,605 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-11-12 13:24:37,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:37,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1836513292, now seen corresponding path program 1 times [2024-11-12 13:24:37,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:37,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036605043] [2024-11-12 13:24:37,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:37,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:37,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:38,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:38,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:38,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036605043] [2024-11-12 13:24:38,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036605043] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:38,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245328394] [2024-11-12 13:24:38,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:38,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:38,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:38,119 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-11-12 13:24:38,120 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-11-12 13:24:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:38,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-12 13:24:38,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:38,271 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-11-12 13:24:38,279 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:24:38,280 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-11-12 13:24:38,283 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-11-12 13:24:38,288 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-11-12 13:24:38,295 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 27 treesize of output 11 [2024-11-12 13:24:38,300 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 21 treesize of output 20 [2024-11-12 13:24:38,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:38,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:38,598 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1487 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1487) |c_ULTIMATE.start_main_~list2~0#1.base|) |c_ULTIMATE.start_main_~list2~0#1.offset|) 0)) (forall ((v_ArrVal_1488 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1488) |c_ULTIMATE.start_main_~list2~0#1.base|) |c_ULTIMATE.start_main_~list2~0#1.offset|) 0))) is different from false [2024-11-12 13:24:38,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245328394] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:38,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:24:38,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 19 [2024-11-12 13:24:38,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001279215] [2024-11-12 13:24:38,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:38,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 13:24:38,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:38,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 13:24:38,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=292, Unknown=1, NotChecked=34, Total=380 [2024-11-12 13:24:38,600 INFO L87 Difference]: Start difference. First operand 200 states and 235 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 15 states have internal predecessors, (53), 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-11-12 13:24:39,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:39,092 INFO L93 Difference]: Finished difference Result 284 states and 336 transitions. [2024-11-12 13:24:39,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 13:24:39,093 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 15 states have internal predecessors, (53), 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 42 [2024-11-12 13:24:39,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:39,094 INFO L225 Difference]: With dead ends: 284 [2024-11-12 13:24:39,094 INFO L226 Difference]: Without dead ends: 284 [2024-11-12 13:24:39,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=580, Unknown=1, NotChecked=50, Total=756 [2024-11-12 13:24:39,095 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 206 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:39,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 863 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:24:39,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-12 13:24:39,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 212. [2024-11-12 13:24:39,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 170 states have (on average 1.4) internal successors, (238), 201 states have internal predecessors, (238), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 13:24:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 250 transitions. [2024-11-12 13:24:39,098 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 250 transitions. Word has length 42 [2024-11-12 13:24:39,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:39,099 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 250 transitions. [2024-11-12 13:24:39,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 15 states have internal predecessors, (53), 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-11-12 13:24:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 250 transitions. [2024-11-12 13:24:39,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-12 13:24:39,100 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:39,100 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:24:39,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-12 13:24:39,304 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-11-12 13:24:39,305 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-11-12 13:24:39,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:39,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1591414825, now seen corresponding path program 1 times [2024-11-12 13:24:39,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:39,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635001874] [2024-11-12 13:24:39,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:39,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:39,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:40,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:40,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635001874] [2024-11-12 13:24:40,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635001874] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:40,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912450991] [2024-11-12 13:24:40,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:40,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:40,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:40,104 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-11-12 13:24:40,120 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-11-12 13:24:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:40,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-12 13:24:40,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:40,271 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-11-12 13:24:40,291 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:24:40,291 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-11-12 13:24:40,306 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-11-12 13:24:40,310 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-11-12 13:24:44,468 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-11-12 13:24:44,477 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-11-12 13:24:44,561 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 9 treesize of output 3 [2024-11-12 13:24:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:44,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:44,684 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (and (forall ((v_ArrVal_1695 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1695) |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0)) (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)))) is different from false [2024-11-12 13:24:44,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912450991] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:44,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:24:44,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2024-11-12 13:24:44,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357440107] [2024-11-12 13:24:44,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:44,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-12 13:24:44,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:44,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-12 13:24:44,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=576, Unknown=3, NotChecked=98, Total=756 [2024-11-12 13:24:44,687 INFO L87 Difference]: Start difference. First operand 212 states and 250 transitions. Second operand has 25 states, 25 states have (on average 2.52) internal successors, (63), 20 states have internal predecessors, (63), 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-11-12 13:24:48,828 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-11-12 13:24:48,830 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-11-12 13:24:49,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:49,211 INFO L93 Difference]: Finished difference Result 260 states and 310 transitions. [2024-11-12 13:24:49,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 13:24:49,211 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 20 states have internal predecessors, (63), 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 44 [2024-11-12 13:24:49,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:49,212 INFO L225 Difference]: With dead ends: 260 [2024-11-12 13:24:49,212 INFO L226 Difference]: Without dead ends: 260 [2024-11-12 13:24:49,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=156, Invalid=907, Unknown=5, NotChecked=192, Total=1260 [2024-11-12 13:24:49,213 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 94 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:49,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1074 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 756 Invalid, 0 Unknown, 181 Unchecked, 0.4s Time] [2024-11-12 13:24:49,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-12 13:24:49,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 215. [2024-11-12 13:24:49,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 173 states have (on average 1.393063583815029) internal successors, (241), 204 states have internal predecessors, (241), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 13:24:49,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 253 transitions. [2024-11-12 13:24:49,219 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 253 transitions. Word has length 44 [2024-11-12 13:24:49,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:49,219 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 253 transitions. [2024-11-12 13:24:49,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 20 states have internal predecessors, (63), 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-11-12 13:24:49,219 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 253 transitions. [2024-11-12 13:24:49,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 13:24:49,221 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:49,221 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1] [2024-11-12 13:24:49,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-12 13:24:49,425 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-11-12 13:24:49,427 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-11-12 13:24:49,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:49,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1452710056, now seen corresponding path program 1 times [2024-11-12 13:24:49,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:49,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151024004] [2024-11-12 13:24:49,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:49,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:49,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:49,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 13:24:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-12 13:24:49,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:49,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151024004] [2024-11-12 13:24:49,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151024004] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:49,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572612883] [2024-11-12 13:24:49,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:49,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:49,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:49,559 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-11-12 13:24:49,560 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-11-12 13:24:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:49,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 13:24:49,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:49,724 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-12 13:24:49,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:49,748 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-12 13:24:49,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572612883] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:24:49,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:24:49,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-11-12 13:24:49,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059799473] [2024-11-12 13:24:49,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:49,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:24:49,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:49,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:24:49,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:24:49,750 INFO L87 Difference]: Start difference. First operand 215 states and 253 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 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-11-12 13:24:49,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:49,861 INFO L93 Difference]: Finished difference Result 275 states and 327 transitions. [2024-11-12 13:24:49,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:24:49,861 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 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 48 [2024-11-12 13:24:49,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:49,862 INFO L225 Difference]: With dead ends: 275 [2024-11-12 13:24:49,862 INFO L226 Difference]: Without dead ends: 275 [2024-11-12 13:24:49,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 96 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-11-12 13:24:49,863 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 70 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:49,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 349 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:24:49,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-12 13:24:49,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 265. [2024-11-12 13:24:49,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 219 states have (on average 1.4018264840182648) internal successors, (307), 248 states have internal predecessors, (307), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 13:24:49,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 327 transitions. [2024-11-12 13:24:49,868 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 327 transitions. Word has length 48 [2024-11-12 13:24:49,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:49,869 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 327 transitions. [2024-11-12 13:24:49,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 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-11-12 13:24:49,869 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 327 transitions. [2024-11-12 13:24:49,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 13:24:49,869 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:49,869 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 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, 1] [2024-11-12 13:24:49,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-12 13:24:50,071 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-11-12 13:24:50,071 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-12 13:24:50,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:50,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1487400799, now seen corresponding path program 1 times [2024-11-12 13:24:50,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:50,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927139188] [2024-11-12 13:24:50,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:50,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:50,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:50,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 13:24:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:50,162 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-12 13:24:50,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:50,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927139188] [2024-11-12 13:24:50,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927139188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:24:50,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:24:50,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:24:50,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784869896] [2024-11-12 13:24:50,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:24:50,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:24:50,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:50,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:24:50,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:24:50,164 INFO L87 Difference]: Start difference. First operand 265 states and 327 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-11-12 13:24:50,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:50,235 INFO L93 Difference]: Finished difference Result 268 states and 330 transitions. [2024-11-12 13:24:50,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:24:50,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-11-12 13:24:50,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:50,238 INFO L225 Difference]: With dead ends: 268 [2024-11-12 13:24:50,238 INFO L226 Difference]: Without dead ends: 268 [2024-11-12 13:24:50,239 INFO L434 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-11-12 13:24:50,239 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:50,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:24:50,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-12 13:24:50,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2024-11-12 13:24:50,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 222 states have (on average 1.3963963963963963) internal successors, (310), 251 states have internal predecessors, (310), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 13:24:50,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 330 transitions. [2024-11-12 13:24:50,249 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 330 transitions. Word has length 50 [2024-11-12 13:24:50,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:50,249 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 330 transitions. [2024-11-12 13:24:50,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-11-12 13:24:50,250 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 330 transitions. [2024-11-12 13:24:50,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-12 13:24:50,250 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:50,250 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 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] [2024-11-12 13:24:50,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 13:24:50,250 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-12 13:24:50,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:50,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1096013604, now seen corresponding path program 1 times [2024-11-12 13:24:50,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:50,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576259634] [2024-11-12 13:24:50,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:50,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:50,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:50,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 13:24:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:50,682 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:24:50,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:50,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576259634] [2024-11-12 13:24:50,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576259634] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:50,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374867482] [2024-11-12 13:24:50,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:50,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:50,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:50,685 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-11-12 13:24:50,686 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-11-12 13:24:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:50,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 13:24:50,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:50,899 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 19 treesize of output 1 [2024-11-12 13:24:51,085 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:51,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:51,234 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 32 treesize of output 26 [2024-11-12 13:24:51,270 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:51,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374867482] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:24:51,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:24:51,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 22 [2024-11-12 13:24:51,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123890072] [2024-11-12 13:24:51,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:51,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 13:24:51,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:51,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 13:24:51,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2024-11-12 13:24:51,271 INFO L87 Difference]: Start difference. First operand 268 states and 330 transitions. Second operand has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 19 states have internal predecessors, (76), 4 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:24:51,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:51,816 INFO L93 Difference]: Finished difference Result 290 states and 361 transitions. [2024-11-12 13:24:51,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-12 13:24:51,817 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 19 states have internal predecessors, (76), 4 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 52 [2024-11-12 13:24:51,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:51,818 INFO L225 Difference]: With dead ends: 290 [2024-11-12 13:24:51,818 INFO L226 Difference]: Without dead ends: 290 [2024-11-12 13:24:51,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2024-11-12 13:24:51,818 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 143 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:51,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1130 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:24:51,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-12 13:24:51,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 273. [2024-11-12 13:24:51,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 225 states have (on average 1.4044444444444444) internal successors, (316), 256 states have internal predecessors, (316), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (16), 10 states have call predecessors, (16), 10 states have call successors, (16) [2024-11-12 13:24:51,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 342 transitions. [2024-11-12 13:24:51,825 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 342 transitions. Word has length 52 [2024-11-12 13:24:51,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:51,825 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 342 transitions. [2024-11-12 13:24:51,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 19 states have internal predecessors, (76), 4 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:24:51,826 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 342 transitions. [2024-11-12 13:24:51,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 13:24:51,826 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:51,826 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:24:51,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-12 13:24:52,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:52,027 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-12 13:24:52,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:52,027 INFO L85 PathProgramCache]: Analyzing trace with hash -514287632, now seen corresponding path program 1 times [2024-11-12 13:24:52,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:52,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444326809] [2024-11-12 13:24:52,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:52,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:52,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:52,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 13:24:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:52,630 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:24:52,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:52,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444326809] [2024-11-12 13:24:52,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444326809] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:52,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782994414] [2024-11-12 13:24:52,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:52,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:52,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:52,632 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-11-12 13:24:52,633 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-11-12 13:24:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:52,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-12 13:24:52,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:52,833 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-11-12 13:24:52,838 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-11-12 13:24:52,883 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-11-12 13:24:52,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:24:52,941 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-11-12 13:24:52,952 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-12 13:24:52,953 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-11-12 13:24:52,982 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-11-12 13:24:53,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:24:53,033 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-11-12 13:24:53,041 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:24:53,041 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-11-12 13:24:53,068 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 13:24:53,069 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-11-12 13:24:53,100 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 11 not checked. [2024-11-12 13:24:53,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:53,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782994414] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:53,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:24:53,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2024-11-12 13:24:53,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28169455] [2024-11-12 13:24:53,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:53,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 13:24:53,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:53,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 13:24:53,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=287, Unknown=2, NotChecked=70, Total=420 [2024-11-12 13:24:53,271 INFO L87 Difference]: Start difference. First operand 273 states and 342 transitions. Second operand has 17 states, 16 states have (on average 5.375) internal successors, (86), 14 states have internal predecessors, (86), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:24:53,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:53,942 INFO L93 Difference]: Finished difference Result 381 states and 466 transitions. [2024-11-12 13:24:53,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 13:24:53,943 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.375) internal successors, (86), 14 states have internal predecessors, (86), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 54 [2024-11-12 13:24:53,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:53,944 INFO L225 Difference]: With dead ends: 381 [2024-11-12 13:24:53,944 INFO L226 Difference]: Without dead ends: 381 [2024-11-12 13:24:53,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=661, Unknown=2, NotChecked=110, Total=930 [2024-11-12 13:24:53,945 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 291 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 427 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:53,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 588 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 544 Invalid, 0 Unknown, 427 Unchecked, 0.3s Time] [2024-11-12 13:24:53,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-12 13:24:53,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 225. [2024-11-12 13:24:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 185 states have (on average 1.2594594594594595) internal successors, (233), 208 states have internal predecessors, (233), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (16), 10 states have call predecessors, (16), 10 states have call successors, (16) [2024-11-12 13:24:53,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 259 transitions. [2024-11-12 13:24:53,951 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 259 transitions. Word has length 54 [2024-11-12 13:24:53,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:53,951 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 259 transitions. [2024-11-12 13:24:53,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.375) internal successors, (86), 14 states have internal predecessors, (86), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:24:53,951 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 259 transitions. [2024-11-12 13:24:53,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-12 13:24:53,951 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:53,951 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:24:53,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-12 13:24:54,155 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,SelfDestructingSolverStorable21 [2024-11-12 13:24:54,156 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-11-12 13:24:54,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:54,156 INFO L85 PathProgramCache]: Analyzing trace with hash 948068346, now seen corresponding path program 1 times [2024-11-12 13:24:54,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:54,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420083381] [2024-11-12 13:24:54,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:54,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:55,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:55,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 13:24:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:55,388 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:24:55,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:55,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420083381] [2024-11-12 13:24:55,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420083381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:55,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115086987] [2024-11-12 13:24:55,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:55,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:55,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:55,390 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-11-12 13:24:55,392 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-11-12 13:24:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:55,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-12 13:24:55,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:55,606 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-11-12 13:24:55,610 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-11-12 13:24:55,690 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-11-12 13:24:55,692 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-11-12 13:24:55,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:24:55,774 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-11-12 13:24:55,781 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-12 13:24:55,781 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-11-12 13:24:55,827 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-11-12 13:24:55,830 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:24:55,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:56,113 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-11-12 13:24:56,124 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-11-12 13:24:56,126 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-11-12 13:24:56,320 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:24:56,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115086987] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:24:56,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:24:56,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 6, 6] total 28 [2024-11-12 13:24:56,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054174581] [2024-11-12 13:24:56,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:56,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-12 13:24:56,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:56,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-12 13:24:56,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2024-11-12 13:24:56,323 INFO L87 Difference]: Start difference. First operand 225 states and 259 transitions. Second operand has 29 states, 28 states have (on average 4.857142857142857) internal successors, (136), 27 states have internal predecessors, (136), 6 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-12 13:24:57,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:57,404 INFO L93 Difference]: Finished difference Result 275 states and 306 transitions. [2024-11-12 13:24:57,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-12 13:24:57,405 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.857142857142857) internal successors, (136), 27 states have internal predecessors, (136), 6 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 60 [2024-11-12 13:24:57,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:57,406 INFO L225 Difference]: With dead ends: 275 [2024-11-12 13:24:57,406 INFO L226 Difference]: Without dead ends: 275 [2024-11-12 13:24:57,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=253, Invalid=1727, Unknown=0, NotChecked=0, Total=1980 [2024-11-12 13:24:57,407 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 443 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:57,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 990 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 13:24:57,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-12 13:24:57,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 198. [2024-11-12 13:24:57,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 162 states have (on average 1.2654320987654322) internal successors, (205), 186 states have internal predecessors, (205), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 13:24:57,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 219 transitions. [2024-11-12 13:24:57,411 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 219 transitions. Word has length 60 [2024-11-12 13:24:57,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:57,411 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 219 transitions. [2024-11-12 13:24:57,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.857142857142857) internal successors, (136), 27 states have internal predecessors, (136), 6 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-12 13:24:57,411 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2024-11-12 13:24:57,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-12 13:24:57,412 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:57,412 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:24:57,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-12 13:24:57,615 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-11-12 13:24:57,616 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-12 13:24:57,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:57,616 INFO L85 PathProgramCache]: Analyzing trace with hash 948068345, now seen corresponding path program 1 times [2024-11-12 13:24:57,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:57,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369147992] [2024-11-12 13:24:57,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:57,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:58,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:58,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 13:24:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:58,137 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:24:58,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:58,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369147992] [2024-11-12 13:24:58,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369147992] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:58,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416838892] [2024-11-12 13:24:58,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:58,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:58,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:58,143 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-11-12 13:24:58,144 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-11-12 13:24:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:58,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-12 13:24:58,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:58,367 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-11-12 13:24:58,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:24:58,432 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 27 treesize of output 22 [2024-11-12 13:24:58,497 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2024-11-12 13:24:58,497 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-11-12 13:24:58,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:24:58,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 12 [2024-11-12 13:24:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:24:58,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:58,743 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 96 treesize of output 90 [2024-11-12 13:24:59,269 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:24:59,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416838892] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:24:59,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:24:59,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 7] total 25 [2024-11-12 13:24:59,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631326645] [2024-11-12 13:24:59,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:59,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-12 13:24:59,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:59,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-12 13:24:59,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2024-11-12 13:24:59,270 INFO L87 Difference]: Start difference. First operand 198 states and 219 transitions. Second operand has 26 states, 25 states have (on average 4.92) internal successors, (123), 24 states have internal predecessors, (123), 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-11-12 13:25:00,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:25:00,075 INFO L93 Difference]: Finished difference Result 297 states and 329 transitions. [2024-11-12 13:25:00,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-12 13:25:00,075 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.92) internal successors, (123), 24 states have internal predecessors, (123), 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 60 [2024-11-12 13:25:00,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:25:00,076 INFO L225 Difference]: With dead ends: 297 [2024-11-12 13:25:00,076 INFO L226 Difference]: Without dead ends: 297 [2024-11-12 13:25:00,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=251, Invalid=1389, Unknown=0, NotChecked=0, Total=1640 [2024-11-12 13:25:00,077 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 372 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 13:25:00,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 869 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 13:25:00,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-12 13:25:00,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 198. [2024-11-12 13:25:00,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 162 states have (on average 1.2592592592592593) internal successors, (204), 186 states have internal predecessors, (204), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 13:25:00,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 218 transitions. [2024-11-12 13:25:00,081 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 218 transitions. Word has length 60 [2024-11-12 13:25:00,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:25:00,081 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 218 transitions. [2024-11-12 13:25:00,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.92) internal successors, (123), 24 states have internal predecessors, (123), 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-11-12 13:25:00,081 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 218 transitions. [2024-11-12 13:25:00,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 13:25:00,082 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:25:00,082 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2024-11-12 13:25:00,099 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-11-12 13:25:00,282 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-11-12 13:25:00,282 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-12 13:25:00,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:25:00,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1111373973, now seen corresponding path program 1 times [2024-11-12 13:25:00,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:25:00,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074805014] [2024-11-12 13:25:00,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:25:00,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:25:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:00,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:25:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:01,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 13:25:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:01,153 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 13:25:01,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:25:01,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074805014] [2024-11-12 13:25:01,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074805014] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:25:01,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712124486] [2024-11-12 13:25:01,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:25:01,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:25:01,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:25:01,156 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-11-12 13:25:01,159 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-11-12 13:25:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:01,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-12 13:25:01,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:25:01,419 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-11-12 13:25:01,447 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:25:01,447 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-11-12 13:25:01,475 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-11-12 13:25:01,479 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-11-12 13:25:05,668 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (and (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_15| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_15| |c_#memory_$Pointer$#1.base|))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_15| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0) (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_15| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0)))))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0)) (or (exists ((|v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| |c_#memory_$Pointer$#1.offset|))) (and (= |c_#memory_$Pointer$#1.offset| (store |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| .cse2 (select |c_#memory_$Pointer$#1.offset| .cse2))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse2) (= (select (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)))) is different from false [2024-11-12 13:25:05,672 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (and (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_15| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_15| |c_#memory_$Pointer$#1.base|))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_15| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0) (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_15| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0)))))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0)) (or (exists ((|v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| |c_#memory_$Pointer$#1.offset|))) (and (= |c_#memory_$Pointer$#1.offset| (store |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| .cse2 (select |c_#memory_$Pointer$#1.offset| .cse2))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse2) (= (select (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)))) is different from true [2024-11-12 13:25:09,794 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (and (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_17| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_17| |c_#memory_$Pointer$#1.base|))) (and (not (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse0)) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_17| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0) (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_17| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0)))))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0))) is different from false [2024-11-12 13:25:09,796 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (and (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_17| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_17| |c_#memory_$Pointer$#1.base|))) (and (not (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse0)) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_17| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0) (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_17| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0)))))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0))) is different from true [2024-11-12 13:25:09,875 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 9 treesize of output 3 [2024-11-12 13:25:09,908 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 1 not checked. [2024-11-12 13:25:09,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:25:09,992 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (and (forall ((v_ArrVal_3554 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_3554) |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_3553 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_3553) |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0)))) is different from false [2024-11-12 13:25:09,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712124486] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:25:09,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:25:09,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2024-11-12 13:25:09,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672728203] [2024-11-12 13:25:09,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:25:09,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-12 13:25:09,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:25:09,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-12 13:25:09,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=667, Unknown=5, NotChecked=162, Total=930 [2024-11-12 13:25:09,995 INFO L87 Difference]: Start difference. First operand 198 states and 218 transitions. Second operand has 28 states, 28 states have (on average 2.857142857142857) internal successors, (80), 22 states have internal predecessors, (80), 5 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:25:14,125 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (let ((.cse3 (= (select .cse0 .cse2) 0)) (.cse5 (= (select .cse7 .cse2) 0))) (and (= (select .cse0 4) 0) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_15| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_15| |c_#memory_$Pointer$#1.base|))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_15| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse2) 0) (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_15| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)))))) .cse3) (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_17| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_17| |c_#memory_$Pointer$#1.base|))) (and (not (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse4)) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_17| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse2) 0) (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_17| .cse4 (select |c_#memory_$Pointer$#1.base| .cse4)))))) .cse3) (= |c_ULTIMATE.start_main_~list2~0#1.offset| 0) .cse5 (or (exists ((|v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| |c_#memory_$Pointer$#1.offset|))) (and (= |c_#memory_$Pointer$#1.offset| (store |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| .cse6 (select |c_#memory_$Pointer$#1.offset| .cse6))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse6) (= (select (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse2) 0)))) .cse5) (= (select .cse7 4) 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))))) is different from false [2024-11-12 13:25:14,128 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (let ((.cse3 (= (select .cse0 .cse2) 0)) (.cse5 (= (select .cse7 .cse2) 0))) (and (= (select .cse0 4) 0) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_15| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_15| |c_#memory_$Pointer$#1.base|))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_15| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse2) 0) (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_15| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)))))) .cse3) (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_17| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_17| |c_#memory_$Pointer$#1.base|))) (and (not (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse4)) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_17| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse2) 0) (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_17| .cse4 (select |c_#memory_$Pointer$#1.base| .cse4)))))) .cse3) (= |c_ULTIMATE.start_main_~list2~0#1.offset| 0) .cse5 (or (exists ((|v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| |c_#memory_$Pointer$#1.offset|))) (and (= |c_#memory_$Pointer$#1.offset| (store |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| .cse6 (select |c_#memory_$Pointer$#1.offset| .cse6))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse6) (= (select (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse2) 0)))) .cse5) (= (select .cse7 4) 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))))) is different from true [2024-11-12 13:25:14,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:25:14,505 INFO L93 Difference]: Finished difference Result 219 states and 233 transitions. [2024-11-12 13:25:14,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-12 13:25:14,505 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.857142857142857) internal successors, (80), 22 states have internal predecessors, (80), 5 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 65 [2024-11-12 13:25:14,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:25:14,506 INFO L225 Difference]: With dead ends: 219 [2024-11-12 13:25:14,506 INFO L226 Difference]: Without dead ends: 219 [2024-11-12 13:25:14,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=196, Invalid=1145, Unknown=7, NotChecked=292, Total=1640 [2024-11-12 13:25:14,507 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 273 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 323 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:25:14,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 697 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 601 Invalid, 0 Unknown, 323 Unchecked, 0.3s Time] [2024-11-12 13:25:14,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-12 13:25:14,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 168. [2024-11-12 13:25:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 136 states have (on average 1.2794117647058822) internal successors, (174), 158 states have internal predecessors, (174), 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-11-12 13:25:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 186 transitions. [2024-11-12 13:25:14,510 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 186 transitions. Word has length 65 [2024-11-12 13:25:14,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:25:14,511 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 186 transitions. [2024-11-12 13:25:14,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.857142857142857) internal successors, (80), 22 states have internal predecessors, (80), 5 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:25:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 186 transitions. [2024-11-12 13:25:14,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-12 13:25:14,511 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:25:14,512 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:25:14,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-12 13:25:14,712 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-11-12 13:25:14,712 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-11-12 13:25:14,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:25:14,713 INFO L85 PathProgramCache]: Analyzing trace with hash -850577046, now seen corresponding path program 2 times [2024-11-12 13:25:14,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:25:14,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847071660] [2024-11-12 13:25:14,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:25:14,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:25:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:15,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:25:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:15,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 13:25:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:15,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 13:25:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:15,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 13:25:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:15,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 13:25:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:15,266 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 44 proven. 65 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-12 13:25:15,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:25:15,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847071660] [2024-11-12 13:25:15,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847071660] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:25:15,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546377761] [2024-11-12 13:25:15,266 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:25:15,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:25:15,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:25:15,269 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-11-12 13:25:15,270 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-11-12 13:25:15,699 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:25:15,699 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:25:15,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 13:25:15,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:25:15,764 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-12 13:25:15,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:25:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-12 13:25:15,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546377761] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:25:15,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:25:15,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 19 [2024-11-12 13:25:15,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383423916] [2024-11-12 13:25:15,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:25:15,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 13:25:15,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:25:15,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 13:25:15,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-11-12 13:25:15,843 INFO L87 Difference]: Start difference. First operand 168 states and 186 transitions. Second operand has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 18 states have internal predecessors, (81), 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-11-12 13:25:16,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:25:16,289 INFO L93 Difference]: Finished difference Result 203 states and 211 transitions. [2024-11-12 13:25:16,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-12 13:25:16,289 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 18 states have internal predecessors, (81), 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 102 [2024-11-12 13:25:16,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:25:16,290 INFO L225 Difference]: With dead ends: 203 [2024-11-12 13:25:16,290 INFO L226 Difference]: Without dead ends: 203 [2024-11-12 13:25:16,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 211 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=1010, Unknown=0, NotChecked=0, Total=1190 [2024-11-12 13:25:16,291 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 215 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:25:16,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 739 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:25:16,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-12 13:25:16,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 183. [2024-11-12 13:25:16,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 149 states have (on average 1.308724832214765) internal successors, (195), 171 states have internal predecessors, (195), 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-11-12 13:25:16,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 211 transitions. [2024-11-12 13:25:16,295 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 211 transitions. Word has length 102 [2024-11-12 13:25:16,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:25:16,295 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 211 transitions. [2024-11-12 13:25:16,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 18 states have internal predecessors, (81), 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-11-12 13:25:16,295 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 211 transitions. [2024-11-12 13:25:16,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 13:25:16,296 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:25:16,296 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-11-12 13:25:16,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-12 13:25:16,496 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-11-12 13:25:16,497 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-12 13:25:16,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:25:16,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1160568942, now seen corresponding path program 1 times [2024-11-12 13:25:16,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:25:16,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969682246] [2024-11-12 13:25:16,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:25:16,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:25:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:17,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:25:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:17,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 13:25:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:17,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 13:25:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:17,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 13:25:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:17,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 13:25:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:17,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 13:25:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:17,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 13:25:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-12 13:25:17,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:25:17,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969682246] [2024-11-12 13:25:17,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969682246] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:25:17,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394691811] [2024-11-12 13:25:17,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:25:17,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:25:17,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:25:17,623 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-11-12 13:25:17,624 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-11-12 13:25:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:17,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 145 conjuncts are in the unsatisfiable core [2024-11-12 13:25:17,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:25:18,080 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-11-12 13:25:18,110 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2024-11-12 13:25:18,110 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-11-12 13:25:18,352 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:25:18,369 INFO L349 Elim1Store]: treesize reduction 61, result has 34.4 percent of original size [2024-11-12 13:25:18,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 52 [2024-11-12 13:25:18,375 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 57 treesize of output 20 [2024-11-12 13:25:18,693 INFO L349 Elim1Store]: treesize reduction 132, result has 30.5 percent of original size [2024-11-12 13:25:18,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 70 [2024-11-12 13:25:18,701 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 67 treesize of output 24 [2024-11-12 13:25:18,997 INFO L349 Elim1Store]: treesize reduction 72, result has 39.0 percent of original size [2024-11-12 13:25:18,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2024-11-12 13:25:19,003 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 50 treesize of output 13 [2024-11-12 13:25:19,453 INFO L349 Elim1Store]: treesize reduction 120, result has 56.5 percent of original size [2024-11-12 13:25:19,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 120 treesize of output 245 [2024-11-12 13:25:19,459 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 120 treesize of output 65