./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/length_test03-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 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-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e9221de91e231efa38b63f264828813e89f68c8ac306a629b3513c0e7bf1ed0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:24:20,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:24:20,778 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:20,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:24:20,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:24:20,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:24:20,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:24:20,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:24:20,808 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:24:20,809 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:24:20,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:24:20,810 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:24:20,810 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:24:20,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:24:20,812 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:24:20,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:24:20,812 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:24:20,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:24:20,813 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:24:20,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:24:20,813 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:24:20,813 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:24:20,816 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:24:20,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:24:20,816 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:24:20,816 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:24:20,816 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:24:20,817 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:24:20,817 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:24:20,817 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:24:20,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:24:20,817 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:24:20,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:24:20,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:24:20,818 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:24:20,818 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:24:20,818 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:24:20,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:24:20,818 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:24:20,818 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:24:20,818 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:24:20,819 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:24:20,819 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e9221de91e231efa38b63f264828813e89f68c8ac306a629b3513c0e7bf1ed0 [2024-11-12 13:24:21,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:24:21,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:24:21,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:24:21,032 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:24:21,033 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:24:21,034 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/length_test03-1.i [2024-11-12 13:24:22,226 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:24:22,438 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:24:22,439 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/length_test03-1.i [2024-11-12 13:24:22,452 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4705e49cd/3e78f98b705e41d7b6486f12ada6c60d/FLAG9bedb043a [2024-11-12 13:24:22,465 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4705e49cd/3e78f98b705e41d7b6486f12ada6c60d [2024-11-12 13:24:22,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:24:22,469 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:24:22,472 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:24:22,472 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:24:22,476 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:24:22,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:24:22" (1/1) ... [2024-11-12 13:24:22,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@438691b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:24:22, skipping insertion in model container [2024-11-12 13:24:22,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:24:22" (1/1) ... [2024-11-12 13:24:22,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:24:22,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:24:22,770 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:24:22,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:24:22,829 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:24:22,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:24:22 WrapperNode [2024-11-12 13:24:22,829 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:24:22,830 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:24:22,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:24:22,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:24:22,835 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:22" (1/1) ... [2024-11-12 13:24:22,847 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:22" (1/1) ... [2024-11-12 13:24:22,862 INFO L138 Inliner]: procedures = 123, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 102 [2024-11-12 13:24:22,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:24:22,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:24:22,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:24:22,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:24:22,872 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:22" (1/1) ... [2024-11-12 13:24:22,872 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:22" (1/1) ... [2024-11-12 13:24:22,875 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:22" (1/1) ... [2024-11-12 13:24:22,889 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 10, 13]. 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, 6, 7]. [2024-11-12 13:24:22,889 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:22" (1/1) ... [2024-11-12 13:24:22,890 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:22" (1/1) ... [2024-11-12 13:24:22,896 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:22" (1/1) ... [2024-11-12 13:24:22,898 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:22" (1/1) ... [2024-11-12 13:24:22,900 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:22" (1/1) ... [2024-11-12 13:24:22,901 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:22" (1/1) ... [2024-11-12 13:24:22,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:24:22,907 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:24:22,907 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:24:22,910 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:24:22,911 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:24:22" (1/1) ... [2024-11-12 13:24:22,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:24:22,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:22,938 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:22,939 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:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 13:24:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 13:24:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 13:24:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 13:24:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 13:24:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 13:24:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 13:24:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 13:24:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 13:24:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 13:24:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 13:24:22,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:24:22,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 13:24:22,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 13:24:22,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 13:24:22,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:24:22,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:24:22,970 INFO L130 BoogieDeclarations]: Found specification of procedure append [2024-11-12 13:24:22,970 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2024-11-12 13:24:23,042 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:24:23,043 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:24:23,340 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-11-12 13:24:23,340 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:24:23,354 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:24:23,355 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-12 13:24:23,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:24:23 BoogieIcfgContainer [2024-11-12 13:24:23,355 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:24:23,358 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:24:23,358 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:24:23,361 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:24:23,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:24:22" (1/3) ... [2024-11-12 13:24:23,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307637f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:24:23, skipping insertion in model container [2024-11-12 13:24:23,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:24:22" (2/3) ... [2024-11-12 13:24:23,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307637f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:24:23, skipping insertion in model container [2024-11-12 13:24:23,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:24:23" (3/3) ... [2024-11-12 13:24:23,362 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03-1.i [2024-11-12 13:24:23,374 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:24:23,375 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2024-11-12 13:24:23,443 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:24:23,453 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;@5d4ebfe4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:24:23,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2024-11-12 13:24:23,463 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:23,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-12 13:24:23,468 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:23,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-12 13:24:23,469 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:23,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:23,483 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-12 13:24:23,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:23,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514398887] [2024-11-12 13:24:23,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:23,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:23,623 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:23,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:23,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514398887] [2024-11-12 13:24:23,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514398887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:24:23,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:24:23,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:24:23,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947331132] [2024-11-12 13:24:23,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:24:23,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:24:23,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:23,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:24:23,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:24:23,650 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:23,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:23,775 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2024-11-12 13:24:23,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:24:23,777 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:23,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:23,783 INFO L225 Difference]: With dead ends: 167 [2024-11-12 13:24:23,783 INFO L226 Difference]: Without dead ends: 165 [2024-11-12 13:24:23,785 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:23,787 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.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:23,787 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.1s Time] [2024-11-12 13:24:23,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-12 13:24:23,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 126. [2024-11-12 13:24:23,814 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:23,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2024-11-12 13:24:23,816 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 3 [2024-11-12 13:24:23,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:23,816 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2024-11-12 13:24:23,817 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:23,817 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2024-11-12 13:24:23,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-12 13:24:23,817 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:23,817 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-12 13:24:23,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 13:24:23,818 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:23,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:23,818 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-12 13:24:23,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:23,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462751925] [2024-11-12 13:24:23,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:23,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:23,882 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:23,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:23,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462751925] [2024-11-12 13:24:23,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462751925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:24:23,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:24:23,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:24:23,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196172943] [2024-11-12 13:24:23,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:24:23,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:24:23,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:23,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:24:23,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:24:23,884 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:23,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:23,955 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2024-11-12 13:24:23,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:24:23,956 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:23,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:23,957 INFO L225 Difference]: With dead ends: 126 [2024-11-12 13:24:23,957 INFO L226 Difference]: Without dead ends: 126 [2024-11-12 13:24:23,957 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:23,959 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:23,959 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:23,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-12 13:24:23,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2024-11-12 13:24:23,969 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:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2024-11-12 13:24:23,974 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 3 [2024-11-12 13:24:23,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:23,974 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2024-11-12 13:24:23,975 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:23,975 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2024-11-12 13:24:23,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 13:24:23,975 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:23,975 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 13:24:23,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 13:24:23,975 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:23,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:23,976 INFO L85 PathProgramCache]: Analyzing trace with hash 889446152, now seen corresponding path program 1 times [2024-11-12 13:24:23,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:23,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541197779] [2024-11-12 13:24:23,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:23,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:24,053 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:24,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:24,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541197779] [2024-11-12 13:24:24,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541197779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:24:24,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:24:24,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:24:24,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891046253] [2024-11-12 13:24:24,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:24:24,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:24:24,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:24,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:24:24,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:24:24,057 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:24,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:24,131 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2024-11-12 13:24:24,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:24:24,132 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:24,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:24,133 INFO L225 Difference]: With dead ends: 140 [2024-11-12 13:24:24,133 INFO L226 Difference]: Without dead ends: 140 [2024-11-12 13:24:24,133 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:24,134 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:24,134 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:24,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-12 13:24:24,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 127. [2024-11-12 13:24:24,139 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:24,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2024-11-12 13:24:24,140 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 6 [2024-11-12 13:24:24,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:24,140 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2024-11-12 13:24:24,140 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:24,140 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2024-11-12 13:24:24,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 13:24:24,141 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:24,141 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 13:24:24,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 13:24:24,141 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:24,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:24,142 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2024-11-12 13:24:24,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:24,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890130584] [2024-11-12 13:24:24,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:24,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:24,226 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:24,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:24,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890130584] [2024-11-12 13:24:24,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890130584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:24:24,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:24:24,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:24:24,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741616928] [2024-11-12 13:24:24,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:24:24,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:24:24,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:24,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:24:24,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:24:24,228 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:24,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:24,302 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2024-11-12 13:24:24,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:24:24,302 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:24,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:24,303 INFO L225 Difference]: With dead ends: 127 [2024-11-12 13:24:24,303 INFO L226 Difference]: Without dead ends: 127 [2024-11-12 13:24:24,303 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:24,304 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 4 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:24,305 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:24,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-12 13:24:24,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2024-11-12 13:24:24,309 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:24,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2024-11-12 13:24:24,310 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 6 [2024-11-12 13:24:24,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:24,310 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2024-11-12 13:24:24,310 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:24,310 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2024-11-12 13:24:24,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 13:24:24,311 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:24,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:24:24,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 13:24:24,311 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:24,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:24,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1036552302, now seen corresponding path program 1 times [2024-11-12 13:24:24,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:24,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893799864] [2024-11-12 13:24:24,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:24,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:24,371 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:24,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:24,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893799864] [2024-11-12 13:24:24,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893799864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:24:24,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:24:24,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:24:24,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278146091] [2024-11-12 13:24:24,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:24:24,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:24:24,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:24,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:24:24,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:24:24,373 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:24,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:24,433 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2024-11-12 13:24:24,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:24:24,434 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:24,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:24,436 INFO L225 Difference]: With dead ends: 120 [2024-11-12 13:24:24,436 INFO L226 Difference]: Without dead ends: 120 [2024-11-12 13:24:24,436 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:24,437 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:24,437 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:24,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-12 13:24:24,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-12 13:24:24,447 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:24,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2024-11-12 13:24:24,451 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 12 [2024-11-12 13:24:24,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:24,451 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2024-11-12 13:24:24,451 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:24,452 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2024-11-12 13:24:24,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 13:24:24,452 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:24,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:24:24,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 13:24:24,452 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:24,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:24,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1036552303, now seen corresponding path program 1 times [2024-11-12 13:24:24,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:24,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512249980] [2024-11-12 13:24:24,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:24,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:24,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:24,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512249980] [2024-11-12 13:24:24,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512249980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:24:24,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:24:24,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:24:24,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336834806] [2024-11-12 13:24:24,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:24:24,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:24:24,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:24,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:24:24,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:24:24,569 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:24,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:24,619 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2024-11-12 13:24:24,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:24:24,622 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:24,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:24,622 INFO L225 Difference]: With dead ends: 115 [2024-11-12 13:24:24,622 INFO L226 Difference]: Without dead ends: 115 [2024-11-12 13:24:24,623 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:24,623 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:24,623 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:24,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-12 13:24:24,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-12 13:24:24,630 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:24,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2024-11-12 13:24:24,631 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 12 [2024-11-12 13:24:24,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:24,631 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2024-11-12 13:24:24,631 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:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2024-11-12 13:24:24,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 13:24:24,631 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:24,631 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:24:24,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 13:24:24,632 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:24,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:24,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2068350391, now seen corresponding path program 1 times [2024-11-12 13:24:24,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:24,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913890790] [2024-11-12 13:24:24,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:24,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:24,804 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:24,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:24,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913890790] [2024-11-12 13:24:24,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913890790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:24:24,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:24:24,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:24:24,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444659606] [2024-11-12 13:24:24,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:24:24,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:24:24,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:24,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:24:24,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:24:24,806 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:24,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:24,986 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2024-11-12 13:24:24,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:24:24,986 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:24,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:24,987 INFO L225 Difference]: With dead ends: 221 [2024-11-12 13:24:24,987 INFO L226 Difference]: Without dead ends: 221 [2024-11-12 13:24:24,988 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:24,990 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:24,990 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:24,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-12 13:24:24,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 149. [2024-11-12 13:24:24,996 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:24,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 182 transitions. [2024-11-12 13:24:24,998 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 182 transitions. Word has length 13 [2024-11-12 13:24:24,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:24,998 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 182 transitions. [2024-11-12 13:24:24,998 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:24,998 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 182 transitions. [2024-11-12 13:24:24,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 13:24:24,999 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:24,999 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:24:24,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 13:24:24,999 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:24,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:25,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2068350392, now seen corresponding path program 1 times [2024-11-12 13:24:25,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:25,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808531297] [2024-11-12 13:24:25,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:25,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:25,199 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,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:25,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808531297] [2024-11-12 13:24:25,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808531297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:24:25,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:24:25,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:24:25,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421931136] [2024-11-12 13:24:25,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:24:25,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:24:25,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:25,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:24:25,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:24:25,202 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:25,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:25,354 INFO L93 Difference]: Finished difference Result 171 states and 207 transitions. [2024-11-12 13:24:25,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:24:25,354 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:25,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:25,355 INFO L225 Difference]: With dead ends: 171 [2024-11-12 13:24:25,355 INFO L226 Difference]: Without dead ends: 171 [2024-11-12 13:24:25,355 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:25,356 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:25,357 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:25,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-12 13:24:25,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2024-11-12 13:24:25,362 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:25,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 207 transitions. [2024-11-12 13:24:25,363 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 207 transitions. Word has length 13 [2024-11-12 13:24:25,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:25,363 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 207 transitions. [2024-11-12 13:24:25,363 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:25,363 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 207 transitions. [2024-11-12 13:24:25,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:24:25,363 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:25,364 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:25,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 13:24:25,364 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:25,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:25,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1480883050, now seen corresponding path program 1 times [2024-11-12 13:24:25,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:25,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130750434] [2024-11-12 13:24:25,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:25,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:25,734 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,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:25,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130750434] [2024-11-12 13:24:25,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130750434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:24:25,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:24:25,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:24:25,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774564680] [2024-11-12 13:24:25,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:24:25,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:24:25,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:25,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:24:25,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:24:25,738 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:25,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:25,906 INFO L93 Difference]: Finished difference Result 171 states and 206 transitions. [2024-11-12 13:24:25,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:24:25,906 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:25,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:25,907 INFO L225 Difference]: With dead ends: 171 [2024-11-12 13:24:25,907 INFO L226 Difference]: Without dead ends: 171 [2024-11-12 13:24:25,907 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:25,908 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.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:25,908 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.1s Time] [2024-11-12 13:24:25,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-12 13:24:25,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2024-11-12 13:24:25,911 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:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 206 transitions. [2024-11-12 13:24:25,911 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 206 transitions. Word has length 22 [2024-11-12 13:24:25,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:25,912 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 206 transitions. [2024-11-12 13:24:25,912 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:25,912 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 206 transitions. [2024-11-12 13:24:25,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 13:24:25,912 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:25,912 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:25,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 13:24:25,913 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:25,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:25,913 INFO L85 PathProgramCache]: Analyzing trace with hash -439263795, now seen corresponding path program 1 times [2024-11-12 13:24:25,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:25,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420764311] [2024-11-12 13:24:25,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:25,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:26,232 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,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:26,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420764311] [2024-11-12 13:24:26,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420764311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:24:26,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:24:26,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 13:24:26,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908698312] [2024-11-12 13:24:26,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:24:26,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 13:24:26,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:26,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 13:24:26,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:24:26,235 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:26,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:26,462 INFO L93 Difference]: Finished difference Result 196 states and 231 transitions. [2024-11-12 13:24:26,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:24:26,462 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:26,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:26,463 INFO L225 Difference]: With dead ends: 196 [2024-11-12 13:24:26,463 INFO L226 Difference]: Without dead ends: 196 [2024-11-12 13:24:26,464 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:26,464 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:26,466 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:26,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-12 13:24:26,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 160. [2024-11-12 13:24:26,469 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:26,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 193 transitions. [2024-11-12 13:24:26,470 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 193 transitions. Word has length 24 [2024-11-12 13:24:26,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:26,470 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 193 transitions. [2024-11-12 13:24:26,470 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:26,470 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 193 transitions. [2024-11-12 13:24:26,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-12 13:24:26,472 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:26,472 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:26,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 13:24:26,472 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:26,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:26,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1442887251, now seen corresponding path program 1 times [2024-11-12 13:24:26,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:26,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222257668] [2024-11-12 13:24:26,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:26,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:26,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:26,566 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,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:26,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222257668] [2024-11-12 13:24:26,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222257668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:24:26,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:24:26,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:24:26,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668933204] [2024-11-12 13:24:26,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:24:26,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:24:26,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:26,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:24:26,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:24:26,570 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:26,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:26,648 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2024-11-12 13:24:26,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:24:26,648 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:26,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:26,649 INFO L225 Difference]: With dead ends: 153 [2024-11-12 13:24:26,649 INFO L226 Difference]: Without dead ends: 153 [2024-11-12 13:24:26,650 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:26,650 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:26,650 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:26,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-12 13:24:26,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 139. [2024-11-12 13:24:26,654 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:26,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 156 transitions. [2024-11-12 13:24:26,655 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 156 transitions. Word has length 30 [2024-11-12 13:24:26,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:26,656 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 156 transitions. [2024-11-12 13:24:26,656 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:26,656 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 156 transitions. [2024-11-12 13:24:26,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-12 13:24:26,657 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:26,657 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:26,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 13:24:26,657 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:26,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:26,658 INFO L85 PathProgramCache]: Analyzing trace with hash -610198618, now seen corresponding path program 1 times [2024-11-12 13:24:26,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:26,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935312744] [2024-11-12 13:24:26,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:26,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:26,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:26,987 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:26,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:26,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935312744] [2024-11-12 13:24:26,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935312744] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:26,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708569074] [2024-11-12 13:24:26,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:26,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:26,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:26,991 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:26,993 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:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:27,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 13:24:27,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:27,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:24:27,353 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 16 treesize of output 11 [2024-11-12 13:24:27,366 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:24:27,367 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:27,390 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:27,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:27,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2024-11-12 13:24:27,658 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-11-12 13:24:27,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2024-11-12 13:24:27,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:24:27,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2024-11-12 13:24:27,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:24:27,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 76 [2024-11-12 13:24:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:28,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708569074] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:24:28,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:24:28,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2024-11-12 13:24:28,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004618815] [2024-11-12 13:24:28,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:28,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-12 13:24:28,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:28,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-12 13:24:28,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2024-11-12 13:24:28,019 INFO L87 Difference]: Start difference. First operand 139 states and 156 transitions. Second operand has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 20 states have internal predecessors, (77), 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:28,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:28,605 INFO L93 Difference]: Finished difference Result 173 states and 184 transitions. [2024-11-12 13:24:28,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 13:24:28,606 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 20 states have internal predecessors, (77), 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 32 [2024-11-12 13:24:28,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:28,607 INFO L225 Difference]: With dead ends: 173 [2024-11-12 13:24:28,607 INFO L226 Difference]: Without dead ends: 173 [2024-11-12 13:24:28,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2024-11-12 13:24:28,607 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 374 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:28,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 596 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:24:28,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-12 13:24:28,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 138. [2024-11-12 13:24:28,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 132 states have internal predecessors, (143), 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,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2024-11-12 13:24:28,611 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 32 [2024-11-12 13:24:28,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:28,611 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2024-11-12 13:24:28,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 20 states have internal predecessors, (77), 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:28,611 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2024-11-12 13:24:28,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 13:24:28,612 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:28,612 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:28,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 13:24:28,812 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:28,813 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:28,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:28,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1027331565, now seen corresponding path program 1 times [2024-11-12 13:24:28,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:28,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553249499] [2024-11-12 13:24:28,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:28,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:28,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:29,060 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:29,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:29,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553249499] [2024-11-12 13:24:29,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553249499] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:29,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787541937] [2024-11-12 13:24:29,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:29,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:29,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:29,064 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:29,065 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:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:29,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-12 13:24:29,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:29,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:24:29,189 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:29,237 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-12 13:24:29,238 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:29,253 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-12 13:24:29,254 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:29,262 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:29,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:29,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787541937] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:29,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:24:29,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2024-11-12 13:24:29,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617713383] [2024-11-12 13:24:29,307 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:29,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 13:24:29,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:29,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 13:24:29,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2024-11-12 13:24:29,308 INFO L87 Difference]: Start difference. First operand 138 states and 149 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:29,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:29,606 INFO L93 Difference]: Finished difference Result 168 states and 180 transitions. [2024-11-12 13:24:29,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 13:24:29,606 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:29,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:29,607 INFO L225 Difference]: With dead ends: 168 [2024-11-12 13:24:29,607 INFO L226 Difference]: Without dead ends: 168 [2024-11-12 13:24:29,607 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:29,608 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 118 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:29,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 325 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 307 Invalid, 0 Unknown, 142 Unchecked, 0.2s Time] [2024-11-12 13:24:29,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-12 13:24:29,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 141. [2024-11-12 13:24:29,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 105 states have (on average 1.4) internal successors, (147), 135 states have internal predecessors, (147), 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:29,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 154 transitions. [2024-11-12 13:24:29,612 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 154 transitions. Word has length 33 [2024-11-12 13:24:29,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:29,613 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 154 transitions. [2024-11-12 13:24:29,613 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:29,613 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2024-11-12 13:24:29,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 13:24:29,614 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:29,614 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:29,629 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:29,815 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:29,816 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:29,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:29,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1027331566, now seen corresponding path program 1 times [2024-11-12 13:24:29,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:29,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48809660] [2024-11-12 13:24:29,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:29,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:30,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:30,105 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,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:30,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48809660] [2024-11-12 13:24:30,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48809660] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:30,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934195643] [2024-11-12 13:24:30,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:30,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:30,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:30,107 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:30,109 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:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:30,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-12 13:24:30,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:30,227 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:30,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 13:24:30,279 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (store |c_old(#length)| append_~node~0.base (select |c_#length| append_~node~0.base)) |c_#length|) (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base 1)))) is different from true [2024-11-12 13:24:30,354 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-12 13:24:30,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-12 13:24:30,357 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:30,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:24:30,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:24:30,472 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-12 13:24:30,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-12 13:24:30,487 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:30,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:30,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934195643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:30,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:24:30,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2024-11-12 13:24:30,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788237272] [2024-11-12 13:24:30,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:30,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 13:24:30,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:30,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 13:24:30,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=256, Unknown=1, NotChecked=32, Total=342 [2024-11-12 13:24:30,698 INFO L87 Difference]: Start difference. First operand 141 states and 154 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:31,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:31,568 INFO L93 Difference]: Finished difference Result 305 states and 340 transitions. [2024-11-12 13:24:31,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 13:24:31,568 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:31,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:31,569 INFO L225 Difference]: With dead ends: 305 [2024-11-12 13:24:31,569 INFO L226 Difference]: Without dead ends: 305 [2024-11-12 13:24:31,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=765, Unknown=1, NotChecked=58, Total=992 [2024-11-12 13:24:31,570 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 321 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 250 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:31,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 665 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 768 Invalid, 0 Unknown, 250 Unchecked, 0.5s Time] [2024-11-12 13:24:31,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-12 13:24:31,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 217. [2024-11-12 13:24:31,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 177 states have (on average 1.4011299435028248) internal successors, (248), 206 states have internal predecessors, (248), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-12 13:24:31,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 262 transitions. [2024-11-12 13:24:31,575 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 262 transitions. Word has length 33 [2024-11-12 13:24:31,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:31,575 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 262 transitions. [2024-11-12 13:24:31,575 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:31,576 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 262 transitions. [2024-11-12 13:24:31,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-12 13:24:31,576 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:31,576 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:31,593 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:31,780 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:31,781 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:31,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:31,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1240813252, now seen corresponding path program 1 times [2024-11-12 13:24:31,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:31,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282567832] [2024-11-12 13:24:31,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:31,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:32,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:32,674 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:32,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:32,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282567832] [2024-11-12 13:24:32,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282567832] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:32,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177594914] [2024-11-12 13:24:32,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:32,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:32,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:32,676 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:32,677 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:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:32,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-12 13:24:32,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:32,825 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,830 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,921 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:32,924 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:33,006 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-12 13:24:33,006 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:33,009 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:33,054 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:33,071 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:33,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:33,385 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:33,388 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:33,421 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:33,635 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:33,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177594914] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:24:33,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:24:33,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6, 6] total 25 [2024-11-12 13:24:33,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257154499] [2024-11-12 13:24:33,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:33,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-12 13:24:33,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:33,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-12 13:24:33,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2024-11-12 13:24:33,636 INFO L87 Difference]: Start difference. First operand 217 states and 262 transitions. Second operand has 26 states, 25 states have (on average 4.16) internal successors, (104), 24 states have internal predecessors, (104), 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:34,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:34,259 INFO L93 Difference]: Finished difference Result 267 states and 322 transitions. [2024-11-12 13:24:34,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 13:24:34,259 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.16) internal successors, (104), 24 states have internal predecessors, (104), 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:34,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:34,261 INFO L225 Difference]: With dead ends: 267 [2024-11-12 13:24:34,261 INFO L226 Difference]: Without dead ends: 267 [2024-11-12 13:24:34,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=1031, Unknown=0, NotChecked=0, Total=1190 [2024-11-12 13:24:34,263 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 285 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:34,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 757 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:24:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-12 13:24:34,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 223. [2024-11-12 13:24:34,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 182 states have (on average 1.3846153846153846) internal successors, (252), 212 states have internal predecessors, (252), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-12 13:24:34,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 266 transitions. [2024-11-12 13:24:34,269 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 266 transitions. Word has length 41 [2024-11-12 13:24:34,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:34,269 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 266 transitions. [2024-11-12 13:24:34,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.16) internal successors, (104), 24 states have internal predecessors, (104), 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:34,269 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 266 transitions. [2024-11-12 13:24:34,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-12 13:24:34,270 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:34,270 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:34,284 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:34,470 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:34,471 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:34,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:34,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1240813253, now seen corresponding path program 1 times [2024-11-12 13:24:34,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:34,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971449927] [2024-11-12 13:24:34,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:34,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:34,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:34,882 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:34,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:34,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971449927] [2024-11-12 13:24:34,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971449927] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:34,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315014621] [2024-11-12 13:24:34,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:34,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:34,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:34,885 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:34,886 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:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:35,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-12 13:24:35,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:35,014 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:35,059 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:35,122 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2024-11-12 13:24:35,122 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:35,148 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:35,149 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:35,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:35,283 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:35,590 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:35,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315014621] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:24:35,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:24:35,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 19 [2024-11-12 13:24:35,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489195592] [2024-11-12 13:24:35,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:35,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-12 13:24:35,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:35,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-12 13:24:35,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-11-12 13:24:35,592 INFO L87 Difference]: Start difference. First operand 223 states and 266 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:36,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:36,051 INFO L93 Difference]: Finished difference Result 225 states and 269 transitions. [2024-11-12 13:24:36,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 13:24:36,052 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:36,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:36,053 INFO L225 Difference]: With dead ends: 225 [2024-11-12 13:24:36,053 INFO L226 Difference]: Without dead ends: 225 [2024-11-12 13:24:36,053 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:36,054 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 100 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:36,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 906 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:24:36,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-12 13:24:36,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2024-11-12 13:24:36,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 182 states have (on average 1.379120879120879) internal successors, (251), 212 states have internal predecessors, (251), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-12 13:24:36,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 265 transitions. [2024-11-12 13:24:36,058 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 265 transitions. Word has length 41 [2024-11-12 13:24:36,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:36,058 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 265 transitions. [2024-11-12 13:24:36,058 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:36,059 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 265 transitions. [2024-11-12 13:24:36,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-12 13:24:36,059 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:36,059 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:36,073 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:36,263 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:36,265 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:36,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:36,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1836513292, now seen corresponding path program 1 times [2024-11-12 13:24:36,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:36,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264679929] [2024-11-12 13:24:36,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:36,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:36,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:36,769 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:36,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:36,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264679929] [2024-11-12 13:24:36,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264679929] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:36,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926680413] [2024-11-12 13:24:36,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:36,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:36,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:36,772 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:36,773 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:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:36,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-12 13:24:36,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:36,913 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,921 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:24:36,921 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:36,925 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:36,928 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:36,935 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:36,938 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:37,166 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:37,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:37,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926680413] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:37,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:24:37,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 19 [2024-11-12 13:24:37,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468560184] [2024-11-12 13:24:37,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:37,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 13:24:37,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:37,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 13:24:37,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=316, Unknown=8, NotChecked=0, Total=380 [2024-11-12 13:24:37,253 INFO L87 Difference]: Start difference. First operand 223 states and 265 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:37,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:37,704 INFO L93 Difference]: Finished difference Result 304 states and 362 transitions. [2024-11-12 13:24:37,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 13:24:37,705 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:37,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:37,706 INFO L225 Difference]: With dead ends: 304 [2024-11-12 13:24:37,706 INFO L226 Difference]: Without dead ends: 304 [2024-11-12 13:24:37,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=618, Unknown=8, NotChecked=0, Total=756 [2024-11-12 13:24:37,706 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 223 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:37,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 805 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:24:37,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-12 13:24:37,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 235. [2024-11-12 13:24:37,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 192 states have (on average 1.359375) internal successors, (261), 222 states have internal predecessors, (261), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (10), 5 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-12 13:24:37,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 279 transitions. [2024-11-12 13:24:37,711 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 279 transitions. Word has length 42 [2024-11-12 13:24:37,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:37,711 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 279 transitions. [2024-11-12 13:24:37,712 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:37,712 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 279 transitions. [2024-11-12 13:24:37,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-12 13:24:37,712 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:37,712 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:37,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-12 13:24:37,913 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:37,913 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:37,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:37,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1591414825, now seen corresponding path program 1 times [2024-11-12 13:24:37,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:37,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615923569] [2024-11-12 13:24:37,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:37,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:38,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:38,689 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:38,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:38,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615923569] [2024-11-12 13:24:38,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615923569] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:38,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715092009] [2024-11-12 13:24:38,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:38,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:38,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:38,692 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:38,693 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:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:38,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-12 13:24:38,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:38,841 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,859 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:24:38,859 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,874 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:38,878 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:39,102 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:39,135 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:39,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:39,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715092009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:39,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:24:39,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 24 [2024-11-12 13:24:39,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714503752] [2024-11-12 13:24:39,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:39,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-12 13:24:39,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:39,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-12 13:24:39,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=608, Unknown=15, NotChecked=0, Total=702 [2024-11-12 13:24:39,993 INFO L87 Difference]: Start difference. First operand 235 states and 279 transitions. Second operand has 24 states, 24 states have (on average 2.625) 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:40,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:40,564 INFO L93 Difference]: Finished difference Result 287 states and 341 transitions. [2024-11-12 13:24:40,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 13:24:40,565 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.625) 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:40,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:40,567 INFO L225 Difference]: With dead ends: 287 [2024-11-12 13:24:40,567 INFO L226 Difference]: Without dead ends: 287 [2024-11-12 13:24:40,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=173, Invalid=1072, Unknown=15, NotChecked=0, Total=1260 [2024-11-12 13:24:40,567 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 175 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:40,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 959 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:24:40,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-12 13:24:40,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 227. [2024-11-12 13:24:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 185 states have (on average 1.3297297297297297) internal successors, (246), 214 states have internal predecessors, (246), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (10), 5 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-12 13:24:40,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 264 transitions. [2024-11-12 13:24:40,573 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 264 transitions. Word has length 44 [2024-11-12 13:24:40,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:40,573 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 264 transitions. [2024-11-12 13:24:40,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.625) 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:40,574 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 264 transitions. [2024-11-12 13:24:40,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 13:24:40,574 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:40,574 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:40,587 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:40,778 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:40,779 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:40,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:40,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1452710056, now seen corresponding path program 1 times [2024-11-12 13:24:40,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:40,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238354952] [2024-11-12 13:24:40,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:40,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:40,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:40,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 13:24:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:40,862 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:40,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:40,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238354952] [2024-11-12 13:24:40,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238354952] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:40,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930060539] [2024-11-12 13:24:40,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:40,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:40,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:40,864 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:40,866 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:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:41,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 13:24:41,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:41,032 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:41,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:41,053 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:41,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930060539] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:24:41,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:24:41,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-11-12 13:24:41,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492637237] [2024-11-12 13:24:41,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:41,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:24:41,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:41,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:24:41,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:24:41,056 INFO L87 Difference]: Start difference. First operand 227 states and 264 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:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:41,153 INFO L93 Difference]: Finished difference Result 285 states and 326 transitions. [2024-11-12 13:24:41,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:24:41,154 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:41,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:41,155 INFO L225 Difference]: With dead ends: 285 [2024-11-12 13:24:41,156 INFO L226 Difference]: Without dead ends: 285 [2024-11-12 13:24:41,156 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:41,157 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 70 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:41,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 351 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:24:41,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-12 13:24:41,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 270. [2024-11-12 13:24:41,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 224 states have (on average 1.3392857142857142) internal successors, (300), 251 states have internal predecessors, (300), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-12 13:24:41,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 326 transitions. [2024-11-12 13:24:41,162 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 326 transitions. Word has length 48 [2024-11-12 13:24:41,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:41,164 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 326 transitions. [2024-11-12 13:24:41,164 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:41,164 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 326 transitions. [2024-11-12 13:24:41,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-12 13:24:41,165 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:41,165 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:41,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-12 13:24:41,365 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:41,366 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-12 13:24:41,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:41,366 INFO L85 PathProgramCache]: Analyzing trace with hash 948068346, now seen corresponding path program 1 times [2024-11-12 13:24:41,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:41,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833968140] [2024-11-12 13:24:41,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:41,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:41,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:41,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 13:24:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:42,087 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:42,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:42,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833968140] [2024-11-12 13:24:42,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833968140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:42,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912165211] [2024-11-12 13:24:42,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:42,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:42,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:42,089 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:42,090 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:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:42,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-12 13:24:42,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:42,253 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:42,257 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:42,334 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:42,337 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:42,423 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-12 13:24:42,424 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:42,427 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:42,475 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:42,490 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:42,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:42,768 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:42,778 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:42,780 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:42,966 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:42,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912165211] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:24:42,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:24:42,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6, 6] total 24 [2024-11-12 13:24:42,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937026156] [2024-11-12 13:24:42,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:42,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-12 13:24:42,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:42,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-12 13:24:42,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2024-11-12 13:24:42,967 INFO L87 Difference]: Start difference. First operand 270 states and 326 transitions. Second operand has 25 states, 24 states have (on average 5.208333333333333) internal successors, (125), 23 states have internal predecessors, (125), 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:24:43,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:43,543 INFO L93 Difference]: Finished difference Result 319 states and 370 transitions. [2024-11-12 13:24:43,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 13:24:43,543 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.208333333333333) internal successors, (125), 23 states have internal predecessors, (125), 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:24:43,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:43,544 INFO L225 Difference]: With dead ends: 319 [2024-11-12 13:24:43,544 INFO L226 Difference]: Without dead ends: 319 [2024-11-12 13:24:43,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=1088, Unknown=0, NotChecked=0, Total=1260 [2024-11-12 13:24:43,545 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 369 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:43,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 619 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:24:43,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-12 13:24:43,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 281. [2024-11-12 13:24:43,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 234 states have (on average 1.3162393162393162) internal successors, (308), 262 states have internal predecessors, (308), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-12 13:24:43,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 334 transitions. [2024-11-12 13:24:43,551 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 334 transitions. Word has length 60 [2024-11-12 13:24:43,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:43,551 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 334 transitions. [2024-11-12 13:24:43,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.208333333333333) internal successors, (125), 23 states have internal predecessors, (125), 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:24:43,551 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 334 transitions. [2024-11-12 13:24:43,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-12 13:24:43,553 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:43,553 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:43,566 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:43,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:43,754 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-12 13:24:43,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:43,755 INFO L85 PathProgramCache]: Analyzing trace with hash 948068345, now seen corresponding path program 1 times [2024-11-12 13:24:43,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:43,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830381313] [2024-11-12 13:24:43,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:43,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:44,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:44,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 13:24:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:44,278 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:44,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:44,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830381313] [2024-11-12 13:24:44,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830381313] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:44,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927307662] [2024-11-12 13:24:44,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:44,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:44,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:44,281 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:44,282 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:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:44,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-12 13:24:44,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:44,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:24:44,507 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:44,546 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2024-11-12 13:24:44,547 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:44,568 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:44,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:44,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:44,674 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:44,965 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:44,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927307662] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:24:44,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:24:44,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6, 6] total 21 [2024-11-12 13:24:44,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654356867] [2024-11-12 13:24:44,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:44,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 13:24:44,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:44,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 13:24:44,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2024-11-12 13:24:44,967 INFO L87 Difference]: Start difference. First operand 281 states and 334 transitions. Second operand has 22 states, 21 states have (on average 5.380952380952381) internal successors, (113), 20 states have internal predecessors, (113), 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:24:45,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:45,424 INFO L93 Difference]: Finished difference Result 313 states and 368 transitions. [2024-11-12 13:24:45,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 13:24:45,424 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.380952380952381) internal successors, (113), 20 states have internal predecessors, (113), 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:24:45,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:45,425 INFO L225 Difference]: With dead ends: 313 [2024-11-12 13:24:45,425 INFO L226 Difference]: Without dead ends: 313 [2024-11-12 13:24:45,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2024-11-12 13:24:45,426 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 252 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:45,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 719 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:24:45,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-12 13:24:45,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 280. [2024-11-12 13:24:45,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 234 states have (on average 1.3076923076923077) internal successors, (306), 261 states have internal predecessors, (306), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-12 13:24:45,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 332 transitions. [2024-11-12 13:24:45,431 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 332 transitions. Word has length 60 [2024-11-12 13:24:45,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:45,431 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 332 transitions. [2024-11-12 13:24:45,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.380952380952381) internal successors, (113), 20 states have internal predecessors, (113), 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:24:45,432 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 332 transitions. [2024-11-12 13:24:45,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-12 13:24:45,432 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:45,432 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:24:45,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-12 13:24:45,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-12 13:24:45,633 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:45,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:45,633 INFO L85 PathProgramCache]: Analyzing trace with hash 104187406, now seen corresponding path program 1 times [2024-11-12 13:24:45,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:45,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519015990] [2024-11-12 13:24:45,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:45,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:45,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:45,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 13:24:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:45,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 13:24:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:45,724 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-12 13:24:45,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:45,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519015990] [2024-11-12 13:24:45,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519015990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:45,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139922777] [2024-11-12 13:24:45,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:45,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:45,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:45,726 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:45,727 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:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:45,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 13:24:45,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:45,925 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-12 13:24:45,925 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:24:45,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139922777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:24:45,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:24:45,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-11-12 13:24:45,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066123958] [2024-11-12 13:24:45,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:24:45,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:24:45,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:45,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:24:45,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:24:45,926 INFO L87 Difference]: Start difference. First operand 280 states and 332 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:24:45,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:45,931 INFO L93 Difference]: Finished difference Result 274 states and 324 transitions. [2024-11-12 13:24:45,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:24:45,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2024-11-12 13:24:45,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:45,932 INFO L225 Difference]: With dead ends: 274 [2024-11-12 13:24:45,932 INFO L226 Difference]: Without dead ends: 274 [2024-11-12 13:24:45,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 74 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:45,933 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:45,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 195 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:24:45,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-12 13:24:45,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2024-11-12 13:24:45,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 229 states have (on average 1.3013100436681222) internal successors, (298), 255 states have internal predecessors, (298), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-12 13:24:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 324 transitions. [2024-11-12 13:24:45,940 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 324 transitions. Word has length 67 [2024-11-12 13:24:45,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:45,940 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 324 transitions. [2024-11-12 13:24:45,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:24:45,940 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 324 transitions. [2024-11-12 13:24:45,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-12 13:24:45,940 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:45,940 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1] [2024-11-12 13:24:45,956 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:46,141 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,SelfDestructingSolverStorable21 [2024-11-12 13:24:46,141 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-12 13:24:46,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:46,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1345239894, now seen corresponding path program 1 times [2024-11-12 13:24:46,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:46,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901303372] [2024-11-12 13:24:46,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:46,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:46,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:46,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 13:24:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:46,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 13:24:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 13:24:46,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:46,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901303372] [2024-11-12 13:24:46,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901303372] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:46,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540855508] [2024-11-12 13:24:46,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:46,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:46,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:46,464 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:46,465 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:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:46,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 13:24:46,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:46,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:24:46,784 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 16 treesize of output 11 [2024-11-12 13:24:46,791 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:24:46,791 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:46,804 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 13:24:46,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:46,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2024-11-12 13:24:46,947 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-11-12 13:24:46,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2024-11-12 13:24:47,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:24:47,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2024-11-12 13:24:47,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:24:47,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 76 [2024-11-12 13:24:47,213 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 13:24:47,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540855508] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:24:47,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:24:47,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2024-11-12 13:24:47,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583800184] [2024-11-12 13:24:47,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:47,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-12 13:24:47,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:47,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-12 13:24:47,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2024-11-12 13:24:47,215 INFO L87 Difference]: Start difference. First operand 274 states and 324 transitions. Second operand has 24 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 20 states have internal predecessors, (107), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-12 13:24:47,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:47,614 INFO L93 Difference]: Finished difference Result 294 states and 341 transitions. [2024-11-12 13:24:47,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 13:24:47,617 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 20 states have internal predecessors, (107), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-11-12 13:24:47,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:47,618 INFO L225 Difference]: With dead ends: 294 [2024-11-12 13:24:47,618 INFO L226 Difference]: Without dead ends: 294 [2024-11-12 13:24:47,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2024-11-12 13:24:47,619 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 380 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:47,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 669 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:24:47,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-12 13:24:47,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 271. [2024-11-12 13:24:47,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 227 states have (on average 1.2863436123348018) internal successors, (292), 252 states have internal predecessors, (292), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-12 13:24:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 318 transitions. [2024-11-12 13:24:47,624 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 318 transitions. Word has length 72 [2024-11-12 13:24:47,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:47,625 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 318 transitions. [2024-11-12 13:24:47,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 20 states have internal predecessors, (107), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-12 13:24:47,625 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 318 transitions. [2024-11-12 13:24:47,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-12 13:24:47,627 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:47,627 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:24:47,641 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:24:47,827 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,SelfDestructingSolverStorable22 [2024-11-12 13:24:47,828 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-12 13:24:47,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:47,828 INFO L85 PathProgramCache]: Analyzing trace with hash -2134387814, now seen corresponding path program 1 times [2024-11-12 13:24:47,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:47,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80630399] [2024-11-12 13:24:47,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:47,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:48,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:48,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 13:24:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:48,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 13:24:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 21 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-12 13:24:48,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:48,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80630399] [2024-11-12 13:24:48,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80630399] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:48,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937445239] [2024-11-12 13:24:48,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:48,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:48,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:48,382 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:24:48,384 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:24:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:48,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 13:24:48,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:48,664 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:48,783 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:24:48,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:48,890 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:48,933 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:24:48,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937445239] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:24:48,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:24:48,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 23 [2024-11-12 13:24:48,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991785610] [2024-11-12 13:24:48,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:48,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-12 13:24:48,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:48,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-12 13:24:48,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2024-11-12 13:24:48,935 INFO L87 Difference]: Start difference. First operand 271 states and 318 transitions. Second operand has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 20 states have internal predecessors, (109), 4 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 13:24:49,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:49,442 INFO L93 Difference]: Finished difference Result 286 states and 338 transitions. [2024-11-12 13:24:49,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-12 13:24:49,443 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 20 states have internal predecessors, (109), 4 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 73 [2024-11-12 13:24:49,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:49,444 INFO L225 Difference]: With dead ends: 286 [2024-11-12 13:24:49,444 INFO L226 Difference]: Without dead ends: 286 [2024-11-12 13:24:49,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=297, Invalid=1425, Unknown=0, NotChecked=0, Total=1722 [2024-11-12 13:24:49,444 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 73 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:49,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1140 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:24:49,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-12 13:24:49,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 262. [2024-11-12 13:24:49,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 219 states have (on average 1.2876712328767124) internal successors, (282), 243 states have internal predecessors, (282), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 13:24:49,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 306 transitions. [2024-11-12 13:24:49,449 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 306 transitions. Word has length 73 [2024-11-12 13:24:49,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:49,449 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 306 transitions. [2024-11-12 13:24:49,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 20 states have internal predecessors, (109), 4 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 13:24:49,449 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 306 transitions. [2024-11-12 13:24:49,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-12 13:24:49,449 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:49,449 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2024-11-12 13:24:49,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-12 13:24:49,650 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,SelfDestructingSolverStorable23 [2024-11-12 13:24:49,650 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-12 13:24:49,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:49,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1959490770, now seen corresponding path program 2 times [2024-11-12 13:24:49,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:49,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873525769] [2024-11-12 13:24:49,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:49,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:50,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:50,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 13:24:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:50,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 13:24:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:50,257 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-12 13:24:50,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:50,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873525769] [2024-11-12 13:24:50,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873525769] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:50,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854223405] [2024-11-12 13:24:50,258 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:24:50,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:50,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:50,259 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:24:50,261 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:24:50,506 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:24:50,506 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:24:50,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-12 13:24:50,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:50,532 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:50,537 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:50,679 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:50,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:24:50,743 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 26 treesize of output 9 [2024-11-12 13:24:50,756 INFO L349 Elim1Store]: treesize reduction 38, result has 29.6 percent of original size [2024-11-12 13:24:50,757 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 37 treesize of output 22 [2024-11-12 13:24:50,974 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:24:50,976 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 30 treesize of output 20 [2024-11-12 13:24:50,995 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-12 13:24:50,995 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:51,006 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 26 treesize of output 9 [2024-11-12 13:24:51,178 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 8 treesize of output 4 [2024-11-12 13:24:51,185 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 13:24:51,185 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:51,269 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-11-12 13:24:51,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 33 [2024-11-12 13:24:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:51,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:51,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854223405] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:51,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:24:51,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19] total 27 [2024-11-12 13:24:51,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136033129] [2024-11-12 13:24:51,532 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:51,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-12 13:24:51,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:51,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-12 13:24:51,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992 [2024-11-12 13:24:51,533 INFO L87 Difference]: Start difference. First operand 262 states and 306 transitions. Second operand has 28 states, 27 states have (on average 4.185185185185185) internal successors, (113), 21 states have internal predecessors, (113), 7 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 13:24:55,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:24:56,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:56,597 INFO L93 Difference]: Finished difference Result 299 states and 347 transitions. [2024-11-12 13:24:56,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-12 13:24:56,598 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.185185185185185) internal successors, (113), 21 states have internal predecessors, (113), 7 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 75 [2024-11-12 13:24:56,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:56,599 INFO L225 Difference]: With dead ends: 299 [2024-11-12 13:24:56,599 INFO L226 Difference]: Without dead ends: 299 [2024-11-12 13:24:56,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=312, Invalid=2238, Unknown=0, NotChecked=0, Total=2550 [2024-11-12 13:24:56,600 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 342 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:56,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 895 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1092 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2024-11-12 13:24:56,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-12 13:24:56,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 175. [2024-11-12 13:24:56,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 143 states have (on average 1.3006993006993006) internal successors, (186), 165 states have internal predecessors, (186), 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:24:56,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 198 transitions. [2024-11-12 13:24:56,604 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 198 transitions. Word has length 75 [2024-11-12 13:24:56,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:56,604 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 198 transitions. [2024-11-12 13:24:56,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.185185185185185) internal successors, (113), 21 states have internal predecessors, (113), 7 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 13:24:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 198 transitions. [2024-11-12 13:24:56,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-12 13:24:56,605 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:56,605 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:24:56,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-12 13:24:56,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:56,806 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:24:56,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:56,806 INFO L85 PathProgramCache]: Analyzing trace with hash -850577046, now seen corresponding path program 2 times [2024-11-12 13:24:56,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:56,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740572664] [2024-11-12 13:24:56,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:56,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:57,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:57,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 13:24:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:57,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 13:24:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:57,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 13:24:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:57,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 13:24:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:57,253 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:24:57,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:57,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740572664] [2024-11-12 13:24:57,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740572664] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:57,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640486243] [2024-11-12 13:24:57,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:24:57,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:57,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:57,255 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:24:57,256 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:24:57,686 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:24:57,686 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:24:57,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 13:24:57,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:57,742 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:24:57,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:57,809 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:24:57,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640486243] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:24:57,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:24:57,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 18 [2024-11-12 13:24:57,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214101046] [2024-11-12 13:24:57,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:57,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 13:24:57,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:57,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 13:24:57,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-12 13:24:57,811 INFO L87 Difference]: Start difference. First operand 175 states and 198 transitions. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 17 states have internal predecessors, (76), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-12 13:24:58,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:58,144 INFO L93 Difference]: Finished difference Result 199 states and 206 transitions. [2024-11-12 13:24:58,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-12 13:24:58,145 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 17 states have internal predecessors, (76), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 102 [2024-11-12 13:24:58,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:58,146 INFO L225 Difference]: With dead ends: 199 [2024-11-12 13:24:58,146 INFO L226 Difference]: Without dead ends: 199 [2024-11-12 13:24:58,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 210 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=897, Unknown=0, NotChecked=0, Total=1056 [2024-11-12 13:24:58,147 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 259 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:58,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 629 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:24:58,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-12 13:24:58,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 179. [2024-11-12 13:24:58,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 146 states have (on average 1.3150684931506849) internal successors, (192), 168 states have internal predecessors, (192), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 13:24:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 206 transitions. [2024-11-12 13:24:58,150 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 206 transitions. Word has length 102 [2024-11-12 13:24:58,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:58,150 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 206 transitions. [2024-11-12 13:24:58,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 17 states have internal predecessors, (76), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-12 13:24:58,150 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 206 transitions. [2024-11-12 13:24:58,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-12 13:24:58,150 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:58,150 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:24:58,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-12 13:24:58,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-12 13:24:58,351 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:24:58,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:58,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1145027360, now seen corresponding path program 1 times [2024-11-12 13:24:58,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:58,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806887185] [2024-11-12 13:24:58,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:58,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:58,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:24:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:58,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 13:24:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:58,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 13:24:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:58,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 13:24:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:59,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 13:24:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:59,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 13:24:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:59,099 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2024-11-12 13:24:59,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:59,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806887185] [2024-11-12 13:24:59,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806887185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:59,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517495994] [2024-11-12 13:24:59,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:59,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:59,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:59,101 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:24:59,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-12 13:24:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:59,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-12 13:24:59,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:59,454 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:59,497 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-12 13:24:59,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 19 treesize of output 16 [2024-11-12 13:24:59,564 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:59,583 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-11-12 13:24:59,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 19 [2024-11-12 13:24:59,777 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-11-12 13:24:59,777 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 36 treesize of output 29 [2024-11-12 13:24:59,779 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 44 treesize of output 13 [2024-11-12 13:24:59,913 INFO L349 Elim1Store]: treesize reduction 48, result has 44.8 percent of original size [2024-11-12 13:24:59,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 55 [2024-11-12 13:24:59,915 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 44 treesize of output 13 [2024-11-12 13:25:00,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-12 13:25:00,091 INFO L349 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2024-11-12 13:25:00,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2024-11-12 13:25:00,104 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 66 proven. 84 refuted. 0 times theorem prover too weak. 28 trivial. 41 not checked. [2024-11-12 13:25:00,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:25:01,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2024-11-12 13:25:01,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517495994] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:25:01,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:25:01,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 20] total 24 [2024-11-12 13:25:01,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983892836] [2024-11-12 13:25:01,612 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:25:01,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-12 13:25:01,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:25:01,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-12 13:25:01,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1013, Unknown=1, NotChecked=66, Total=1260 [2024-11-12 13:25:01,617 INFO L87 Difference]: Start difference. First operand 179 states and 206 transitions. Second operand has 25 states, 24 states have (on average 5.375) internal successors, (129), 22 states have internal predecessors, (129), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-12 13:25:02,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:25:02,202 INFO L93 Difference]: Finished difference Result 204 states and 231 transitions. [2024-11-12 13:25:02,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 13:25:02,203 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.375) internal successors, (129), 22 states have internal predecessors, (129), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 128 [2024-11-12 13:25:02,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:25:02,204 INFO L225 Difference]: With dead ends: 204 [2024-11-12 13:25:02,204 INFO L226 Difference]: Without dead ends: 204 [2024-11-12 13:25:02,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 194 SyntacticMatches, 11 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=340, Invalid=1643, Unknown=1, NotChecked=86, Total=2070 [2024-11-12 13:25:02,205 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 75 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:25:02,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 716 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 646 Invalid, 0 Unknown, 115 Unchecked, 0.3s Time] [2024-11-12 13:25:02,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-12 13:25:02,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 178. [2024-11-12 13:25:02,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 146 states have (on average 1.3082191780821917) internal successors, (191), 167 states have internal predecessors, (191), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 13:25:02,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 205 transitions. [2024-11-12 13:25:02,208 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 205 transitions. Word has length 128 [2024-11-12 13:25:02,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:25:02,208 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 205 transitions. [2024-11-12 13:25:02,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.375) internal successors, (129), 22 states have internal predecessors, (129), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-12 13:25:02,208 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 205 transitions. [2024-11-12 13:25:02,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-12 13:25:02,209 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:25:02,209 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:02,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-12 13:25:02,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-12 13:25:02,409 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-12 13:25:02,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:25:02,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1145027361, now seen corresponding path program 1 times [2024-11-12 13:25:02,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:25:02,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737083077] [2024-11-12 13:25:02,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:25:02,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:25:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:03,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:25:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:03,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 13:25:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:03,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 13:25:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:03,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 13:25:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:03,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 13:25:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:03,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 13:25:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-12 13:25:03,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:25:03,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737083077] [2024-11-12 13:25:03,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737083077] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:25:03,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973643215] [2024-11-12 13:25:03,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:25:03,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:25:03,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:25:03,401 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:25:03,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-12 13:25:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:03,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 124 conjuncts are in the unsatisfiable core [2024-11-12 13:25:03,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:25:03,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:25:03,939 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 59 treesize of output 38 [2024-11-12 13:25:03,996 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-12 13:25:03,996 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 22 treesize of output 17 [2024-11-12 13:25:04,012 INFO L349 Elim1Store]: treesize reduction 32, result has 30.4 percent of original size [2024-11-12 13:25:04,013 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 31 treesize of output 20 [2024-11-12 13:25:04,282 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-11-12 13:25:04,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 19 [2024-11-12 13:25:04,308 INFO L349 Elim1Store]: treesize reduction 38, result has 29.6 percent of original size [2024-11-12 13:25:04,309 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 37 treesize of output 22 [2024-11-12 13:25:04,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 15 [2024-11-12 13:25:04,635 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-11-12 13:25:04,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 19 [2024-11-12 13:25:04,644 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2024-11-12 13:25:04,644 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 18 treesize of output 20 [2024-11-12 13:25:04,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 21 [2024-11-12 13:25:04,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:25:04,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:25:04,899 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-12 13:25:04,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 23 [2024-11-12 13:25:04,922 INFO L349 Elim1Store]: treesize reduction 40, result has 48.1 percent of original size [2024-11-12 13:25:04,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 49 [2024-11-12 13:25:04,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 27 [2024-11-12 13:25:05,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:25:05,059 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 29 treesize of output 13 [2024-11-12 13:25:05,078 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-11-12 13:25:05,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 33 [2024-11-12 13:25:05,132 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 27 proven. 189 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:25:05,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:25:05,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973643215] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:25:05,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:25:05,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 27] total 38 [2024-11-12 13:25:05,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018284250] [2024-11-12 13:25:05,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:25:05,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-12 13:25:05,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:25:05,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-12 13:25:05,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1448, Unknown=0, NotChecked=0, Total=1640 [2024-11-12 13:25:05,227 INFO L87 Difference]: Start difference. First operand 178 states and 205 transitions. Second operand has 39 states, 38 states have (on average 4.578947368421052) internal successors, (174), 35 states have internal predecessors, (174), 7 states have call successors, (9), 5 states have call predecessors, (9), 9 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-12 13:25:09,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:25:13,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:25:17,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:25:21,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:25:22,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:25:22,330 INFO L93 Difference]: Finished difference Result 215 states and 242 transitions. [2024-11-12 13:25:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-12 13:25:22,330 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 4.578947368421052) internal successors, (174), 35 states have internal predecessors, (174), 7 states have call successors, (9), 5 states have call predecessors, (9), 9 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) Word has length 128 [2024-11-12 13:25:22,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:25:22,331 INFO L225 Difference]: With dead ends: 215 [2024-11-12 13:25:22,331 INFO L226 Difference]: Without dead ends: 215 [2024-11-12 13:25:22,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=557, Invalid=3472, Unknown=3, NotChecked=0, Total=4032 [2024-11-12 13:25:22,333 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 386 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 17 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2024-11-12 13:25:22,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 839 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 905 Invalid, 4 Unknown, 0 Unchecked, 16.5s Time] [2024-11-12 13:25:22,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-12 13:25:22,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 177. [2024-11-12 13:25:22,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 146 states have (on average 1.3013698630136987) internal successors, (190), 166 states have internal predecessors, (190), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 13:25:22,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 204 transitions. [2024-11-12 13:25:22,336 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 204 transitions. Word has length 128 [2024-11-12 13:25:22,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:25:22,336 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 204 transitions. [2024-11-12 13:25:22,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 4.578947368421052) internal successors, (174), 35 states have internal predecessors, (174), 7 states have call successors, (9), 5 states have call predecessors, (9), 9 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-12 13:25:22,337 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 204 transitions. [2024-11-12 13:25:22,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-12 13:25:22,337 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:25:22,337 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-12 13:25:22,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-12 13:25:22,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-12 13:25:22,542 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-12 13:25:22,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:25:22,542 INFO L85 PathProgramCache]: Analyzing trace with hash 859665889, now seen corresponding path program 1 times [2024-11-12 13:25:22,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:25:22,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126053282] [2024-11-12 13:25:22,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:25:22,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:25:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:23,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:25:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:23,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 13:25:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:23,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 13:25:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:23,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 13:25:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:23,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 13:25:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:23,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 13:25:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:23,945 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-11-12 13:25:23,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:25:23,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126053282] [2024-11-12 13:25:23,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126053282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:25:23,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904369750] [2024-11-12 13:25:23,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:25:23,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:25:23,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:25:23,947 INFO L229 MonitoredProcess]: Starting monitored process 19 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:23,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-12 13:25:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:24,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 137 conjuncts are in the unsatisfiable core [2024-11-12 13:25:24,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:25:24,314 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:24,322 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:25:24,322 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:24,330 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:24,355 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:25:24,360 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:25:24,545 INFO L349 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2024-11-12 13:25:24,545 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 32 treesize of output 31 [2024-11-12 13:25:24,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:25:24,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 48 [2024-11-12 13:25:24,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:25:24,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 44 [2024-11-12 13:25:24,783 INFO L349 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2024-11-12 13:25:24,783 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 46 treesize of output 45 [2024-11-12 13:25:24,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:25:24,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 46 [2024-11-12 13:25:24,972 INFO L349 Elim1Store]: treesize reduction 68, result has 50.4 percent of original size [2024-11-12 13:25:24,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 85 [2024-11-12 13:25:25,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:25:25,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 56 [2024-11-12 13:25:25,193 INFO L349 Elim1Store]: treesize reduction 88, result has 53.7 percent of original size [2024-11-12 13:25:25,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 128 [2024-11-12 13:25:25,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 68 [2024-11-12 13:25:25,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:25:25,582 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 58 treesize of output 42 [2024-11-12 13:25:25,626 INFO L349 Elim1Store]: treesize reduction 42, result has 64.4 percent of original size [2024-11-12 13:25:25,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 105 [2024-11-12 13:25:25,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:25:25,736 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 32 treesize of output 12 [2024-11-12 13:25:25,744 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 6 proven. 141 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-12 13:25:25,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:25:29,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904369750] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:25:29,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:25:29,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26] total 36 [2024-11-12 13:25:29,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685746589] [2024-11-12 13:25:29,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:25:29,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-12 13:25:29,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:25:29,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-12 13:25:29,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1272, Unknown=17, NotChecked=0, Total=1406 [2024-11-12 13:25:29,865 INFO L87 Difference]: Start difference. First operand 177 states and 204 transitions. Second operand has 37 states, 36 states have (on average 3.4722222222222223) internal successors, (125), 35 states have internal predecessors, (125), 6 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-12 13:25:31,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:25:31,299 INFO L93 Difference]: Finished difference Result 296 states and 326 transitions. [2024-11-12 13:25:31,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-12 13:25:31,299 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.4722222222222223) internal successors, (125), 35 states have internal predecessors, (125), 6 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 130 [2024-11-12 13:25:31,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:25:31,300 INFO L225 Difference]: With dead ends: 296 [2024-11-12 13:25:31,300 INFO L226 Difference]: Without dead ends: 296 [2024-11-12 13:25:31,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=466, Invalid=3807, Unknown=17, NotChecked=0, Total=4290 [2024-11-12 13:25:31,301 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 474 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 1422 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 13:25:31,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1027 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1422 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 13:25:31,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-12 13:25:31,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 175. [2024-11-12 13:25:31,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 147 states have (on average 1.251700680272109) internal successors, (184), 164 states have internal predecessors, (184), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 13:25:31,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 198 transitions. [2024-11-12 13:25:31,305 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 198 transitions. Word has length 130 [2024-11-12 13:25:31,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:25:31,305 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 198 transitions. [2024-11-12 13:25:31,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.4722222222222223) internal successors, (125), 35 states have internal predecessors, (125), 6 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-12 13:25:31,305 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 198 transitions. [2024-11-12 13:25:31,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-12 13:25:31,306 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:25:31,306 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-12 13:25:31,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-12 13:25:31,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-12 13:25:31,507 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-12 13:25:31,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:25:31,508 INFO L85 PathProgramCache]: Analyzing trace with hash 859665890, now seen corresponding path program 1 times [2024-11-12 13:25:31,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:25:31,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70205982] [2024-11-12 13:25:31,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:25:31,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:25:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:32,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:25:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:33,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 13:25:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:33,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 13:25:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:33,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 13:25:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:33,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 13:25:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:33,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 13:25:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:33,788 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-12 13:25:33,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:25:33,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70205982] [2024-11-12 13:25:33,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70205982] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:25:33,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42343967] [2024-11-12 13:25:33,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:25:33,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:25:33,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:25:33,790 INFO L229 MonitoredProcess]: Starting monitored process 20 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:33,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-12 13:25:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:34,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 168 conjuncts are in the unsatisfiable core [2024-11-12 13:25:34,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:25:34,175 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:34,180 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:25:34,181 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:34,195 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:34,198 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:25:34,249 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:25:34,254 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:25:34,284 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 21 treesize of output 20 [2024-11-12 13:25:34,288 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 36 treesize of output 27 [2024-11-12 13:25:34,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2024-11-12 13:25:34,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-12 13:25:34,662 INFO L349 Elim1Store]: treesize reduction 50, result has 32.4 percent of original size [2024-11-12 13:25:34,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 30 [2024-11-12 13:25:34,667 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 54 treesize of output 41 [2024-11-12 13:25:34,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-12 13:25:34,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-12 13:25:34,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:25:34,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-12 13:25:34,940 INFO L349 Elim1Store]: treesize reduction 50, result has 32.4 percent of original size [2024-11-12 13:25:34,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 30 [2024-11-12 13:25:34,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 44 [2024-11-12 13:25:35,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-12 13:25:35,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:25:35,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-12 13:25:35,352 INFO L349 Elim1Store]: treesize reduction 42, result has 36.4 percent of original size [2024-11-12 13:25:35,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 41 [2024-11-12 13:25:35,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 49 [2024-11-12 13:25:35,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:25:35,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 84 treesize of output 43 [2024-11-12 13:25:35,679 INFO L349 Elim1Store]: treesize reduction 20, result has 64.9 percent of original size [2024-11-12 13:25:35,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49 [2024-11-12 13:25:35,684 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 32 treesize of output 15 [2024-11-12 13:25:35,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-12 13:25:35,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 36 [2024-11-12 13:25:35,949 INFO L349 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2024-11-12 13:25:35,949 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 20 treesize of output 25 [2024-11-12 13:25:35,958 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 14 treesize of output 10 [2024-11-12 13:25:35,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-12 13:25:36,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2024-11-12 13:25:36,043 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 43 proven. 161 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 13:25:36,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:25:36,192 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7160 (Array Int Int))) (<= 0 (+ 5 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~list2~0#1.base| v_ArrVal_7160) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_7162 Int)) (or (< v_ArrVal_7162 9) (forall ((v_ArrVal_7161 (Array Int Int)) (v_append_~node~0.base_171 Int) (v_ArrVal_7160 (Array Int Int))) (<= (+ 9 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~list2~0#1.base| v_ArrVal_7160) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (store |c_#length| v_append_~node~0.base_171 v_ArrVal_7162) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list2~0#1.base| v_ArrVal_7161) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) is different from false [2024-11-12 13:25:36,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42343967] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:25:36,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:25:36,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 28] total 45 [2024-11-12 13:25:36,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080600047] [2024-11-12 13:25:36,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:25:36,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-12 13:25:36,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:25:36,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-12 13:25:36,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=2106, Unknown=1, NotChecked=94, Total=2450 [2024-11-12 13:25:36,195 INFO L87 Difference]: Start difference. First operand 175 states and 198 transitions. Second operand has 46 states, 45 states have (on average 4.222222222222222) internal successors, (190), 43 states have internal predecessors, (190), 8 states have call successors, (9), 4 states have call predecessors, (9), 10 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-12 13:25:37,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:25:37,910 INFO L93 Difference]: Finished difference Result 324 states and 372 transitions. [2024-11-12 13:25:37,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-12 13:25:37,910 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 4.222222222222222) internal successors, (190), 43 states have internal predecessors, (190), 8 states have call successors, (9), 4 states have call predecessors, (9), 10 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) Word has length 130 [2024-11-12 13:25:37,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:25:37,911 INFO L225 Difference]: With dead ends: 324 [2024-11-12 13:25:37,911 INFO L226 Difference]: Without dead ends: 324 [2024-11-12 13:25:37,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1725 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=717, Invalid=5138, Unknown=1, NotChecked=150, Total=6006 [2024-11-12 13:25:37,913 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 455 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 13:25:37,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 956 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 13:25:37,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-12 13:25:37,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 176. [2024-11-12 13:25:37,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 149 states have (on average 1.2348993288590604) internal successors, (184), 165 states have internal predecessors, (184), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 13:25:37,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 198 transitions. [2024-11-12 13:25:37,916 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 198 transitions. Word has length 130 [2024-11-12 13:25:37,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:25:37,917 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 198 transitions. [2024-11-12 13:25:37,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 4.222222222222222) internal successors, (190), 43 states have internal predecessors, (190), 8 states have call successors, (9), 4 states have call predecessors, (9), 10 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-12 13:25:37,917 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 198 transitions. [2024-11-12 13:25:37,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 13:25:37,918 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:25:37,918 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-12 13:25:37,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-12 13:25:38,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:25:38,119 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-12 13:25:38,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:25:38,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1934897290, now seen corresponding path program 1 times [2024-11-12 13:25:38,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:25:38,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434332107] [2024-11-12 13:25:38,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:25:38,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:25:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:38,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:25:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:38,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 13:25:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:38,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 13:25:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:38,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 13:25:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:38,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 13:25:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:38,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 13:25:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:38,577 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2024-11-12 13:25:38,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:25:38,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434332107] [2024-11-12 13:25:38,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434332107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:25:38,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:25:38,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:25:38,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502787737] [2024-11-12 13:25:38,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:25:38,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:25:38,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:25:38,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:25:38,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:25:38,579 INFO L87 Difference]: Start difference. First operand 176 states and 198 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 13:25:38,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:25:38,663 INFO L93 Difference]: Finished difference Result 175 states and 196 transitions. [2024-11-12 13:25:38,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:25:38,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 135 [2024-11-12 13:25:38,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:25:38,664 INFO L225 Difference]: With dead ends: 175 [2024-11-12 13:25:38,664 INFO L226 Difference]: Without dead ends: 175 [2024-11-12 13:25:38,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:25:38,664 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 147 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:25:38,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 122 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:25:38,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-12 13:25:38,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2024-11-12 13:25:38,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 148 states have (on average 1.2297297297297298) internal successors, (182), 164 states have internal predecessors, (182), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 13:25:38,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 196 transitions. [2024-11-12 13:25:38,667 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 196 transitions. Word has length 135 [2024-11-12 13:25:38,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:25:38,667 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 196 transitions. [2024-11-12 13:25:38,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 13:25:38,668 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 196 transitions. [2024-11-12 13:25:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 13:25:38,668 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:25:38,668 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-12 13:25:38,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-12 13:25:38,669 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-12 13:25:38,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:25:38,669 INFO L85 PathProgramCache]: Analyzing trace with hash -146279219, now seen corresponding path program 1 times [2024-11-12 13:25:38,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:25:38,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754660721] [2024-11-12 13:25:38,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:25:38,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:25:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:39,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:25:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:39,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 13:25:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:39,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 13:25:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:39,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 13:25:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:39,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 13:25:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:39,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 13:25:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:39,534 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-11-12 13:25:39,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:25:39,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754660721] [2024-11-12 13:25:39,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754660721] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:25:39,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386779759] [2024-11-12 13:25:39,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:25:39,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:25:39,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:25:39,536 INFO L229 MonitoredProcess]: Starting monitored process 21 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:39,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-12 13:25:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:25:39,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 1077 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-12 13:25:39,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:25:39,959 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:39,965 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:25:39,965 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:40,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 13:25:40,020 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 33 treesize of output 17 [2024-11-12 13:25:40,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:25:40,081 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 25 treesize of output 9 [2024-11-12 13:25:44,156 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_68| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_68| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_68| |c_#memory_$Pointer$#2.base|)) (.cse1 (select .cse0 .cse3))) (and (<= (select .cse0 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_68| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse2) (<= (+ .cse1 1) |c_#StackHeapBarrier|))))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse4 (select .cse5 .cse3))) (and (<= (+ .cse4 1) |c_#StackHeapBarrier|) (<= (select .cse5 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse4)))))) (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:44,158 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_68| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_68| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_68| |c_#memory_$Pointer$#2.base|)) (.cse1 (select .cse0 .cse3))) (and (<= (select .cse0 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_68| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse2) (<= (+ .cse1 1) |c_#StackHeapBarrier|))))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse4 (select .cse5 .cse3))) (and (<= (+ .cse4 1) |c_#StackHeapBarrier|) (<= (select .cse5 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse4)))))) (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:44,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:25:44,176 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 25 treesize of output 9 [2024-11-12 13:25:48,232 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_69| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_69| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse1 (select .cse0 .cse3)) (.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_69| |c_#memory_$Pointer$#2.base|))) (and (<= (select .cse0 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse1) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (= .cse2 |c_ULTIMATE.start_main_~list2~0#1.base|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_69| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|))))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse4 (select .cse5 .cse3))) (and (<= (+ .cse4 1) |c_#StackHeapBarrier|) (<= (select .cse5 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse4)))))) (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:48,235 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_69| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_69| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse1 (select .cse0 .cse3)) (.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_69| |c_#memory_$Pointer$#2.base|))) (and (<= (select .cse0 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse1) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (= .cse2 |c_ULTIMATE.start_main_~list2~0#1.base|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_69| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|))))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse4 (select .cse5 .cse3))) (and (<= (+ .cse4 1) |c_#StackHeapBarrier|) (<= (select .cse5 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse4)))))) (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:48,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:25:48,259 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 25 treesize of output 9 [2024-11-12 13:25:48,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:25:48,322 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 25 treesize of output 9