./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.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 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:01:46,677 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:01:46,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 11:01:46,746 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:01:46,747 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:01:46,780 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:01:46,781 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:01:46,781 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:01:46,782 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:01:46,783 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:01:46,784 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:01:46,785 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:01:46,785 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:01:46,785 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:01:46,787 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:01:46,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:01:46,788 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:01:46,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:01:46,788 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:01:46,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:01:46,789 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:01:46,789 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:01:46,790 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:01:46,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:01:46,790 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:01:46,791 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:01:46,791 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:01:46,791 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:01:46,791 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:01:46,792 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:01:46,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:01:46,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:01:46,793 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:01:46,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:01:46,793 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:01:46,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:01:46,794 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 11:01:46,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 11:01:46,794 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:01:46,795 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:01:46,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:01:46,796 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:01:46,796 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 -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2024-10-13 11:01:47,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:01:47,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:01:47,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:01:47,119 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:01:47,119 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:01:47,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2024-10-13 11:01:48,493 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:01:48,802 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:01:48,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2024-10-13 11:01:48,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a6a134d7/ebf63b4740e349f0817c71034b1a69fc/FLAGbfac08b5d [2024-10-13 11:01:49,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a6a134d7/ebf63b4740e349f0817c71034b1a69fc [2024-10-13 11:01:49,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:01:49,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:01:49,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:01:49,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:01:49,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:01:49,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:01:49" (1/1) ... [2024-10-13 11:01:49,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@275ff9ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:49, skipping insertion in model container [2024-10-13 11:01:49,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:01:49" (1/1) ... [2024-10-13 11:01:49,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:01:49,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:01:49,461 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 11:01:49,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:01:49,538 INFO L204 MainTranslator]: Completed translation [2024-10-13 11:01:49,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:49 WrapperNode [2024-10-13 11:01:49,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:01:49,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 11:01:49,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 11:01:49,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 11:01:49,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:49" (1/1) ... [2024-10-13 11:01:49,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:49" (1/1) ... [2024-10-13 11:01:49,592 INFO L138 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-10-13 11:01:49,593 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 11:01:49,597 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 11:01:49,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 11:01:49,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 11:01:49,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:49" (1/1) ... [2024-10-13 11:01:49,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:49" (1/1) ... [2024-10-13 11:01:49,615 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:49" (1/1) ... [2024-10-13 11:01:49,642 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-10-13 11:01:49,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:49" (1/1) ... [2024-10-13 11:01:49,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:49" (1/1) ... [2024-10-13 11:01:49,653 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:49" (1/1) ... [2024-10-13 11:01:49,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:49" (1/1) ... [2024-10-13 11:01:49,664 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:49" (1/1) ... [2024-10-13 11:01:49,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:49" (1/1) ... [2024-10-13 11:01:49,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 11:01:49,676 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 11:01:49,676 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 11:01:49,676 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 11:01:49,677 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:49" (1/1) ... [2024-10-13 11:01:49,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:01:49,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:01:49,716 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 11:01:49,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 11:01:49,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 11:01:49,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 11:01:49,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 11:01:49,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 11:01:49,767 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-13 11:01:49,767 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-13 11:01:49,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 11:01:49,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 11:01:49,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 11:01:49,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 11:01:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 11:01:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 11:01:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 11:01:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 11:01:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 11:01:49,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 11:01:49,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 11:01:49,892 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 11:01:49,894 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 11:01:50,192 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2024-10-13 11:01:50,193 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 11:01:50,242 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 11:01:50,242 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-13 11:01:50,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:01:50 BoogieIcfgContainer [2024-10-13 11:01:50,243 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 11:01:50,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 11:01:50,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 11:01:50,251 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 11:01:50,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:01:49" (1/3) ... [2024-10-13 11:01:50,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5966a35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:01:50, skipping insertion in model container [2024-10-13 11:01:50,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:49" (2/3) ... [2024-10-13 11:01:50,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5966a35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:01:50, skipping insertion in model container [2024-10-13 11:01:50,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:01:50" (3/3) ... [2024-10-13 11:01:50,255 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2024-10-13 11:01:50,270 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 11:01:50,271 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2024-10-13 11:01:50,318 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 11:01:50,327 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;@2b7d45af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 11:01:50,327 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-10-13 11:01:50,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 37 states have (on average 2.189189189189189) internal successors, (81), 65 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:01:50,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 11:01:50,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:50,339 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 11:01:50,340 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:01:50,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:50,346 INFO L85 PathProgramCache]: Analyzing trace with hash 209499439, now seen corresponding path program 1 times [2024-10-13 11:01:50,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:50,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189296107] [2024-10-13 11:01:50,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:50,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:50,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:01:50,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:50,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189296107] [2024-10-13 11:01:50,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189296107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:50,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:01:50,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:01:50,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108552909] [2024-10-13 11:01:50,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:50,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:01:50,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:50,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:01:50,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:01:50,614 INFO L87 Difference]: Start difference. First operand has 69 states, 37 states have (on average 2.189189189189189) internal successors, (81), 65 states have internal predecessors, (81), 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 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:01:50,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:50,711 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2024-10-13 11:01:50,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:01:50,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-10-13 11:01:50,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:50,718 INFO L225 Difference]: With dead ends: 66 [2024-10-13 11:01:50,719 INFO L226 Difference]: Without dead ends: 64 [2024-10-13 11:01:50,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:01:50,723 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:50,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:01:50,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-13 11:01:50,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-13 11:01:50,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 60 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:01:50,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2024-10-13 11:01:50,755 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 5 [2024-10-13 11:01:50,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:50,755 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2024-10-13 11:01:50,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:01:50,755 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2024-10-13 11:01:50,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 11:01:50,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:50,756 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 11:01:50,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 11:01:50,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:01:50,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:50,757 INFO L85 PathProgramCache]: Analyzing trace with hash 209499440, now seen corresponding path program 1 times [2024-10-13 11:01:50,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:50,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066393125] [2024-10-13 11:01:50,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:50,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:01:50,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:50,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066393125] [2024-10-13 11:01:50,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066393125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:50,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:01:50,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:01:50,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68270453] [2024-10-13 11:01:50,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:50,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:01:50,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:50,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:01:50,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:01:50,870 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:01:50,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:50,939 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2024-10-13 11:01:50,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:01:50,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-10-13 11:01:50,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:50,941 INFO L225 Difference]: With dead ends: 62 [2024-10-13 11:01:50,941 INFO L226 Difference]: Without dead ends: 62 [2024-10-13 11:01:50,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:01:50,945 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:50,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 101 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:01:50,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-13 11:01:50,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-13 11:01:50,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 58 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:01:50,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2024-10-13 11:01:50,973 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 5 [2024-10-13 11:01:50,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:50,973 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2024-10-13 11:01:50,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:01:50,974 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-10-13 11:01:50,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 11:01:50,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:50,975 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:01:50,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 11:01:50,975 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:01:50,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:50,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1748640650, now seen corresponding path program 1 times [2024-10-13 11:01:50,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:50,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468439028] [2024-10-13 11:01:50,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:50,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:51,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:51,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:01:51,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:51,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468439028] [2024-10-13 11:01:51,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468439028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:51,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:01:51,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:01:51,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295518931] [2024-10-13 11:01:51,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:51,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:01:51,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:51,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:01:51,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:01:51,117 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 11:01:51,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:51,197 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2024-10-13 11:01:51,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:01:51,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2024-10-13 11:01:51,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:51,199 INFO L225 Difference]: With dead ends: 68 [2024-10-13 11:01:51,199 INFO L226 Difference]: Without dead ends: 68 [2024-10-13 11:01:51,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:01:51,200 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 4 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:51,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 138 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:01:51,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-13 11:01:51,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2024-10-13 11:01:51,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 59 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:01:51,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2024-10-13 11:01:51,210 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 10 [2024-10-13 11:01:51,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:51,211 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2024-10-13 11:01:51,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 11:01:51,211 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2024-10-13 11:01:51,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 11:01:51,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:51,212 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:01:51,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 11:01:51,212 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:01:51,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:51,213 INFO L85 PathProgramCache]: Analyzing trace with hash 420391556, now seen corresponding path program 1 times [2024-10-13 11:01:51,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:51,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229572712] [2024-10-13 11:01:51,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:51,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:51,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:51,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:51,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 11:01:51,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:51,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229572712] [2024-10-13 11:01:51,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229572712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:51,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:01:51,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:01:51,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947403455] [2024-10-13 11:01:51,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:51,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:01:51,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:51,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:01:51,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:01:51,416 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:01:51,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:51,570 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2024-10-13 11:01:51,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:01:51,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-10-13 11:01:51,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:51,572 INFO L225 Difference]: With dead ends: 62 [2024-10-13 11:01:51,572 INFO L226 Difference]: Without dead ends: 62 [2024-10-13 11:01:51,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:01:51,573 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:51,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 227 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:01:51,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-13 11:01:51,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-13 11:01:51,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 58 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:01:51,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2024-10-13 11:01:51,584 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 17 [2024-10-13 11:01:51,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:51,584 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2024-10-13 11:01:51,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:01:51,584 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-10-13 11:01:51,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 11:01:51,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:51,585 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:01:51,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 11:01:51,585 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:01:51,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:51,586 INFO L85 PathProgramCache]: Analyzing trace with hash 420391557, now seen corresponding path program 1 times [2024-10-13 11:01:51,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:51,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776279038] [2024-10-13 11:01:51,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:51,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:51,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:51,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:51,922 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:01:51,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:51,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776279038] [2024-10-13 11:01:51,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776279038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:51,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:01:51,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:01:51,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093207439] [2024-10-13 11:01:51,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:51,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:01:51,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:51,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:01:51,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:01:51,928 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:01:52,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:52,049 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2024-10-13 11:01:52,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:01:52,050 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-10-13 11:01:52,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:52,051 INFO L225 Difference]: With dead ends: 61 [2024-10-13 11:01:52,053 INFO L226 Difference]: Without dead ends: 61 [2024-10-13 11:01:52,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:01:52,054 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:52,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 247 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:01:52,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-13 11:01:52,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-13 11:01:52,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 57 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:01:52,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-10-13 11:01:52,063 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 17 [2024-10-13 11:01:52,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:52,065 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-10-13 11:01:52,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:01:52,066 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-10-13 11:01:52,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 11:01:52,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:52,066 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:01:52,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 11:01:52,067 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:01:52,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:52,067 INFO L85 PathProgramCache]: Analyzing trace with hash 269529954, now seen corresponding path program 1 times [2024-10-13 11:01:52,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:52,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264112744] [2024-10-13 11:01:52,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:52,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:52,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:52,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:52,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 11:01:52,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:52,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264112744] [2024-10-13 11:01:52,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264112744] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:52,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909261703] [2024-10-13 11:01:52,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:52,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:52,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:01:52,366 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:01:52,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 11:01:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:52,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 11:01:52,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:01:52,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:01:52,610 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-10-13 11:01:52,646 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 11:01:52,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-13 11:01:52,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-10-13 11:01:52,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:01:52,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:01:52,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909261703] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:01:52,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:01:52,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 11 [2024-10-13 11:01:52,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56434838] [2024-10-13 11:01:52,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:01:52,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 11:01:52,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:52,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 11:01:52,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-10-13 11:01:52,860 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 12 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 11:01:53,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:53,076 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2024-10-13 11:01:53,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:01:53,077 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2024-10-13 11:01:53,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:53,078 INFO L225 Difference]: With dead ends: 60 [2024-10-13 11:01:53,078 INFO L226 Difference]: Without dead ends: 60 [2024-10-13 11:01:53,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2024-10-13 11:01:53,079 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:53,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 62 Unchecked, 0.2s Time] [2024-10-13 11:01:53,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-13 11:01:53,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-13 11:01:53,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.75) internal successors, (63), 56 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:01:53,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2024-10-13 11:01:53,084 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 19 [2024-10-13 11:01:53,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:53,084 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2024-10-13 11:01:53,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 11:01:53,084 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2024-10-13 11:01:53,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 11:01:53,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:53,085 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:01:53,104 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-10-13 11:01:53,289 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,SelfDestructingSolverStorable5 [2024-10-13 11:01:53,290 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:01:53,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:53,291 INFO L85 PathProgramCache]: Analyzing trace with hash 269529955, now seen corresponding path program 1 times [2024-10-13 11:01:53,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:53,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596812529] [2024-10-13 11:01:53,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:53,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:53,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:53,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:53,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:01:53,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:53,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596812529] [2024-10-13 11:01:53,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596812529] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:53,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094979666] [2024-10-13 11:01:53,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:53,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:53,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:01:53,828 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:01:53,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 11:01:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:53,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-13 11:01:53,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:01:53,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 11:01:53,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:01:54,067 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-10-13 11:01:54,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:01:54,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 11:01:54,109 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:01:54,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 11:01:54,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-13 11:01:54,123 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:01:54,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094979666] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:54,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:01:54,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2024-10-13 11:01:54,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242696810] [2024-10-13 11:01:54,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:01:54,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 11:01:54,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:54,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 11:01:54,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=149, Unknown=1, NotChecked=24, Total=210 [2024-10-13 11:01:54,249 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 13 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 11:01:54,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:54,513 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2024-10-13 11:01:54,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 11:01:54,514 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-10-13 11:01:54,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:54,517 INFO L225 Difference]: With dead ends: 66 [2024-10-13 11:01:54,517 INFO L226 Difference]: Without dead ends: 66 [2024-10-13 11:01:54,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=197, Unknown=1, NotChecked=28, Total=272 [2024-10-13 11:01:54,519 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:54,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 284 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 239 Invalid, 0 Unknown, 72 Unchecked, 0.2s Time] [2024-10-13 11:01:54,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-13 11:01:54,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-10-13 11:01:54,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.7) internal successors, (68), 60 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 11:01:54,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2024-10-13 11:01:54,528 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 19 [2024-10-13 11:01:54,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:54,528 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2024-10-13 11:01:54,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 11:01:54,529 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2024-10-13 11:01:54,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 11:01:54,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:54,529 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:01:54,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 11:01:54,733 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,SelfDestructingSolverStorable6 [2024-10-13 11:01:54,734 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:01:54,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:54,734 INFO L85 PathProgramCache]: Analyzing trace with hash -2017091990, now seen corresponding path program 1 times [2024-10-13 11:01:54,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:54,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874412990] [2024-10-13 11:01:54,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:54,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:54,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:54,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:54,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 11:01:54,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:54,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874412990] [2024-10-13 11:01:54,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874412990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:54,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:01:54,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 11:01:54,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923007757] [2024-10-13 11:01:54,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:54,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 11:01:54,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:54,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 11:01:54,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:01:54,927 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 10 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:01:55,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:55,117 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2024-10-13 11:01:55,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:01:55,117 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-10-13 11:01:55,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:55,121 INFO L225 Difference]: With dead ends: 68 [2024-10-13 11:01:55,121 INFO L226 Difference]: Without dead ends: 68 [2024-10-13 11:01:55,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-13 11:01:55,122 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 35 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:55,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 286 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 11:01:55,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-13 11:01:55,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-13 11:01:55,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.7209302325581395) internal successors, (74), 63 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 11:01:55,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2024-10-13 11:01:55,127 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 22 [2024-10-13 11:01:55,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:55,130 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2024-10-13 11:01:55,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:01:55,131 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2024-10-13 11:01:55,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 11:01:55,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:55,132 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:01:55,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 11:01:55,132 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:01:55,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:55,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2017091989, now seen corresponding path program 1 times [2024-10-13 11:01:55,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:55,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008011281] [2024-10-13 11:01:55,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:55,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:55,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:55,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:55,260 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 11:01:55,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:55,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008011281] [2024-10-13 11:01:55,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008011281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:55,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:01:55,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:01:55,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225530627] [2024-10-13 11:01:55,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:55,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 11:01:55,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:55,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 11:01:55,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:01:55,265 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-10-13 11:01:55,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:55,372 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2024-10-13 11:01:55,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:01:55,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 22 [2024-10-13 11:01:55,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:55,373 INFO L225 Difference]: With dead ends: 90 [2024-10-13 11:01:55,373 INFO L226 Difference]: Without dead ends: 90 [2024-10-13 11:01:55,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 11:01:55,374 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 101 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:55,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 175 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:01:55,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-13 11:01:55,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 71. [2024-10-13 11:01:55,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.673913043478261) internal successors, (77), 66 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 11:01:55,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2024-10-13 11:01:55,384 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 22 [2024-10-13 11:01:55,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:55,384 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2024-10-13 11:01:55,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-10-13 11:01:55,384 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2024-10-13 11:01:55,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 11:01:55,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:55,385 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:01:55,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 11:01:55,387 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:01:55,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:55,389 INFO L85 PathProgramCache]: Analyzing trace with hash -2017091934, now seen corresponding path program 1 times [2024-10-13 11:01:55,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:55,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815145635] [2024-10-13 11:01:55,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:55,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:55,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:55,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:55,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:01:55,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:55,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815145635] [2024-10-13 11:01:55,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815145635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:55,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:01:55,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 11:01:55,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984666534] [2024-10-13 11:01:55,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:55,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 11:01:55,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:55,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 11:01:55,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:01:55,695 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:01:55,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:55,885 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2024-10-13 11:01:55,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:01:55,885 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-10-13 11:01:55,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:55,886 INFO L225 Difference]: With dead ends: 71 [2024-10-13 11:01:55,886 INFO L226 Difference]: Without dead ends: 71 [2024-10-13 11:01:55,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-13 11:01:55,887 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 30 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:55,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 333 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 11:01:55,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-13 11:01:55,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-13 11:01:55,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 66 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 11:01:55,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2024-10-13 11:01:55,891 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 22 [2024-10-13 11:01:55,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:55,891 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2024-10-13 11:01:55,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:01:55,892 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2024-10-13 11:01:55,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 11:01:55,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:55,892 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:01:55,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 11:01:55,893 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:01:55,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:55,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1394965995, now seen corresponding path program 1 times [2024-10-13 11:01:55,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:55,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661361812] [2024-10-13 11:01:55,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:55,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:56,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:56,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:56,316 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:01:56,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:56,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661361812] [2024-10-13 11:01:56,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661361812] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:56,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19594709] [2024-10-13 11:01:56,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:56,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:56,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:01:56,319 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:01:56,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 11:01:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:56,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-13 11:01:56,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:01:56,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:01:56,515 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:01:56,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 11:01:56,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:01:56,551 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:01:56,552 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-13 11:01:56,613 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 25 treesize of output 13 [2024-10-13 11:01:56,618 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:01:56,619 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:01:56,640 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-10-13 11:01:56,640 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 19 treesize of output 18 [2024-10-13 11:01:56,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:01:56,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-10-13 11:01:56,686 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 22 [2024-10-13 11:01:56,696 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 5 treesize of output 3 [2024-10-13 11:01:56,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19594709] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:56,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:01:56,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 17 [2024-10-13 11:01:56,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443223046] [2024-10-13 11:01:56,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:01:56,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 11:01:56,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:56,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 11:01:56,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=332, Unknown=6, NotChecked=0, Total=380 [2024-10-13 11:01:56,770 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 18 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:01:57,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:57,121 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2024-10-13 11:01:57,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 11:01:57,121 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (4), 3 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 24 [2024-10-13 11:01:57,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:57,122 INFO L225 Difference]: With dead ends: 85 [2024-10-13 11:01:57,122 INFO L226 Difference]: Without dead ends: 85 [2024-10-13 11:01:57,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=485, Unknown=6, NotChecked=0, Total=552 [2024-10-13 11:01:57,123 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 17 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:57,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 600 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 11:01:57,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-13 11:01:57,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2024-10-13 11:01:57,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 72 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 11:01:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2024-10-13 11:01:57,127 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 24 [2024-10-13 11:01:57,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:57,127 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2024-10-13 11:01:57,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:01:57,127 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2024-10-13 11:01:57,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 11:01:57,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:57,128 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:01:57,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 11:01:57,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:57,333 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:01:57,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:57,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1394965994, now seen corresponding path program 1 times [2024-10-13 11:01:57,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:57,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877044626] [2024-10-13 11:01:57,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:57,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:57,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:57,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:57,952 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:01:57,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:57,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877044626] [2024-10-13 11:01:57,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877044626] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:57,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783978726] [2024-10-13 11:01:57,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:57,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:57,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:01:57,955 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:01:57,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 11:01:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:58,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-10-13 11:01:58,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:01:58,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:01:58,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 11:01:58,333 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:01:58,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 11:01:58,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 11:01:58,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:01:58,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:01:58,483 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:01:58,483 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-13 11:01:58,493 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 24 treesize of output 11 [2024-10-13 11:01:58,585 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 25 treesize of output 13 [2024-10-13 11:01:58,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-13 11:01:58,623 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:01:58,623 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:01:58,757 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_777 (Array Int Int)) (v_ArrVal_776 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_776) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_777) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_776 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_776) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)))) is different from false [2024-10-13 11:01:58,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:01:58,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-10-13 11:01:58,784 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 26 [2024-10-13 11:01:58,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:01:58,797 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2024-10-13 11:01:58,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:01:58,804 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-10-13 11:01:58,809 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:01:58,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-10-13 11:01:58,814 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:01:58,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-10-13 11:01:59,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783978726] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:01:59,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:01:59,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2024-10-13 11:01:59,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244924266] [2024-10-13 11:01:59,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:01:59,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-13 11:01:59,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:59,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-13 11:01:59,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1035, Unknown=1, NotChecked=64, Total=1190 [2024-10-13 11:01:59,018 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand has 28 states, 23 states have (on average 1.608695652173913) internal successors, (37), 22 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 11:01:59,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:59,618 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2024-10-13 11:01:59,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 11:01:59,619 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 1.608695652173913) internal successors, (37), 22 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-10-13 11:01:59,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:59,620 INFO L225 Difference]: With dead ends: 85 [2024-10-13 11:01:59,620 INFO L226 Difference]: Without dead ends: 85 [2024-10-13 11:01:59,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=125, Invalid=1360, Unknown=1, NotChecked=74, Total=1560 [2024-10-13 11:01:59,621 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 31 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:59,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 738 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 11:01:59,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-13 11:01:59,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 74. [2024-10-13 11:01:59,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 69 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 11:01:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2024-10-13 11:01:59,626 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 24 [2024-10-13 11:01:59,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:59,626 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2024-10-13 11:01:59,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 1.608695652173913) internal successors, (37), 22 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 11:01:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2024-10-13 11:01:59,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 11:01:59,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:59,627 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:01:59,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 11:01:59,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:01:59,828 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:01:59,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:59,829 INFO L85 PathProgramCache]: Analyzing trace with hash -532338944, now seen corresponding path program 2 times [2024-10-13 11:01:59,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:59,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367386591] [2024-10-13 11:01:59,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:59,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:59,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:01:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:59,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:01:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:59,936 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 11:01:59,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:59,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367386591] [2024-10-13 11:01:59,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367386591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:59,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:01:59,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 11:01:59,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703414588] [2024-10-13 11:01:59,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:59,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:01:59,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:59,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:01:59,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:01:59,939 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-10-13 11:02:00,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:00,042 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2024-10-13 11:02:00,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:02:00,042 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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 26 [2024-10-13 11:02:00,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:00,043 INFO L225 Difference]: With dead ends: 92 [2024-10-13 11:02:00,043 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 11:02:00,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:02:00,044 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 88 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:00,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 229 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:00,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 11:02:00,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2024-10-13 11:02:00,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 72 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 11:02:00,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2024-10-13 11:02:00,048 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 26 [2024-10-13 11:02:00,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:00,048 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2024-10-13 11:02:00,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-10-13 11:02:00,049 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2024-10-13 11:02:00,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 11:02:00,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:00,051 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:00,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 11:02:00,053 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:02:00,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:00,053 INFO L85 PathProgramCache]: Analyzing trace with hash -481630729, now seen corresponding path program 2 times [2024-10-13 11:02:00,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:00,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007991706] [2024-10-13 11:02:00,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:00,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:00,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:02:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:00,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:02:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:00,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 11:02:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:00,159 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 11:02:00,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:00,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007991706] [2024-10-13 11:02:00,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007991706] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:00,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185771074] [2024-10-13 11:02:00,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 11:02:00,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:00,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:00,162 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:02:00,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 11:02:00,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 11:02:00,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:02:00,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:02:00,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 11:02:00,324 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:02:00,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185771074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:00,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 11:02:00,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-10-13 11:02:00,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695161727] [2024-10-13 11:02:00,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:00,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:02:00,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:00,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:02:00,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:02:00,326 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-10-13 11:02:00,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:00,355 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2024-10-13 11:02:00,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:02:00,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 28 [2024-10-13 11:02:00,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:00,357 INFO L225 Difference]: With dead ends: 67 [2024-10-13 11:02:00,357 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 11:02:00,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:02:00,358 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:00,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:02:00,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 11:02:00,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-13 11:02:00,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.5909090909090908) internal successors, (70), 63 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:00,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2024-10-13 11:02:00,366 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 28 [2024-10-13 11:02:00,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:00,367 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2024-10-13 11:02:00,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-10-13 11:02:00,367 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2024-10-13 11:02:00,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 11:02:00,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:00,368 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:00,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 11:02:00,568 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,SelfDestructingSolverStorable13 [2024-10-13 11:02:00,569 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:02:00,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:00,569 INFO L85 PathProgramCache]: Analyzing trace with hash 764909040, now seen corresponding path program 1 times [2024-10-13 11:02:00,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:00,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60779993] [2024-10-13 11:02:00,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:00,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:00,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:02:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:00,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:02:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:00,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 11:02:00,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:00,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60779993] [2024-10-13 11:02:00,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60779993] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:00,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098049876] [2024-10-13 11:02:00,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:00,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:00,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:00,668 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:02:00,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 11:02:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:00,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:02:00,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:00,844 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 11:02:00,844 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:00,885 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 11:02:00,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098049876] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:02:00,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:02:00,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2024-10-13 11:02:00,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10606032] [2024-10-13 11:02:00,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:00,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 11:02:00,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:00,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 11:02:00,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:02:00,888 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 11:02:00,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:00,976 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2024-10-13 11:02:00,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:02:00,977 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-10-13 11:02:00,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:00,977 INFO L225 Difference]: With dead ends: 81 [2024-10-13 11:02:00,977 INFO L226 Difference]: Without dead ends: 81 [2024-10-13 11:02:00,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:02:00,978 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 174 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:00,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 176 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:00,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-13 11:02:00,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2024-10-13 11:02:00,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 70 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:00,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2024-10-13 11:02:00,983 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 29 [2024-10-13 11:02:00,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:00,983 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2024-10-13 11:02:00,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 11:02:00,983 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2024-10-13 11:02:00,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 11:02:00,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:00,985 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:01,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 11:02:01,186 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,SelfDestructingSolverStorable14 [2024-10-13 11:02:01,186 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:02:01,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:01,187 INFO L85 PathProgramCache]: Analyzing trace with hash 766327262, now seen corresponding path program 1 times [2024-10-13 11:02:01,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:01,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884209064] [2024-10-13 11:02:01,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:01,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:01,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:02:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:01,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:02:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:01,339 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 11:02:01,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:01,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884209064] [2024-10-13 11:02:01,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884209064] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:01,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407267031] [2024-10-13 11:02:01,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:01,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:01,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:01,342 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:02:01,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 11:02:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:01,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:02:01,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:01,549 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 11:02:01,550 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:01,598 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 11:02:01,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407267031] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:02:01,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:02:01,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2024-10-13 11:02:01,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093999230] [2024-10-13 11:02:01,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:01,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 11:02:01,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:01,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 11:02:01,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 11:02:01,601 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 11:02:01,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:01,711 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2024-10-13 11:02:01,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:02:01,711 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-10-13 11:02:01,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:01,711 INFO L225 Difference]: With dead ends: 73 [2024-10-13 11:02:01,712 INFO L226 Difference]: Without dead ends: 73 [2024-10-13 11:02:01,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-13 11:02:01,712 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 164 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:01,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 219 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:01,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-13 11:02:01,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2024-10-13 11:02:01,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.553191489361702) internal successors, (73), 62 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2024-10-13 11:02:01,715 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 29 [2024-10-13 11:02:01,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:01,715 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2024-10-13 11:02:01,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 11:02:01,715 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2024-10-13 11:02:01,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 11:02:01,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:01,716 INFO L215 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] [2024-10-13 11:02:01,732 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-10-13 11:02:01,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:01,916 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:02:01,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:01,917 INFO L85 PathProgramCache]: Analyzing trace with hash 264449618, now seen corresponding path program 2 times [2024-10-13 11:02:01,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:01,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835783539] [2024-10-13 11:02:01,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:01,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:02,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:02:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:02,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:02:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:02,033 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 11:02:02,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:02,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835783539] [2024-10-13 11:02:02,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835783539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:02,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:02,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 11:02:02,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361765608] [2024-10-13 11:02:02,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:02,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 11:02:02,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:02,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 11:02:02,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:02:02,036 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-10-13 11:02:02,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:02,128 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2024-10-13 11:02:02,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:02:02,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 32 [2024-10-13 11:02:02,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:02,129 INFO L225 Difference]: With dead ends: 72 [2024-10-13 11:02:02,129 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 11:02:02,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:02:02,130 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 25 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:02,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 174 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:02,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 11:02:02,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-13 11:02:02,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 53 states have (on average 1.6037735849056605) internal successors, (85), 68 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:02,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2024-10-13 11:02:02,134 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 32 [2024-10-13 11:02:02,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:02,135 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2024-10-13 11:02:02,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-10-13 11:02:02,136 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2024-10-13 11:02:02,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 11:02:02,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:02,136 INFO L215 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] [2024-10-13 11:02:02,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 11:02:02,136 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:02:02,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:02,137 INFO L85 PathProgramCache]: Analyzing trace with hash 264449619, now seen corresponding path program 1 times [2024-10-13 11:02:02,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:02,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70901702] [2024-10-13 11:02:02,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:02,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:02,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:02:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:02,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:02:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 11:02:02,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:02,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70901702] [2024-10-13 11:02:02,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70901702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:02,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:02,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 11:02:02,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772669196] [2024-10-13 11:02:02,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:02,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 11:02:02,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:02,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 11:02:02,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:02:02,461 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand has 10 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:02:02,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:02,583 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2024-10-13 11:02:02,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:02:02,583 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-10-13 11:02:02,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:02,584 INFO L225 Difference]: With dead ends: 72 [2024-10-13 11:02:02,584 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 11:02:02,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-13 11:02:02,585 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 19 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:02,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 302 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:02,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 11:02:02,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-13 11:02:02,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 53 states have (on average 1.528301886792453) internal successors, (81), 68 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:02,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2024-10-13 11:02:02,587 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 32 [2024-10-13 11:02:02,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:02,587 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2024-10-13 11:02:02,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:02:02,588 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2024-10-13 11:02:02,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 11:02:02,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:02,588 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:02,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 11:02:02,589 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:02:02,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:02,589 INFO L85 PathProgramCache]: Analyzing trace with hash 733114940, now seen corresponding path program 1 times [2024-10-13 11:02:02,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:02,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600060654] [2024-10-13 11:02:02,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:02,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:02,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:02:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:02,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:02:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:02,697 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 11:02:02,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:02,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600060654] [2024-10-13 11:02:02,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600060654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:02,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:02,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 11:02:02,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911706442] [2024-10-13 11:02:02,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:02,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:02:02,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:02,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:02:02,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:02:02,700 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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-10-13 11:02:02,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:02,783 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2024-10-13 11:02:02,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:02:02,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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 34 [2024-10-13 11:02:02,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:02,784 INFO L225 Difference]: With dead ends: 68 [2024-10-13 11:02:02,785 INFO L226 Difference]: Without dead ends: 68 [2024-10-13 11:02:02,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 11:02:02,785 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 51 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:02,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 134 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:02,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-13 11:02:02,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-13 11:02:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 64 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2024-10-13 11:02:02,790 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 34 [2024-10-13 11:02:02,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:02,790 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2024-10-13 11:02:02,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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-10-13 11:02:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2024-10-13 11:02:02,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 11:02:02,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:02,792 INFO L215 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] [2024-10-13 11:02:02,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 11:02:02,792 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:02:02,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:02,792 INFO L85 PathProgramCache]: Analyzing trace with hash 733114885, now seen corresponding path program 1 times [2024-10-13 11:02:02,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:02,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041221300] [2024-10-13 11:02:02,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:02,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:03,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:02:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:03,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:02:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:02:03,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:03,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041221300] [2024-10-13 11:02:03,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041221300] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:03,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921212471] [2024-10-13 11:02:03,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:03,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:03,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:03,524 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:02:03,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 11:02:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:03,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-10-13 11:02:03,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:03,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:02:03,814 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:02:03,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 11:02:03,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:02:03,912 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:02:03,912 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-13 11:02:04,034 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:02:04,035 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-13 11:02:04,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:04,100 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 37 treesize of output 17 [2024-10-13 11:02:04,155 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 25 treesize of output 13 [2024-10-13 11:02:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 11:02:04,159 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:08,362 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1614 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1614) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2024-10-13 11:02:08,372 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1614 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1614) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2024-10-13 11:02:08,385 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1614 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1614) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2024-10-13 11:02:08,398 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-10-13 11:02:08,398 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 28 [2024-10-13 11:02:08,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:02:08,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2024-10-13 11:02:08,478 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 236 treesize of output 200 [2024-10-13 11:02:08,489 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 155 treesize of output 147 [2024-10-13 11:02:08,496 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 147 treesize of output 135 [2024-10-13 11:02:08,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921212471] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:08,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:02:08,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 30 [2024-10-13 11:02:08,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160508130] [2024-10-13 11:02:08,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:08,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-13 11:02:08,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:08,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-13 11:02:08,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1008, Unknown=21, NotChecked=198, Total=1332 [2024-10-13 11:02:08,607 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 31 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 11:02:09,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:09,082 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2024-10-13 11:02:09,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 11:02:09,083 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2024-10-13 11:02:09,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:09,083 INFO L225 Difference]: With dead ends: 67 [2024-10-13 11:02:09,084 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 11:02:09,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=150, Invalid=1399, Unknown=23, NotChecked=234, Total=1806 [2024-10-13 11:02:09,085 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 53 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:09,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 696 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 11:02:09,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 11:02:09,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-13 11:02:09,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 51 states have (on average 1.392156862745098) internal successors, (71), 63 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:09,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2024-10-13 11:02:09,087 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 34 [2024-10-13 11:02:09,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:09,088 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2024-10-13 11:02:09,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 11:02:09,088 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2024-10-13 11:02:09,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 11:02:09,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:09,089 INFO L215 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] [2024-10-13 11:02:09,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-13 11:02:09,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:09,290 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:02:09,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:09,290 INFO L85 PathProgramCache]: Analyzing trace with hash 733114886, now seen corresponding path program 1 times [2024-10-13 11:02:09,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:09,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209609984] [2024-10-13 11:02:09,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:09,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:10,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:02:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:10,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:02:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:02:10,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:10,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209609984] [2024-10-13 11:02:10,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209609984] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:10,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042541663] [2024-10-13 11:02:10,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:10,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:10,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:10,454 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:02:10,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 11:02:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:10,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-10-13 11:02:10,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:10,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 11:02:10,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:02:10,951 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:02:10,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 11:02:10,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 11:02:11,038 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 15 treesize of output 1 [2024-10-13 11:02:11,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:02:11,096 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:02:11,096 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-13 11:02:11,106 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 24 treesize of output 11 [2024-10-13 11:02:11,262 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:02:11,262 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 58 [2024-10-13 11:02:11,270 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 48 treesize of output 31 [2024-10-13 11:02:11,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:11,402 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 16 [2024-10-13 11:02:11,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:11,411 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 37 treesize of output 17 [2024-10-13 11:02:11,485 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 25 treesize of output 13 [2024-10-13 11:02:11,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-10-13 11:02:11,541 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:02:11,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:12,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:02:12,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 189 [2024-10-13 11:02:12,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:02:12,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 141 [2024-10-13 11:02:12,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 790 treesize of output 702 [2024-10-13 11:02:12,393 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 1918 treesize of output 1810 [2024-10-13 11:02:12,428 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 532 treesize of output 516 [2024-10-13 11:02:12,440 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 516 treesize of output 500 [2024-10-13 11:02:12,466 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 500 treesize of output 466 [2024-10-13 11:02:12,476 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 466 treesize of output 454 [2024-10-13 11:02:12,486 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 454 treesize of output 448 [2024-10-13 11:02:12,497 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 448 treesize of output 444 [2024-10-13 11:02:12,507 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 444 treesize of output 438 [2024-10-13 11:02:13,441 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:02:13,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042541663] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:02:13,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:02:13,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 54 [2024-10-13 11:02:13,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109192421] [2024-10-13 11:02:13,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:13,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-10-13 11:02:13,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:13,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-10-13 11:02:13,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2784, Unknown=6, NotChecked=0, Total=2970 [2024-10-13 11:02:13,444 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 55 states, 48 states have (on average 1.8333333333333333) internal successors, (88), 46 states have internal predecessors, (88), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-13 11:02:14,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:14,724 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2024-10-13 11:02:14,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 11:02:14,724 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 48 states have (on average 1.8333333333333333) internal successors, (88), 46 states have internal predecessors, (88), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2024-10-13 11:02:14,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:14,725 INFO L225 Difference]: With dead ends: 66 [2024-10-13 11:02:14,725 INFO L226 Difference]: Without dead ends: 66 [2024-10-13 11:02:14,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=269, Invalid=3757, Unknown=6, NotChecked=0, Total=4032 [2024-10-13 11:02:14,726 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 70 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:14,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1034 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 11:02:14,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-13 11:02:14,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-10-13 11:02:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 60 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2024-10-13 11:02:14,729 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 34 [2024-10-13 11:02:14,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:14,729 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2024-10-13 11:02:14,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 48 states have (on average 1.8333333333333333) internal successors, (88), 46 states have internal predecessors, (88), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-13 11:02:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2024-10-13 11:02:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-13 11:02:14,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:14,730 INFO L215 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] [2024-10-13 11:02:14,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-13 11:02:14,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:14,930 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:02:14,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:14,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1250138464, now seen corresponding path program 1 times [2024-10-13 11:02:14,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:14,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928193965] [2024-10-13 11:02:14,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:14,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:15,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:02:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:15,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:02:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:15,048 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 11:02:15,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:15,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928193965] [2024-10-13 11:02:15,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928193965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:15,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:15,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:02:15,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078501828] [2024-10-13 11:02:15,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:15,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 11:02:15,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:15,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 11:02:15,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:02:15,051 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-10-13 11:02:15,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:15,144 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2024-10-13 11:02:15,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:02:15,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 35 [2024-10-13 11:02:15,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:15,146 INFO L225 Difference]: With dead ends: 67 [2024-10-13 11:02:15,146 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 11:02:15,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:02:15,146 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 49 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:15,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 147 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:15,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 11:02:15,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2024-10-13 11:02:15,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.346938775510204) internal successors, (66), 60 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:15,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2024-10-13 11:02:15,149 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 35 [2024-10-13 11:02:15,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:15,149 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2024-10-13 11:02:15,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-10-13 11:02:15,150 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2024-10-13 11:02:15,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-13 11:02:15,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:15,150 INFO L215 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] [2024-10-13 11:02:15,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 11:02:15,150 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:02:15,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:15,151 INFO L85 PathProgramCache]: Analyzing trace with hash 320066870, now seen corresponding path program 1 times [2024-10-13 11:02:15,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:15,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329936691] [2024-10-13 11:02:15,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:15,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:16,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:02:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:16,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:02:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:16,516 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:02:16,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:16,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329936691] [2024-10-13 11:02:16,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329936691] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:16,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375595664] [2024-10-13 11:02:16,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:16,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:16,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:16,519 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:02:16,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-13 11:02:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:16,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-10-13 11:02:16,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:16,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:02:16,836 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:02:16,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 11:02:16,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:02:16,980 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-13 11:02:16,981 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2024-10-13 11:02:17,160 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2024-10-13 11:02:17,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 64 [2024-10-13 11:02:17,162 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 5 treesize of output 3 [2024-10-13 11:02:17,166 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 25 treesize of output 17 [2024-10-13 11:02:17,169 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 34 treesize of output 21 [2024-10-13 11:02:17,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:17,296 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 37 treesize of output 21 [2024-10-13 11:02:17,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:17,306 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 45 treesize of output 25 [2024-10-13 11:02:17,314 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 26 treesize of output 21 [2024-10-13 11:02:17,482 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 33 treesize of output 21 [2024-10-13 11:02:17,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-13 11:02:17,557 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:02:17,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:17,698 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1991 Int) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1994 Int)) (= (+ (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1992) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_1991)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_1994)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))) is different from false [2024-10-13 11:02:17,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:02:17,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2024-10-13 11:02:17,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:02:17,808 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 79 treesize of output 78 [2024-10-13 11:02:17,815 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 29 treesize of output 18 [2024-10-13 11:02:17,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:02:17,917 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 38 treesize of output 37 [2024-10-13 11:02:17,922 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 13 treesize of output 11 [2024-10-13 11:02:18,508 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-13 11:02:18,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375595664] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:02:18,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:02:18,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 57 [2024-10-13 11:02:18,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016120719] [2024-10-13 11:02:18,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:18,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-10-13 11:02:18,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:18,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-10-13 11:02:18,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2888, Unknown=11, NotChecked=108, Total=3192 [2024-10-13 11:02:18,512 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 57 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 49 states have internal predecessors, (89), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 11:02:19,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:19,653 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2024-10-13 11:02:19,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 11:02:19,654 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 49 states have internal predecessors, (89), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 37 [2024-10-13 11:02:19,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:19,654 INFO L225 Difference]: With dead ends: 64 [2024-10-13 11:02:19,655 INFO L226 Difference]: Without dead ends: 64 [2024-10-13 11:02:19,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1137 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=326, Invalid=4497, Unknown=11, NotChecked=136, Total=4970 [2024-10-13 11:02:19,656 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 90 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:19,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 951 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 762 Invalid, 0 Unknown, 62 Unchecked, 0.5s Time] [2024-10-13 11:02:19,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-13 11:02:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-13 11:02:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 60 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2024-10-13 11:02:19,659 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 37 [2024-10-13 11:02:19,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:19,659 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2024-10-13 11:02:19,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 49 states have internal predecessors, (89), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 11:02:19,660 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2024-10-13 11:02:19,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-13 11:02:19,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:19,660 INFO L215 NwaCegarLoop]: trace histogram [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-10-13 11:02:19,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-13 11:02:19,864 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,SelfDestructingSolverStorable22 [2024-10-13 11:02:19,865 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:02:19,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:19,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1199132929, now seen corresponding path program 1 times [2024-10-13 11:02:19,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:19,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887369858] [2024-10-13 11:02:19,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:19,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:20,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:02:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:20,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:02:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:20,598 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 11:02:20,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:20,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887369858] [2024-10-13 11:02:20,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887369858] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:20,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127643273] [2024-10-13 11:02:20,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:20,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:20,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:20,601 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:02:20,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-13 11:02:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:20,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-13 11:02:20,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:20,895 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 17 treesize of output 13 [2024-10-13 11:02:21,027 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 12 [2024-10-13 11:02:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 11:02:21,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:21,135 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 38 treesize of output 32 [2024-10-13 11:02:21,165 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 11:02:21,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127643273] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:02:21,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:02:21,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 10] total 28 [2024-10-13 11:02:21,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132899316] [2024-10-13 11:02:21,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:21,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-13 11:02:21,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:21,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-13 11:02:21,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2024-10-13 11:02:21,167 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 28 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 26 states have internal predecessors, (75), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 11:02:21,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:21,657 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2024-10-13 11:02:21,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 11:02:21,658 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 26 states have internal predecessors, (75), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2024-10-13 11:02:21,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:21,658 INFO L225 Difference]: With dead ends: 68 [2024-10-13 11:02:21,658 INFO L226 Difference]: Without dead ends: 68 [2024-10-13 11:02:21,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2024-10-13 11:02:21,659 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 89 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:21,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 793 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 11:02:21,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-13 11:02:21,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2024-10-13 11:02:21,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:21,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2024-10-13 11:02:21,661 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 41 [2024-10-13 11:02:21,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:21,662 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2024-10-13 11:02:21,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 26 states have internal predecessors, (75), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 11:02:21,662 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2024-10-13 11:02:21,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-13 11:02:21,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:21,662 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 11:02:21,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-13 11:02:21,863 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,SelfDestructingSolverStorable23 [2024-10-13 11:02:21,863 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:02:21,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:21,863 INFO L85 PathProgramCache]: Analyzing trace with hash 212336405, now seen corresponding path program 2 times [2024-10-13 11:02:21,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:21,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904061462] [2024-10-13 11:02:21,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:21,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:21,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:02:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:21,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:02:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:22,006 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-13 11:02:22,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:22,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904061462] [2024-10-13 11:02:22,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904061462] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:22,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317612760] [2024-10-13 11:02:22,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 11:02:22,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:22,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:22,009 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:02:22,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-13 11:02:22,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 11:02:22,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:02:22,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:02:22,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-13 11:02:22,311 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:22,377 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-13 11:02:22,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317612760] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:02:22,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:02:22,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2024-10-13 11:02:22,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192903337] [2024-10-13 11:02:22,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:22,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 11:02:22,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:22,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 11:02:22,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:02:22,381 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 11:02:22,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:22,477 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2024-10-13 11:02:22,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:02:22,478 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2024-10-13 11:02:22,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:22,479 INFO L225 Difference]: With dead ends: 59 [2024-10-13 11:02:22,479 INFO L226 Difference]: Without dead ends: 59 [2024-10-13 11:02:22,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-13 11:02:22,479 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 65 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:22,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 172 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:22,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-13 11:02:22,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-13 11:02:22,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2024-10-13 11:02:22,485 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 43 [2024-10-13 11:02:22,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:22,486 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2024-10-13 11:02:22,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 11:02:22,486 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2024-10-13 11:02:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-13 11:02:22,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:22,487 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:22,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-13 11:02:22,687 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,SelfDestructingSolverStorable24 [2024-10-13 11:02:22,688 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:02:22,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:22,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1317040732, now seen corresponding path program 1 times [2024-10-13 11:02:22,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:22,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602330882] [2024-10-13 11:02:22,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:22,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:22,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:02:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:22,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:02:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:22,831 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 11:02:22,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:22,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602330882] [2024-10-13 11:02:22,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602330882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:22,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:22,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 11:02:22,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82891521] [2024-10-13 11:02:22,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:22,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 11:02:22,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:22,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 11:02:22,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:02:22,834 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-10-13 11:02:22,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:22,951 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2024-10-13 11:02:22,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:02:22,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 43 [2024-10-13 11:02:22,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:22,952 INFO L225 Difference]: With dead ends: 72 [2024-10-13 11:02:22,952 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 11:02:22,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:02:22,953 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 18 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:22,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 121 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:22,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 11:02:22,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2024-10-13 11:02:22,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 58 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:22,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2024-10-13 11:02:22,956 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 43 [2024-10-13 11:02:22,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:22,957 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2024-10-13 11:02:22,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-10-13 11:02:22,957 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-10-13 11:02:22,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-13 11:02:22,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:22,958 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:22,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-13 11:02:22,958 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:02:22,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:22,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1317040731, now seen corresponding path program 1 times [2024-10-13 11:02:22,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:22,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164106121] [2024-10-13 11:02:22,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:22,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:23,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:02:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:23,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:02:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:23,242 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 11:02:23,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:23,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164106121] [2024-10-13 11:02:23,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164106121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:23,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:23,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 11:02:23,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475939238] [2024-10-13 11:02:23,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:23,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 11:02:23,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:23,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 11:02:23,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:02:23,244 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:02:23,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:23,398 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2024-10-13 11:02:23,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:02:23,398 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2024-10-13 11:02:23,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:23,400 INFO L225 Difference]: With dead ends: 60 [2024-10-13 11:02:23,400 INFO L226 Difference]: Without dead ends: 60 [2024-10-13 11:02:23,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:02:23,401 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:23,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 198 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:23,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-13 11:02:23,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-13 11:02:23,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 56 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:23,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2024-10-13 11:02:23,403 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 43 [2024-10-13 11:02:23,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:23,403 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2024-10-13 11:02:23,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:02:23,406 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2024-10-13 11:02:23,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 11:02:23,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:23,407 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:23,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-13 11:02:23,407 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:02:23,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:23,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2121444152, now seen corresponding path program 1 times [2024-10-13 11:02:23,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:23,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273571406] [2024-10-13 11:02:23,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:23,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:23,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:02:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:23,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:02:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 11:02:23,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:23,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273571406] [2024-10-13 11:02:23,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273571406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:23,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:23,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 11:02:23,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981666509] [2024-10-13 11:02:23,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:23,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 11:02:23,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:23,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 11:02:23,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:02:23,607 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:02:23,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:23,711 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2024-10-13 11:02:23,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:02:23,712 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2024-10-13 11:02:23,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:23,712 INFO L225 Difference]: With dead ends: 60 [2024-10-13 11:02:23,712 INFO L226 Difference]: Without dead ends: 60 [2024-10-13 11:02:23,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:02:23,713 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:23,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 198 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:23,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-13 11:02:23,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-13 11:02:23,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:23,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2024-10-13 11:02:23,715 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 44 [2024-10-13 11:02:23,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:23,716 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2024-10-13 11:02:23,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:02:23,716 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2024-10-13 11:02:23,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 11:02:23,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:23,717 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:23,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-13 11:02:23,717 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:02:23,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:23,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1339280941, now seen corresponding path program 1 times [2024-10-13 11:02:23,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:23,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207845631] [2024-10-13 11:02:23,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:23,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:23,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:02:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:23,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:02:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 11:02:23,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:23,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207845631] [2024-10-13 11:02:23,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207845631] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:23,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994384370] [2024-10-13 11:02:23,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:23,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:23,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:23,910 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:02:23,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-13 11:02:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:24,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-10-13 11:02:24,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:24,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:02:24,262 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:02:24,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 11:02:24,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:02:24,326 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:02:24,326 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-13 11:02:24,422 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:02:24,423 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-13 11:02:24,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:24,475 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 37 treesize of output 17 [2024-10-13 11:02:24,536 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 25 treesize of output 13 [2024-10-13 11:02:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 11:02:24,539 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:28,731 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2637) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2024-10-13 11:02:28,739 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-10-13 11:02:28,739 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 28 [2024-10-13 11:02:28,744 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2636 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2636))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2637)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2024-10-13 11:02:28,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:02:28,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2024-10-13 11:02:28,759 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 236 treesize of output 200 [2024-10-13 11:02:28,764 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 155 treesize of output 147 [2024-10-13 11:02:28,771 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 147 treesize of output 135 [2024-10-13 11:02:28,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994384370] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:28,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:02:28,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17] total 22 [2024-10-13 11:02:28,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248748325] [2024-10-13 11:02:28,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:28,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-13 11:02:28,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:28,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 11:02:28,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=612, Unknown=26, NotChecked=102, Total=812 [2024-10-13 11:02:28,873 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 23 states, 20 states have (on average 3.35) internal successors, (67), 19 states have internal predecessors, (67), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 11:02:29,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:29,190 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2024-10-13 11:02:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 11:02:29,191 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 3.35) internal successors, (67), 19 states have internal predecessors, (67), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2024-10-13 11:02:29,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:29,191 INFO L225 Difference]: With dead ends: 66 [2024-10-13 11:02:29,191 INFO L226 Difference]: Without dead ends: 66 [2024-10-13 11:02:29,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=95, Invalid=876, Unknown=29, NotChecked=122, Total=1122 [2024-10-13 11:02:29,192 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 27 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:29,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 326 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 11:02:29,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-13 11:02:29,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2024-10-13 11:02:29,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.24) internal successors, (62), 56 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:29,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2024-10-13 11:02:29,195 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 45 [2024-10-13 11:02:29,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:29,199 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2024-10-13 11:02:29,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 3.35) internal successors, (67), 19 states have internal predecessors, (67), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 11:02:29,199 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2024-10-13 11:02:29,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 11:02:29,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:29,200 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:29,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-13 11:02:29,400 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,SelfDestructingSolverStorable28 [2024-10-13 11:02:29,401 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:02:29,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:29,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1339280942, now seen corresponding path program 1 times [2024-10-13 11:02:29,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:29,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868377661] [2024-10-13 11:02:29,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:29,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:30,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:02:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:30,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:02:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:30,364 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 11:02:30,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:30,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868377661] [2024-10-13 11:02:30,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868377661] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:30,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587719008] [2024-10-13 11:02:30,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:30,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:30,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:30,367 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:02:30,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-13 11:02:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:30,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-10-13 11:02:30,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:30,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 11:02:30,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:02:30,840 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:02:30,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 11:02:30,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 11:02:30,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:02:30,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:02:30,987 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:02:30,987 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-13 11:02:30,991 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 24 treesize of output 11 [2024-10-13 11:02:31,155 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:02:31,156 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-13 11:02:31,161 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 24 treesize of output 11 [2024-10-13 11:02:31,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:31,226 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 37 treesize of output 17 [2024-10-13 11:02:31,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:31,230 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-10-13 11:02:31,357 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 25 treesize of output 13 [2024-10-13 11:02:31,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-13 11:02:31,390 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 11:02:31,390 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:32,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:02:32,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-10-13 11:02:32,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:02:32,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-10-13 11:02:32,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 54 treesize of output 46 [2024-10-13 11:02:32,057 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 130 treesize of output 118 [2024-10-13 11:02:32,064 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 28 treesize of output 24 [2024-10-13 11:02:32,066 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 48 treesize of output 44 [2024-10-13 11:02:32,070 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 22 treesize of output 20 [2024-10-13 11:02:32,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:02:32,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-10-13 11:02:32,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:02:32,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-10-13 11:02:32,101 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:02:32,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 74 treesize of output 50 [2024-10-13 11:02:32,106 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:02:32,106 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:02:32,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 12 [2024-10-13 11:02:32,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587719008] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:32,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:02:32,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 39 [2024-10-13 11:02:32,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138616675] [2024-10-13 11:02:32,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:32,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-13 11:02:32,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:32,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-13 11:02:32,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2370, Unknown=5, NotChecked=0, Total=2550 [2024-10-13 11:02:32,324 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 40 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 34 states have internal predecessors, (76), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 11:02:32,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:32,860 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2024-10-13 11:02:32,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 11:02:32,861 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 34 states have internal predecessors, (76), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2024-10-13 11:02:32,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:32,861 INFO L225 Difference]: With dead ends: 61 [2024-10-13 11:02:32,862 INFO L226 Difference]: Without dead ends: 61 [2024-10-13 11:02:32,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=216, Invalid=2859, Unknown=5, NotChecked=0, Total=3080 [2024-10-13 11:02:32,864 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 34 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:32,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 506 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 11:02:32,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-13 11:02:32,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-13 11:02:32,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 57 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:32,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2024-10-13 11:02:32,870 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 45 [2024-10-13 11:02:32,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:32,870 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2024-10-13 11:02:32,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 34 states have internal predecessors, (76), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 11:02:32,871 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-10-13 11:02:32,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 11:02:32,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:32,871 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:32,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-13 11:02:33,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:33,072 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:02:33,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:33,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1431965172, now seen corresponding path program 1 times [2024-10-13 11:02:33,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:33,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462264386] [2024-10-13 11:02:33,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:33,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:33,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:02:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:33,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:02:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:33,241 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 11:02:33,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:33,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462264386] [2024-10-13 11:02:33,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462264386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:33,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:33,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 11:02:33,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380076900] [2024-10-13 11:02:33,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:33,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 11:02:33,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:33,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 11:02:33,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:02:33,244 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 10 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:02:33,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:33,394 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2024-10-13 11:02:33,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:02:33,394 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2024-10-13 11:02:33,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:33,395 INFO L225 Difference]: With dead ends: 60 [2024-10-13 11:02:33,395 INFO L226 Difference]: Without dead ends: 60 [2024-10-13 11:02:33,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:02:33,396 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:33,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 162 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:33,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-13 11:02:33,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-13 11:02:33,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:33,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2024-10-13 11:02:33,398 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 46 [2024-10-13 11:02:33,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:33,399 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-10-13 11:02:33,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:02:33,399 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2024-10-13 11:02:33,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-13 11:02:33,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:33,399 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:33,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-13 11:02:33,400 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:02:33,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:33,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1441139923, now seen corresponding path program 1 times [2024-10-13 11:02:33,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:33,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905876848] [2024-10-13 11:02:33,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:33,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:34,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:02:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:34,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:02:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:34,159 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:02:34,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:34,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905876848] [2024-10-13 11:02:34,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905876848] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:34,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201233402] [2024-10-13 11:02:34,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:34,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:34,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:34,161 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:02:34,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-13 11:02:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:34,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-10-13 11:02:34,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:34,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:02:34,539 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 5 treesize of output 3 [2024-10-13 11:02:34,619 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:02:34,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 11:02:34,694 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 15 treesize of output 1 [2024-10-13 11:02:34,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:02:34,753 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:02:34,753 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-13 11:02:34,758 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 24 treesize of output 11 [2024-10-13 11:02:34,853 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 15 treesize of output 7 [2024-10-13 11:02:34,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:34,898 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 37 treesize of output 17 [2024-10-13 11:02:34,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:34,986 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 37 treesize of output 17 [2024-10-13 11:02:35,081 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 25 treesize of output 13 [2024-10-13 11:02:35,123 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:02:35,123 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:35,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:02:35,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 32 [2024-10-13 11:02:35,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:02:35,672 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 146 treesize of output 144 [2024-10-13 11:02:35,680 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 174 treesize of output 166 [2024-10-13 11:02:35,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:02:35,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-10-13 11:02:35,704 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 29 treesize of output 21 [2024-10-13 11:02:35,711 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 11 treesize of output 9 [2024-10-13 11:02:35,795 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 41 treesize of output 35 [2024-10-13 11:02:36,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201233402] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:36,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:02:36,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 37 [2024-10-13 11:02:36,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797480179] [2024-10-13 11:02:36,009 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:36,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-13 11:02:36,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:36,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-13 11:02:36,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2188, Unknown=0, NotChecked=0, Total=2352 [2024-10-13 11:02:36,010 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 38 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 11:02:36,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:36,566 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2024-10-13 11:02:36,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 11:02:36,567 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2024-10-13 11:02:36,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:36,567 INFO L225 Difference]: With dead ends: 61 [2024-10-13 11:02:36,567 INFO L226 Difference]: Without dead ends: 61 [2024-10-13 11:02:36,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=249, Invalid=3173, Unknown=0, NotChecked=0, Total=3422 [2024-10-13 11:02:36,568 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 71 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:36,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 328 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 11:02:36,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-13 11:02:36,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-13 11:02:36,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 57 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:36,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2024-10-13 11:02:36,571 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 47 [2024-10-13 11:02:36,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:36,571 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2024-10-13 11:02:36,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 11:02:36,571 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2024-10-13 11:02:36,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-13 11:02:36,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:36,572 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:36,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-13 11:02:36,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:36,772 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:02:36,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:36,773 INFO L85 PathProgramCache]: Analyzing trace with hash -2059087221, now seen corresponding path program 1 times [2024-10-13 11:02:36,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:36,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453060543] [2024-10-13 11:02:36,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:36,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:37,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:02:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:37,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:02:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-13 11:02:37,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:37,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453060543] [2024-10-13 11:02:37,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453060543] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:37,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982038160] [2024-10-13 11:02:37,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:37,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:37,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:37,446 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:02:37,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-13 11:02:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:37,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-10-13 11:02:37,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:37,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:02:37,759 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:02:37,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 11:02:37,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:02:37,845 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:02:37,845 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-10-13 11:02:37,952 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:02:37,952 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-10-13 11:02:37,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:37,988 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 28 treesize of output 12 [2024-10-13 11:02:38,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:02:38,043 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 16 treesize of output 16 [2024-10-13 11:02:38,096 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:02:38,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:38,256 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3150 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_69| Int) (v_ArrVal_3148 (Array Int Int))) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_3148) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_69| 4) v_ArrVal_3150) 0) |c_ULTIMATE.start_main_~s~0#1.base|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_69| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-10-13 11:02:38,270 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3150 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_69| Int) (v_ArrVal_3148 (Array Int Int))) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_3148) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_69| 4) v_ArrVal_3150) 0) |c_ULTIMATE.start_main_~s~0#1.base|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_69| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-10-13 11:02:38,282 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3150 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_69| Int) (v_ArrVal_3148 (Array Int Int))) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3148) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_69| 4) v_ArrVal_3150) 0) |c_ULTIMATE.start_main_~s~0#1.base|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_69| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-10-13 11:02:38,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:02:38,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2024-10-13 11:02:38,366 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 161 treesize of output 149 [2024-10-13 11:02:38,372 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 108 treesize of output 104 [2024-10-13 11:02:38,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:02:38,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 124 [2024-10-13 11:02:38,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:02:38,397 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 124 treesize of output 127 [2024-10-13 11:02:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 6 not checked. [2024-10-13 11:02:38,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982038160] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:02:38,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:02:38,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 21] total 45 [2024-10-13 11:02:38,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19022191] [2024-10-13 11:02:38,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:38,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-13 11:02:38,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:38,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-13 11:02:38,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1580, Unknown=16, NotChecked=246, Total=1980 [2024-10-13 11:02:38,803 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 45 states, 41 states have (on average 2.341463414634146) internal successors, (96), 38 states have internal predecessors, (96), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-13 11:02:39,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:39,434 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2024-10-13 11:02:39,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 11:02:39,434 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 2.341463414634146) internal successors, (96), 38 states have internal predecessors, (96), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 49 [2024-10-13 11:02:39,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:39,435 INFO L225 Difference]: With dead ends: 59 [2024-10-13 11:02:39,435 INFO L226 Difference]: Without dead ends: 59 [2024-10-13 11:02:39,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=180, Invalid=2168, Unknown=16, NotChecked=288, Total=2652 [2024-10-13 11:02:39,436 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 58 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:39,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 479 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 816 Invalid, 0 Unknown, 145 Unchecked, 0.4s Time] [2024-10-13 11:02:39,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-13 11:02:39,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2024-10-13 11:02:39,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:02:39,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2024-10-13 11:02:39,439 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 49 [2024-10-13 11:02:39,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:39,439 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2024-10-13 11:02:39,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 2.341463414634146) internal successors, (96), 38 states have internal predecessors, (96), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-13 11:02:39,440 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2024-10-13 11:02:39,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-13 11:02:39,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:39,440 INFO L215 NwaCegarLoop]: trace histogram [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, 1] [2024-10-13 11:02:39,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-13 11:02:39,640 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,SelfDestructingSolverStorable32 [2024-10-13 11:02:39,641 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-13 11:02:39,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:39,641 INFO L85 PathProgramCache]: Analyzing trace with hash -506196714, now seen corresponding path program 1 times [2024-10-13 11:02:39,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:39,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319196461] [2024-10-13 11:02:39,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:39,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:40,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:02:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:40,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 11:02:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:40,680 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:02:40,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:40,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319196461] [2024-10-13 11:02:40,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319196461] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:40,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179682834] [2024-10-13 11:02:40,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:40,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:40,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:40,683 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:02:40,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-13 11:02:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:40,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-10-13 11:02:40,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:40,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:02:41,120 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:02:41,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 11:02:41,217 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 15 treesize of output 1 [2024-10-13 11:02:41,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:02:41,296 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-13 11:02:41,297 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2024-10-13 11:02:41,302 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 22 [2024-10-13 11:02:41,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:41,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:41,506 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-13 11:02:41,506 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 66 [2024-10-13 11:02:41,522 INFO L349 Elim1Store]: treesize reduction 35, result has 23.9 percent of original size [2024-10-13 11:02:41,522 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 57 treesize of output 28 [2024-10-13 11:02:41,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:41,640 INFO L349 Elim1Store]: treesize reduction 47, result has 13.0 percent of original size [2024-10-13 11:02:41,641 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 32 [2024-10-13 11:02:41,649 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 27 treesize of output 20 [2024-10-13 11:02:41,652 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 5 treesize of output 3 [2024-10-13 11:02:41,924 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2024-10-13 11:02:41,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 36 [2024-10-13 11:02:41,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:02:41,934 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 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-13 11:02:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:02:42,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:58,121 INFO L349 Elim1Store]: treesize reduction 1775, result has 46.6 percent of original size [2024-10-13 11:02:58,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 24094 treesize of output 23877 [2024-10-13 11:02:59,161 INFO L349 Elim1Store]: treesize reduction 480, result has 35.8 percent of original size [2024-10-13 11:02:59,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 30 case distinctions, treesize of input 16566 treesize of output 15954 [2024-10-13 11:03:00,718 INFO L349 Elim1Store]: treesize reduction 120, result has 45.9 percent of original size [2024-10-13 11:03:00,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 5993 treesize of output 6048 [2024-10-13 11:03:01,191 INFO L349 Elim1Store]: treesize reduction 179, result has 41.3 percent of original size [2024-10-13 11:03:01,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 5840 treesize of output 5893 [2024-10-13 11:03:01,972 INFO L349 Elim1Store]: treesize reduction 30, result has 80.8 percent of original size [2024-10-13 11:03:01,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 5715 treesize of output 5811 [2024-10-13 11:03:02,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:02,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 6417 treesize of output 6455 [2024-10-13 11:03:02,720 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 5547 treesize of output 5539 [2024-10-13 11:03:03,048 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 5539 treesize of output 5531