./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_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 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 08:05:42,563 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 08:05:42,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 08:05:42,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 08:05:42,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 08:05:42,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 08:05:42,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 08:05:42,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 08:05:42,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 08:05:42,686 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 08:05:42,688 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 08:05:42,688 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 08:05:42,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 08:05:42,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 08:05:42,689 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 08:05:42,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 08:05:42,690 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 08:05:42,691 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 08:05:42,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 08:05:42,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 08:05:42,692 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 08:05:42,692 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 08:05:42,692 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 08:05:42,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 08:05:42,693 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 08:05:42,693 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 08:05:42,693 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 08:05:42,694 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 08:05:42,694 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 08:05:42,694 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 08:05:42,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 08:05:42,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 08:05:42,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 08:05:42,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:05:42,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 08:05:42,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 08:05:42,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 08:05:42,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 08:05:42,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 08:05:42,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 08:05:42,698 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 08:05:42,698 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 08:05:42,700 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 -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2024-11-09 08:05:42,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 08:05:43,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 08:05:43,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 08:05:43,008 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 08:05:43,009 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 08:05:43,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2024-11-09 08:05:44,498 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 08:05:44,725 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 08:05:44,727 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2024-11-09 08:05:44,746 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78d575143/53469d5f7b9046db87aeb7347a771e66/FLAGea40a3624 [2024-11-09 08:05:44,764 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78d575143/53469d5f7b9046db87aeb7347a771e66 [2024-11-09 08:05:44,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 08:05:44,768 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 08:05:44,771 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 08:05:44,771 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 08:05:44,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 08:05:44,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:05:44" (1/1) ... [2024-11-09 08:05:44,781 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40de20ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:44, skipping insertion in model container [2024-11-09 08:05:44,781 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:05:44" (1/1) ... [2024-11-09 08:05:44,827 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 08:05:45,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:05:45,147 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 08:05:45,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:05:45,225 INFO L204 MainTranslator]: Completed translation [2024-11-09 08:05:45,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:45 WrapperNode [2024-11-09 08:05:45,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 08:05:45,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 08:05:45,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 08:05:45,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 08:05:45,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:45" (1/1) ... [2024-11-09 08:05:45,249 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:45" (1/1) ... [2024-11-09 08:05:45,272 INFO L138 Inliner]: procedures = 126, calls = 23, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 127 [2024-11-09 08:05:45,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 08:05:45,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 08:05:45,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 08:05:45,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 08:05:45,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:45" (1/1) ... [2024-11-09 08:05:45,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:45" (1/1) ... [2024-11-09 08:05:45,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:45" (1/1) ... [2024-11-09 08:05:45,310 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-11-09 08:05:45,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:45" (1/1) ... [2024-11-09 08:05:45,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:45" (1/1) ... [2024-11-09 08:05:45,318 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:45" (1/1) ... [2024-11-09 08:05:45,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:45" (1/1) ... [2024-11-09 08:05:45,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:45" (1/1) ... [2024-11-09 08:05:45,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:45" (1/1) ... [2024-11-09 08:05:45,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 08:05:45,327 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 08:05:45,327 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 08:05:45,327 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 08:05:45,328 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:45" (1/1) ... [2024-11-09 08:05:45,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:05:45,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:45,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 08:05:45,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 08:05:45,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 08:05:45,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 08:05:45,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 08:05:45,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 08:05:45,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 08:05:45,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 08:05:45,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 08:05:45,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 08:05:45,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 08:05:45,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 08:05:45,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 08:05:45,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 08:05:45,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 08:05:45,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 08:05:45,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 08:05:45,522 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 08:05:45,524 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 08:05:45,778 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2024-11-09 08:05:45,778 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 08:05:45,796 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 08:05:45,797 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-09 08:05:45,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:05:45 BoogieIcfgContainer [2024-11-09 08:05:45,798 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 08:05:45,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 08:05:45,801 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 08:05:45,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 08:05:45,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:05:44" (1/3) ... [2024-11-09 08:05:45,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39fbfa0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:05:45, skipping insertion in model container [2024-11-09 08:05:45,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:05:45" (2/3) ... [2024-11-09 08:05:45,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39fbfa0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:05:45, skipping insertion in model container [2024-11-09 08:05:45,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:05:45" (3/3) ... [2024-11-09 08:05:45,808 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2024-11-09 08:05:45,826 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 08:05:45,826 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-11-09 08:05:45,870 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 08:05:45,875 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;@120de732, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 08:05:45,875 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-09 08:05:45,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 45 states have (on average 1.8) internal successors, (81), 66 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:45,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 08:05:45,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:45,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 08:05:45,887 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:05:45,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:45,894 INFO L85 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2024-11-09 08:05:45,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:45,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47934022] [2024-11-09 08:05:45,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:45,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:46,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:46,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:46,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47934022] [2024-11-09 08:05:46,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47934022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:46,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:05:46,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:05:46,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306719587] [2024-11-09 08:05:46,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:46,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:05:46,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:46,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:05:46,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:05:46,217 INFO L87 Difference]: Start difference. First operand has 67 states, 45 states have (on average 1.8) internal successors, (81), 66 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:46,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:46,297 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-11-09 08:05:46,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:05:46,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 08:05:46,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:46,309 INFO L225 Difference]: With dead ends: 64 [2024-11-09 08:05:46,309 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 08:05:46,310 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-11-09 08:05:46,313 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 2 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:46,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 106 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:05:46,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 08:05:46,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-09 08:05:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 60 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:46,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2024-11-09 08:05:46,339 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 5 [2024-11-09 08:05:46,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:46,339 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2024-11-09 08:05:46,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-11-09 08:05:46,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 08:05:46,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:46,340 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 08:05:46,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 08:05:46,340 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:05:46,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:46,341 INFO L85 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2024-11-09 08:05:46,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:46,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798238616] [2024-11-09 08:05:46,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:46,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:46,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:46,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:46,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798238616] [2024-11-09 08:05:46,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798238616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:46,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:05:46,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:05:46,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490340213] [2024-11-09 08:05:46,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:46,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:05:46,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:46,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:05:46,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:05:46,484 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:46,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:46,532 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-11-09 08:05:46,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:05:46,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 08:05:46,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:46,534 INFO L225 Difference]: With dead ends: 59 [2024-11-09 08:05:46,534 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 08:05:46,534 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-11-09 08:05:46,535 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:46,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:05:46,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 08:05:46,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-09 08:05:46,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-11-09 08:05:46,547 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 5 [2024-11-09 08:05:46,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:46,548 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-11-09 08:05:46,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:46,548 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-11-09 08:05:46,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 08:05:46,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:46,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:46,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 08:05:46,549 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:05:46,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:46,550 INFO L85 PathProgramCache]: Analyzing trace with hash 231010834, now seen corresponding path program 1 times [2024-11-09 08:05:46,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:46,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077823119] [2024-11-09 08:05:46,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:46,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:46,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:46,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:46,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077823119] [2024-11-09 08:05:46,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077823119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:46,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:05:46,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:05:46,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871676990] [2024-11-09 08:05:46,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:46,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:05:46,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:46,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:05:46,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:05:46,618 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:46,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:46,636 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2024-11-09 08:05:46,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:05:46,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 08:05:46,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:46,639 INFO L225 Difference]: With dead ends: 70 [2024-11-09 08:05:46,639 INFO L226 Difference]: Without dead ends: 70 [2024-11-09 08:05:46,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:05:46,641 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 10 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:46,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 121 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:05:46,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-09 08:05:46,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2024-11-09 08:05:46,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 59 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:46,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2024-11-09 08:05:46,649 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 8 [2024-11-09 08:05:46,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:46,650 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2024-11-09 08:05:46,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:46,650 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2024-11-09 08:05:46,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 08:05:46,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:46,650 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:46,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 08:05:46,651 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:05:46,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:46,651 INFO L85 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2024-11-09 08:05:46,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:46,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370009424] [2024-11-09 08:05:46,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:46,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:46,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:46,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370009424] [2024-11-09 08:05:46,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370009424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:46,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:05:46,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 08:05:46,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246757824] [2024-11-09 08:05:46,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:46,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 08:05:46,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:46,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 08:05:46,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:05:46,790 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:46,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:46,882 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-11-09 08:05:46,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 08:05:46,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 08:05:46,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:46,884 INFO L225 Difference]: With dead ends: 59 [2024-11-09 08:05:46,887 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 08:05:46,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:05:46,888 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:46,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 171 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:05:46,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 08:05:46,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-09 08:05:46,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:46,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-11-09 08:05:46,896 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 9 [2024-11-09 08:05:46,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:46,898 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-11-09 08:05:46,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-11-09 08:05:46,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 08:05:46,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:46,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:46,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 08:05:46,899 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:05:46,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:46,900 INFO L85 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2024-11-09 08:05:46,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:46,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696002688] [2024-11-09 08:05:46,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:46,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:47,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:47,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:47,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696002688] [2024-11-09 08:05:47,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696002688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:47,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:05:47,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 08:05:47,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896888251] [2024-11-09 08:05:47,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:47,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 08:05:47,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:47,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 08:05:47,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:05:47,061 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:47,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:47,115 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-11-09 08:05:47,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 08:05:47,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 08:05:47,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:47,116 INFO L225 Difference]: With dead ends: 58 [2024-11-09 08:05:47,116 INFO L226 Difference]: Without dead ends: 58 [2024-11-09 08:05:47,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:05:47,117 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:47,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 182 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:05:47,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-09 08:05:47,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-09 08:05:47,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2024-11-09 08:05:47,127 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 9 [2024-11-09 08:05:47,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:47,128 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2024-11-09 08:05:47,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:47,128 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2024-11-09 08:05:47,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 08:05:47,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:47,129 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:47,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 08:05:47,129 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:05:47,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:47,132 INFO L85 PathProgramCache]: Analyzing trace with hash -806744226, now seen corresponding path program 1 times [2024-11-09 08:05:47,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:47,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030172895] [2024-11-09 08:05:47,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:47,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:47,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:47,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:47,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030172895] [2024-11-09 08:05:47,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030172895] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:47,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031719190] [2024-11-09 08:05:47,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:47,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:47,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:47,249 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:47,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 08:05:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:47,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 08:05:47,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:47,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:47,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:05:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:47,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031719190] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:05:47,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:05:47,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-09 08:05:47,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753235941] [2024-11-09 08:05:47,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:05:47,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 08:05:47,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:47,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 08:05:47,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:05:47,445 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:47,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:47,462 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2024-11-09 08:05:47,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:05:47,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 08:05:47,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:47,467 INFO L225 Difference]: With dead ends: 67 [2024-11-09 08:05:47,468 INFO L226 Difference]: Without dead ends: 67 [2024-11-09 08:05:47,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:05:47,470 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:47,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 124 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:05:47,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-09 08:05:47,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-09 08:05:47,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 66 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:47,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2024-11-09 08:05:47,480 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 17 [2024-11-09 08:05:47,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:47,480 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2024-11-09 08:05:47,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:47,481 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2024-11-09 08:05:47,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 08:05:47,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:47,482 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:47,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 08:05:47,682 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-11-09 08:05:47,683 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:05:47,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:47,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913170, now seen corresponding path program 2 times [2024-11-09 08:05:47,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:47,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722040843] [2024-11-09 08:05:47,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:47,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:47,836 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:05:47,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:47,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722040843] [2024-11-09 08:05:47,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722040843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:47,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:05:47,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 08:05:47,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577348571] [2024-11-09 08:05:47,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:47,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 08:05:47,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:47,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 08:05:47,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:05:47,838 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:47,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:47,902 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2024-11-09 08:05:47,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 08:05:47,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 08:05:47,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:47,904 INFO L225 Difference]: With dead ends: 96 [2024-11-09 08:05:47,905 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 08:05:47,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:05:47,906 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 116 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:47,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 156 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:05:47,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 08:05:47,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 70. [2024-11-09 08:05:47,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 69 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:47,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2024-11-09 08:05:47,915 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 26 [2024-11-09 08:05:47,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:47,915 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2024-11-09 08:05:47,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:47,915 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2024-11-09 08:05:47,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 08:05:47,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:47,916 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:47,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 08:05:47,916 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:05:47,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:47,916 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913225, now seen corresponding path program 1 times [2024-11-09 08:05:47,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:47,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840366836] [2024-11-09 08:05:47,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:47,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:48,087 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:05:48,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:48,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840366836] [2024-11-09 08:05:48,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840366836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:48,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:05:48,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 08:05:48,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401133464] [2024-11-09 08:05:48,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:48,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 08:05:48,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:48,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 08:05:48,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 08:05:48,090 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:48,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:48,303 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2024-11-09 08:05:48,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 08:05:48,304 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 08:05:48,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:48,304 INFO L225 Difference]: With dead ends: 73 [2024-11-09 08:05:48,304 INFO L226 Difference]: Without dead ends: 73 [2024-11-09 08:05:48,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-09 08:05:48,305 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 43 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:48,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 251 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:05:48,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-09 08:05:48,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-09 08:05:48,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.396551724137931) internal successors, (81), 72 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:48,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2024-11-09 08:05:48,313 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 26 [2024-11-09 08:05:48,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:48,313 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2024-11-09 08:05:48,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2024-11-09 08:05:48,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 08:05:48,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:48,314 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:48,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 08:05:48,317 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:05:48,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:48,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913226, now seen corresponding path program 1 times [2024-11-09 08:05:48,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:48,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83378235] [2024-11-09 08:05:48,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:48,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:48,605 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:05:48,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:48,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83378235] [2024-11-09 08:05:48,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83378235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:48,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:05:48,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 08:05:48,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276079638] [2024-11-09 08:05:48,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:48,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 08:05:48,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:48,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 08:05:48,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 08:05:48,609 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:48,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:48,808 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2024-11-09 08:05:48,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 08:05:48,809 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 08:05:48,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:48,810 INFO L225 Difference]: With dead ends: 73 [2024-11-09 08:05:48,810 INFO L226 Difference]: Without dead ends: 73 [2024-11-09 08:05:48,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-09 08:05:48,812 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 41 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:48,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 281 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:05:48,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-09 08:05:48,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-09 08:05:48,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 72 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:48,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2024-11-09 08:05:48,819 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 26 [2024-11-09 08:05:48,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:48,819 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2024-11-09 08:05:48,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:48,819 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2024-11-09 08:05:48,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 08:05:48,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:48,820 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:48,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 08:05:48,820 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:05:48,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:48,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687586, now seen corresponding path program 1 times [2024-11-09 08:05:48,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:48,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270389612] [2024-11-09 08:05:48,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:48,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:49,454 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:49,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:49,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270389612] [2024-11-09 08:05:49,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270389612] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:49,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843383166] [2024-11-09 08:05:49,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:49,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:49,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:49,457 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:49,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 08:05:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:49,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 08:05:49,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:49,629 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:05:49,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 08:05:49,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 08:05:49,933 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 31 treesize of output 13 [2024-11-09 08:05:49,951 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:49,952 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:05:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:50,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843383166] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:05:50,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:05:50,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 32 [2024-11-09 08:05:50,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981800871] [2024-11-09 08:05:50,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:05:50,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 08:05:50,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:50,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 08:05:50,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 08:05:50,281 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 33 states, 32 states have (on average 2.0625) internal successors, (66), 33 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:50,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:50,909 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2024-11-09 08:05:50,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 08:05:50,910 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.0625) internal successors, (66), 33 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-09 08:05:50,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:50,913 INFO L225 Difference]: With dead ends: 88 [2024-11-09 08:05:50,913 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 08:05:50,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=200, Invalid=1522, Unknown=0, NotChecked=0, Total=1722 [2024-11-09 08:05:50,914 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 40 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:50,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 695 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 08:05:50,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 08:05:50,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2024-11-09 08:05:50,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.380952380952381) internal successors, (87), 77 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:50,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2024-11-09 08:05:50,919 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 29 [2024-11-09 08:05:50,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:50,920 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2024-11-09 08:05:50,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.0625) internal successors, (66), 33 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2024-11-09 08:05:50,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 08:05:50,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:50,921 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:50,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 08:05:51,125 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,SelfDestructingSolverStorable9 [2024-11-09 08:05:51,126 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:05:51,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:51,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687585, now seen corresponding path program 1 times [2024-11-09 08:05:51,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:51,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141175489] [2024-11-09 08:05:51,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:51,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:52,087 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:52,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:52,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141175489] [2024-11-09 08:05:52,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141175489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:52,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522515964] [2024-11-09 08:05:52,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:52,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:52,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:52,091 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:52,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 08:05:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:52,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-09 08:05:52,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:52,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 08:05:52,399 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:05:52,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 08:05:52,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:05:52,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 08:05:52,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 08:05:52,810 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 31 treesize of output 13 [2024-11-09 08:05:52,818 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 9 treesize of output 3 [2024-11-09 08:05:52,899 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:52,899 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:05:53,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:05:53,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2024-11-09 08:05:53,755 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:53,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522515964] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:05:53,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:05:53,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 14] total 44 [2024-11-09 08:05:53,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967778931] [2024-11-09 08:05:53,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:05:53,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-09 08:05:53,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:53,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-09 08:05:53,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1850, Unknown=0, NotChecked=0, Total=1980 [2024-11-09 08:05:53,760 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 45 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:55,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:55,169 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2024-11-09 08:05:55,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 08:05:55,169 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 45 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-09 08:05:55,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:55,170 INFO L225 Difference]: With dead ends: 122 [2024-11-09 08:05:55,170 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 08:05:55,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=322, Invalid=3460, Unknown=0, NotChecked=0, Total=3782 [2024-11-09 08:05:55,172 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 130 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:55,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 945 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 08:05:55,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 08:05:55,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 86. [2024-11-09 08:05:55,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 71 states have (on average 1.380281690140845) internal successors, (98), 85 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2024-11-09 08:05:55,182 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 29 [2024-11-09 08:05:55,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:55,182 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2024-11-09 08:05:55,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 45 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:55,182 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2024-11-09 08:05:55,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 08:05:55,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:55,183 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] [2024-11-09 08:05:55,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 08:05:55,383 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-11-09 08:05:55,384 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:05:55,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:55,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1082686446, now seen corresponding path program 2 times [2024-11-09 08:05:55,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:55,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864401387] [2024-11-09 08:05:55,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:55,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:55,522 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:05:55,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:55,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864401387] [2024-11-09 08:05:55,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864401387] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:55,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666655565] [2024-11-09 08:05:55,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 08:05:55,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:55,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:55,525 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:55,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 08:05:55,655 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 08:05:55,655 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 08:05:55,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 08:05:55,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:55,700 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:05:55,700 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:05:55,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666655565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:55,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:05:55,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2024-11-09 08:05:55,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483843689] [2024-11-09 08:05:55,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:55,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:05:55,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:55,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:05:55,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:05:55,702 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:55,744 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2024-11-09 08:05:55,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 08:05:55,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-09 08:05:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:55,745 INFO L225 Difference]: With dead ends: 72 [2024-11-09 08:05:55,745 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 08:05:55,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-09 08:05:55,746 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:55,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 123 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:05:55,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 08:05:55,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-09 08:05:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:55,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2024-11-09 08:05:55,750 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 32 [2024-11-09 08:05:55,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:55,750 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2024-11-09 08:05:55,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:55,751 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2024-11-09 08:05:55,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 08:05:55,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:55,752 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:55,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 08:05:55,955 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-11-09 08:05:55,956 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:05:55,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:55,956 INFO L85 PathProgramCache]: Analyzing trace with hash -516260032, now seen corresponding path program 1 times [2024-11-09 08:05:55,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:55,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642930035] [2024-11-09 08:05:55,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:55,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:56,098 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 08:05:56,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:56,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642930035] [2024-11-09 08:05:56,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642930035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:56,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:05:56,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 08:05:56,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496363164] [2024-11-09 08:05:56,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:56,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 08:05:56,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:56,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 08:05:56,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 08:05:56,102 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:56,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:56,262 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2024-11-09 08:05:56,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 08:05:56,263 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-09 08:05:56,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:56,263 INFO L225 Difference]: With dead ends: 75 [2024-11-09 08:05:56,263 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 08:05:56,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-09 08:05:56,264 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 33 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:56,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 225 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:05:56,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 08:05:56,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-09 08:05:56,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 74 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:56,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2024-11-09 08:05:56,268 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 36 [2024-11-09 08:05:56,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:56,269 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2024-11-09 08:05:56,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:56,269 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2024-11-09 08:05:56,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 08:05:56,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:56,271 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:56,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 08:05:56,272 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:05:56,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:56,272 INFO L85 PathProgramCache]: Analyzing trace with hash -516260031, now seen corresponding path program 1 times [2024-11-09 08:05:56,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:56,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123300936] [2024-11-09 08:05:56,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:56,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:56,356 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:05:56,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:56,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123300936] [2024-11-09 08:05:56,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123300936] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:56,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632058961] [2024-11-09 08:05:56,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:56,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:56,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:56,359 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:56,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 08:05:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:56,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 08:05:56,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 08:05:56,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:05:56,582 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 08:05:56,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632058961] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:05:56,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:05:56,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-09 08:05:56,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450244442] [2024-11-09 08:05:56,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:05:56,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:05:56,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:56,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:05:56,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:05:56,585 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:56,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:56,640 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2024-11-09 08:05:56,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:05:56,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-09 08:05:56,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:56,641 INFO L225 Difference]: With dead ends: 99 [2024-11-09 08:05:56,642 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 08:05:56,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-09 08:05:56,642 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 114 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:56,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 168 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:05:56,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 08:05:56,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2024-11-09 08:05:56,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 90 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:56,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2024-11-09 08:05:56,646 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 36 [2024-11-09 08:05:56,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:56,646 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2024-11-09 08:05:56,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:56,646 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2024-11-09 08:05:56,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 08:05:56,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:56,647 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:56,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 08:05:56,847 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-11-09 08:05:56,848 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:05:56,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:56,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1215669110, now seen corresponding path program 1 times [2024-11-09 08:05:56,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:56,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139368931] [2024-11-09 08:05:56,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:56,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:56,981 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 08:05:56,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:56,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139368931] [2024-11-09 08:05:56,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139368931] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:56,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256216853] [2024-11-09 08:05:56,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:56,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:56,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:56,984 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:56,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 08:05:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:57,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 08:05:57,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:57,166 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 08:05:57,166 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:05:57,220 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 08:05:57,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256216853] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:05:57,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:05:57,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-11-09 08:05:57,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671512376] [2024-11-09 08:05:57,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:05:57,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:05:57,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:57,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:05:57,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:05:57,222 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:57,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:57,282 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2024-11-09 08:05:57,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:05:57,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-09 08:05:57,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:57,283 INFO L225 Difference]: With dead ends: 94 [2024-11-09 08:05:57,283 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 08:05:57,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-09 08:05:57,286 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 83 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:57,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 239 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:05:57,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 08:05:57,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2024-11-09 08:05:57,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.36) internal successors, (102), 85 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:57,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2024-11-09 08:05:57,289 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 37 [2024-11-09 08:05:57,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:57,290 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2024-11-09 08:05:57,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:57,290 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2024-11-09 08:05:57,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 08:05:57,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:57,291 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:57,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 08:05:57,492 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-11-09 08:05:57,492 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:05:57,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:57,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522149, now seen corresponding path program 2 times [2024-11-09 08:05:57,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:57,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191478005] [2024-11-09 08:05:57,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:57,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:57,610 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 08:05:57,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:57,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191478005] [2024-11-09 08:05:57,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191478005] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:57,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632868596] [2024-11-09 08:05:57,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 08:05:57,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:57,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:57,613 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:57,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 08:05:57,728 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 08:05:57,729 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 08:05:57,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 08:05:57,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:57,775 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 08:05:57,776 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:05:57,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632868596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:57,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:05:57,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-11-09 08:05:57,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837285938] [2024-11-09 08:05:57,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:57,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 08:05:57,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:57,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 08:05:57,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:05:57,777 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:57,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:57,813 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2024-11-09 08:05:57,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 08:05:57,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-09 08:05:57,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:57,814 INFO L225 Difference]: With dead ends: 93 [2024-11-09 08:05:57,814 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 08:05:57,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 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-11-09 08:05:57,815 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 86 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:57,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 141 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:05:57,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 08:05:57,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2024-11-09 08:05:57,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 74 states have (on average 1.337837837837838) internal successors, (99), 84 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2024-11-09 08:05:57,820 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 41 [2024-11-09 08:05:57,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:57,820 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2024-11-09 08:05:57,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:57,820 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2024-11-09 08:05:57,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 08:05:57,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:57,822 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:57,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 08:05:58,026 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-11-09 08:05:58,027 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:05:58,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:58,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522204, now seen corresponding path program 1 times [2024-11-09 08:05:58,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:58,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148703780] [2024-11-09 08:05:58,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:58,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 08:05:58,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:58,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148703780] [2024-11-09 08:05:58,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148703780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:05:58,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:05:58,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 08:05:58,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612427351] [2024-11-09 08:05:58,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:05:58,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 08:05:58,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:58,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 08:05:58,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 08:05:58,283 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:58,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:58,446 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2024-11-09 08:05:58,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 08:05:58,447 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-09 08:05:58,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:58,448 INFO L225 Difference]: With dead ends: 85 [2024-11-09 08:05:58,448 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 08:05:58,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-09 08:05:58,449 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 27 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:58,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 267 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:05:58,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 08:05:58,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-09 08:05:58,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 74 states have (on average 1.2972972972972974) internal successors, (96), 84 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:58,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2024-11-09 08:05:58,453 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 41 [2024-11-09 08:05:58,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:58,453 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2024-11-09 08:05:58,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:05:58,453 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2024-11-09 08:05:58,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 08:05:58,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:58,454 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:58,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 08:05:58,454 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:05:58,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:58,454 INFO L85 PathProgramCache]: Analyzing trace with hash -333530929, now seen corresponding path program 1 times [2024-11-09 08:05:58,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:58,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680125272] [2024-11-09 08:05:58,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:58,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:05:59,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:59,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680125272] [2024-11-09 08:05:59,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680125272] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:59,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888460535] [2024-11-09 08:05:59,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:59,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:59,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:59,336 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:59,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 08:05:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:59,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-09 08:05:59,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:59,519 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:05:59,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 08:05:59,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 08:05:59,850 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 08:05:59,850 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 42 treesize of output 41 [2024-11-09 08:05:59,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:05:59,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2024-11-09 08:06:00,023 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 31 treesize of output 13 [2024-11-09 08:06:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:06:00,030 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:06:04,247 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-09 08:06:04,248 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 21 treesize of output 20 [2024-11-09 08:06:04,419 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_930 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_930) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2024-11-09 08:06:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2024-11-09 08:06:04,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888460535] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:06:04,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:06:04,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 43 [2024-11-09 08:06:04,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621103084] [2024-11-09 08:06:04,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:06:04,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-09 08:06:04,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:04,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-09 08:06:04,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1653, Unknown=32, NotChecked=82, Total=1892 [2024-11-09 08:06:04,527 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 44 states, 43 states have (on average 2.2790697674418605) internal successors, (98), 44 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:05,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:05,656 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2024-11-09 08:06:05,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 08:06:05,657 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.2790697674418605) internal successors, (98), 44 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-09 08:06:05,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:05,660 INFO L225 Difference]: With dead ends: 99 [2024-11-09 08:06:05,660 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 08:06:05,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=253, Invalid=2910, Unknown=33, NotChecked=110, Total=3306 [2024-11-09 08:06:05,661 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 104 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:05,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1192 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1444 Invalid, 0 Unknown, 72 Unchecked, 0.7s Time] [2024-11-09 08:06:05,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 08:06:05,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2024-11-09 08:06:05,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 92 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2024-11-09 08:06:05,665 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 110 transitions. Word has length 44 [2024-11-09 08:06:05,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:05,666 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 110 transitions. [2024-11-09 08:06:05,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.2790697674418605) internal successors, (98), 44 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:05,666 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2024-11-09 08:06:05,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 08:06:05,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:05,667 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:05,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 08:06:05,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 08:06:05,872 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:06:05,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:05,872 INFO L85 PathProgramCache]: Analyzing trace with hash -333530928, now seen corresponding path program 1 times [2024-11-09 08:06:05,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:05,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665162900] [2024-11-09 08:06:05,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:05,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:07,398 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:06:07,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:07,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665162900] [2024-11-09 08:06:07,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665162900] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:06:07,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486973379] [2024-11-09 08:06:07,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:07,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:07,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:07,401 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:06:07,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 08:06:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:07,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-09 08:06:07,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:06:07,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 08:06:07,764 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:06:07,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 08:06:07,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:06:07,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 08:06:07,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 08:06:08,258 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 08:06:08,258 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 62 treesize of output 57 [2024-11-09 08:06:08,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 08:06:08,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:06:08,361 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 19 [2024-11-09 08:06:08,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:06:08,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 08:06:08,448 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 31 treesize of output 13 [2024-11-09 08:06:08,451 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 9 treesize of output 3 [2024-11-09 08:06:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 08:06:08,511 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:06:08,746 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1045 (Array Int Int))) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 1)) (not (= (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1045 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1045)))) (forall ((v_ArrVal_1045 (Array Int Int))) (or (forall ((v_ArrVal_1043 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1043)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (not (= (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1045 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1045)))))) is different from false [2024-11-09 08:06:08,896 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1041 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_1042 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1042) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))))) is different from false [2024-11-09 08:06:08,912 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1041 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_1042 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1042) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))))) is different from false [2024-11-09 08:06:08,923 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1042 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1042) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (forall ((v_ArrVal_1041 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2024-11-09 08:06:08,940 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1041 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_ArrVal_1042 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1042) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))))) is different from false [2024-11-09 08:06:09,070 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1041 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1041) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (forall ((v_ArrVal_1042 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1041) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1042) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))))))) is different from false [2024-11-09 08:06:09,092 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1042 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1041) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1042) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1)))) (forall ((v_ArrVal_1041 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1041) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1)))))) is different from false [2024-11-09 08:06:09,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:09,102 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 45 treesize of output 46 [2024-11-09 08:06:09,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:09,109 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 35 treesize of output 36 [2024-11-09 08:06:09,114 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 62 treesize of output 50 [2024-11-09 08:06:09,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78 [2024-11-09 08:06:09,120 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 15 treesize of output 11 [2024-11-09 08:06:09,122 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 7 [2024-11-09 08:06:09,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:09,129 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 22 treesize of output 23 [2024-11-09 08:06:09,131 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:06:09,133 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 22 treesize of output 10 [2024-11-09 08:06:09,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:09,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2024-11-09 08:06:09,678 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 9 not checked. [2024-11-09 08:06:09,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486973379] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:06:09,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:06:09,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 21] total 60 [2024-11-09 08:06:09,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556246466] [2024-11-09 08:06:09,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:06:09,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-11-09 08:06:09,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:09,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-11-09 08:06:09,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2672, Unknown=24, NotChecked=770, Total=3660 [2024-11-09 08:06:09,682 INFO L87 Difference]: Start difference. First operand 93 states and 110 transitions. Second operand has 61 states, 60 states have (on average 2.033333333333333) internal successors, (122), 61 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:11,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:11,216 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2024-11-09 08:06:11,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 08:06:11,217 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.033333333333333) internal successors, (122), 61 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-09 08:06:11,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:11,217 INFO L225 Difference]: With dead ends: 99 [2024-11-09 08:06:11,217 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 08:06:11,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=321, Invalid=3843, Unknown=24, NotChecked=924, Total=5112 [2024-11-09 08:06:11,219 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 104 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 498 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:11,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1334 Invalid, 1879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1372 Invalid, 0 Unknown, 498 Unchecked, 0.8s Time] [2024-11-09 08:06:11,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 08:06:11,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2024-11-09 08:06:11,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 91 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2024-11-09 08:06:11,221 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 44 [2024-11-09 08:06:11,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:11,222 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2024-11-09 08:06:11,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.033333333333333) internal successors, (122), 61 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:11,222 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2024-11-09 08:06:11,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 08:06:11,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:11,222 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:11,239 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-11-09 08:06:11,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:11,423 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:06:11,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:11,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1958848316, now seen corresponding path program 2 times [2024-11-09 08:06:11,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:11,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977031239] [2024-11-09 08:06:11,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:11,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 08:06:11,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:11,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977031239] [2024-11-09 08:06:11,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977031239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:06:11,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:06:11,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:06:11,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441791627] [2024-11-09 08:06:11,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:06:11,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:06:11,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:11,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:06:11,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:06:11,532 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:11,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:11,577 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2024-11-09 08:06:11,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 08:06:11,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-09 08:06:11,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:11,578 INFO L225 Difference]: With dead ends: 78 [2024-11-09 08:06:11,578 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 08:06:11,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:06:11,579 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 52 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:11,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 153 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:06:11,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 08:06:11,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-09 08:06:11,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:11,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2024-11-09 08:06:11,581 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 47 [2024-11-09 08:06:11,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:11,581 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2024-11-09 08:06:11,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:11,583 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2024-11-09 08:06:11,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 08:06:11,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:11,584 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:11,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 08:06:11,584 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:06:11,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:11,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1682989806, now seen corresponding path program 1 times [2024-11-09 08:06:11,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:11,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881227868] [2024-11-09 08:06:11,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:11,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:13,074 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:06:13,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:13,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881227868] [2024-11-09 08:06:13,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881227868] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:06:13,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472771632] [2024-11-09 08:06:13,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:13,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:13,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:13,076 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:06:13,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 08:06:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:13,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-11-09 08:06:13,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:06:13,318 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:06:13,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2024-11-09 08:06:13,370 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 08:06:13,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 08:06:13,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 3 [2024-11-09 08:06:13,873 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 08:06:13,873 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 73 [2024-11-09 08:06:13,877 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 29 treesize of output 19 [2024-11-09 08:06:13,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2024-11-09 08:06:14,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:06:14,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 27 [2024-11-09 08:06:14,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-11-09 08:06:14,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:06:14,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-11-09 08:06:14,190 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 39 treesize of output 21 [2024-11-09 08:06:14,193 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 23 treesize of output 11 [2024-11-09 08:06:14,363 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:06:14,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:06:14,547 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1209 Int) (v_ArrVal_1212 (Array Int Int)) (v_ArrVal_1211 (Array Int Int))) (or (not (= v_ArrVal_1212 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1212 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1211) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1209)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1212) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1)))) is different from false [2024-11-09 08:06:14,630 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1211 (Array Int Int))) (= (+ (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1211) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))) is different from false [2024-11-09 08:06:14,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:14,643 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-11-09 08:06:14,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:14,654 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 83 treesize of output 86 [2024-11-09 08:06:14,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2024-11-09 08:06:14,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:14,929 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 50 treesize of output 43 [2024-11-09 08:06:14,934 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 17 treesize of output 13 [2024-11-09 08:06:15,340 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-09 08:06:15,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472771632] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:06:15,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:06:15,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25, 25] total 71 [2024-11-09 08:06:15,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373693758] [2024-11-09 08:06:15,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:06:15,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-11-09 08:06:15,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:15,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-11-09 08:06:15,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=4437, Unknown=14, NotChecked=270, Total=4970 [2024-11-09 08:06:15,343 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 71 states, 71 states have (on average 1.9154929577464788) internal successors, (136), 71 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:17,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:17,765 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2024-11-09 08:06:17,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-09 08:06:17,766 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.9154929577464788) internal successors, (136), 71 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-09 08:06:17,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:17,766 INFO L225 Difference]: With dead ends: 84 [2024-11-09 08:06:17,766 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 08:06:17,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2358 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=688, Invalid=9206, Unknown=14, NotChecked=394, Total=10302 [2024-11-09 08:06:17,769 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 136 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 2017 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:17,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1369 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2017 Invalid, 0 Unknown, 164 Unchecked, 0.9s Time] [2024-11-09 08:06:17,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 08:06:17,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2024-11-09 08:06:17,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.1549295774647887) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:17,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-11-09 08:06:17,771 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 50 [2024-11-09 08:06:17,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:17,771 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-11-09 08:06:17,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 1.9154929577464788) internal successors, (136), 71 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:17,771 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-11-09 08:06:17,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 08:06:17,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:17,772 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:17,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 08:06:17,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-09 08:06:17,977 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:06:17,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:17,977 INFO L85 PathProgramCache]: Analyzing trace with hash -375253395, now seen corresponding path program 1 times [2024-11-09 08:06:17,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:17,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332859458] [2024-11-09 08:06:17,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:17,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:06:18,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:18,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332859458] [2024-11-09 08:06:18,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332859458] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:06:18,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959618461] [2024-11-09 08:06:18,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:18,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:18,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:18,429 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:06:18,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 08:06:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:18,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 08:06:18,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:06:18,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 08:06:18,847 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 24 treesize of output 12 [2024-11-09 08:06:18,940 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 08:06:18,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:06:18,976 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 36 treesize of output 32 [2024-11-09 08:06:19,012 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 08:06:19,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959618461] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:06:19,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:06:19,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 23 [2024-11-09 08:06:19,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222870838] [2024-11-09 08:06:19,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:06:19,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 08:06:19,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:19,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 08:06:19,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2024-11-09 08:06:19,014 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 23 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 23 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:19,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:19,395 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2024-11-09 08:06:19,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 08:06:19,396 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 23 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-09 08:06:19,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:19,396 INFO L225 Difference]: With dead ends: 84 [2024-11-09 08:06:19,396 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 08:06:19,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=1002, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 08:06:19,397 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 83 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:19,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 725 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:06:19,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 08:06:19,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2024-11-09 08:06:19,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 75 states have (on average 1.1466666666666667) internal successors, (86), 81 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2024-11-09 08:06:19,399 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 57 [2024-11-09 08:06:19,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:19,400 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2024-11-09 08:06:19,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 23 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:19,400 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2024-11-09 08:06:19,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 08:06:19,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:19,402 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:19,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 08:06:19,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-09 08:06:19,604 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:06:19,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:19,604 INFO L85 PathProgramCache]: Analyzing trace with hash 187254194, now seen corresponding path program 1 times [2024-11-09 08:06:19,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:19,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768130943] [2024-11-09 08:06:19,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:19,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:19,775 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 08:06:19,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:19,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768130943] [2024-11-09 08:06:19,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768130943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:06:19,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:06:19,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 08:06:19,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157999541] [2024-11-09 08:06:19,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:06:19,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 08:06:19,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:19,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 08:06:19,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 08:06:19,777 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:19,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:19,944 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2024-11-09 08:06:19,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 08:06:19,944 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-09 08:06:19,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:19,945 INFO L225 Difference]: With dead ends: 83 [2024-11-09 08:06:19,945 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 08:06:19,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 08:06:19,946 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 15 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:19,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 180 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:06:19,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 08:06:19,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-09 08:06:19,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 77 states have (on average 1.155844155844156) internal successors, (89), 82 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:19,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2024-11-09 08:06:19,949 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 59 [2024-11-09 08:06:19,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:19,949 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2024-11-09 08:06:19,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:19,949 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2024-11-09 08:06:19,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 08:06:19,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:19,950 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:19,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 08:06:19,950 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:06:19,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:19,950 INFO L85 PathProgramCache]: Analyzing trace with hash 187254195, now seen corresponding path program 1 times [2024-11-09 08:06:19,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:19,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861988011] [2024-11-09 08:06:19,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:19,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:20,198 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 08:06:20,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:20,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861988011] [2024-11-09 08:06:20,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861988011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:06:20,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:06:20,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 08:06:20,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575934410] [2024-11-09 08:06:20,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:06:20,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 08:06:20,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:20,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 08:06:20,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 08:06:20,202 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:20,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:20,385 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2024-11-09 08:06:20,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 08:06:20,386 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-09 08:06:20,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:20,386 INFO L225 Difference]: With dead ends: 85 [2024-11-09 08:06:20,386 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 08:06:20,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 08:06:20,387 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:20,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 212 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:06:20,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 08:06:20,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-09 08:06:20,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 79 states have (on average 1.139240506329114) internal successors, (90), 84 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:20,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-11-09 08:06:20,390 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 59 [2024-11-09 08:06:20,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:20,390 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-11-09 08:06:20,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:20,390 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-11-09 08:06:20,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 08:06:20,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:20,391 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:20,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 08:06:20,391 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:06:20,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:20,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1509911318, now seen corresponding path program 1 times [2024-11-09 08:06:20,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:20,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722117721] [2024-11-09 08:06:20,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:20,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 08:06:20,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:20,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722117721] [2024-11-09 08:06:20,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722117721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:06:20,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:06:20,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 08:06:20,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693010681] [2024-11-09 08:06:20,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:06:20,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 08:06:20,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:20,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 08:06:20,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 08:06:20,522 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:20,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:20,650 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-11-09 08:06:20,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 08:06:20,650 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-09 08:06:20,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:20,651 INFO L225 Difference]: With dead ends: 87 [2024-11-09 08:06:20,651 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 08:06:20,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 08:06:20,652 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 15 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:20,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 258 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:06:20,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 08:06:20,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-11-09 08:06:20,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 79 states have (on average 1.1265822784810127) internal successors, (89), 84 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:20,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2024-11-09 08:06:20,653 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 60 [2024-11-09 08:06:20,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:20,654 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2024-11-09 08:06:20,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:20,654 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2024-11-09 08:06:20,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 08:06:20,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:20,655 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:20,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 08:06:20,655 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:06:20,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:20,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1834289652, now seen corresponding path program 2 times [2024-11-09 08:06:20,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:20,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493488010] [2024-11-09 08:06:20,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:20,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:20,788 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:06:20,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:20,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493488010] [2024-11-09 08:06:20,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493488010] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:06:20,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050001435] [2024-11-09 08:06:20,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 08:06:20,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:20,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:20,791 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:06:20,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 08:06:20,991 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 08:06:20,991 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 08:06:20,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 08:06:20,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:06:21,047 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 08:06:21,047 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:06:21,116 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 08:06:21,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050001435] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:06:21,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:06:21,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-11-09 08:06:21,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759043322] [2024-11-09 08:06:21,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:06:21,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:06:21,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:21,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:06:21,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:06:21,118 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:21,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:21,170 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2024-11-09 08:06:21,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:06:21,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-09 08:06:21,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:21,171 INFO L225 Difference]: With dead ends: 74 [2024-11-09 08:06:21,171 INFO L226 Difference]: Without dead ends: 74 [2024-11-09 08:06:21,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-09 08:06:21,171 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 43 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 194 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.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:21,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 194 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:06:21,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-09 08:06:21,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-09 08:06:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:21,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2024-11-09 08:06:21,174 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 60 [2024-11-09 08:06:21,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:21,174 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2024-11-09 08:06:21,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:21,174 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2024-11-09 08:06:21,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 08:06:21,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:21,175 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:21,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 08:06:21,379 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,SelfDestructingSolverStorable25 [2024-11-09 08:06:21,380 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:06:21,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:21,380 INFO L85 PathProgramCache]: Analyzing trace with hash -672727665, now seen corresponding path program 1 times [2024-11-09 08:06:21,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:21,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112223182] [2024-11-09 08:06:21,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:21,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:21,537 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 08:06:21,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:21,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112223182] [2024-11-09 08:06:21,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112223182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:06:21,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:06:21,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 08:06:21,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216787428] [2024-11-09 08:06:21,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:06:21,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 08:06:21,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:21,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 08:06:21,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 08:06:21,540 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:21,680 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2024-11-09 08:06:21,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 08:06:21,681 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-09 08:06:21,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:21,681 INFO L225 Difference]: With dead ends: 75 [2024-11-09 08:06:21,681 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 08:06:21,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 08:06:21,682 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 7 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:21,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 214 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:06:21,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 08:06:21,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-09 08:06:21,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 74 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:21,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2024-11-09 08:06:21,684 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 62 [2024-11-09 08:06:21,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:21,684 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2024-11-09 08:06:21,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:21,684 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2024-11-09 08:06:21,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 08:06:21,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:21,685 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:21,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 08:06:21,686 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:06:21,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:21,686 INFO L85 PathProgramCache]: Analyzing trace with hash -912303337, now seen corresponding path program 1 times [2024-11-09 08:06:21,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:21,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260990291] [2024-11-09 08:06:21,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:21,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:22,752 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 08:06:22,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:22,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260990291] [2024-11-09 08:06:22,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260990291] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:06:22,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238082881] [2024-11-09 08:06:22,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:22,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:22,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:22,754 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:06:22,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 08:06:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:22,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-09 08:06:22,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:06:22,963 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:06:22,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 08:06:23,031 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-11-09 08:06:23,241 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 08:06:23,241 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-11-09 08:06:23,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:06:23,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 33 treesize of output 17 [2024-11-09 08:06:23,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:23,459 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 27 treesize of output 21 [2024-11-09 08:06:23,595 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 08:06:23,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 08:06:23,598 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 08:06:23,598 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:06:24,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:24,027 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 45 treesize of output 49 [2024-11-09 08:06:24,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:24,880 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 23 treesize of output 24 [2024-11-09 08:06:24,883 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 34 [2024-11-09 08:06:24,890 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-11-09 08:06:24,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:24,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-09 08:06:24,940 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 08:06:24,940 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 22 treesize of output 1 [2024-11-09 08:06:25,041 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:06:25,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238082881] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:06:25,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:06:25,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 21] total 51 [2024-11-09 08:06:25,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273806629] [2024-11-09 08:06:25,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:06:25,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-09 08:06:25,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:25,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-09 08:06:25,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2471, Unknown=0, NotChecked=0, Total=2652 [2024-11-09 08:06:25,045 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 52 states, 51 states have (on average 2.5686274509803924) internal successors, (131), 52 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:26,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:26,278 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2024-11-09 08:06:26,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 08:06:26,279 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.5686274509803924) internal successors, (131), 52 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-09 08:06:26,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:26,280 INFO L225 Difference]: With dead ends: 84 [2024-11-09 08:06:26,280 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 08:06:26,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1123 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=323, Invalid=4099, Unknown=0, NotChecked=0, Total=4422 [2024-11-09 08:06:26,281 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:26,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 692 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 08:06:26,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 08:06:26,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2024-11-09 08:06:26,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:26,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2024-11-09 08:06:26,284 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 65 [2024-11-09 08:06:26,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:26,284 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2024-11-09 08:06:26,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.5686274509803924) internal successors, (131), 52 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:26,285 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2024-11-09 08:06:26,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 08:06:26,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:26,286 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:26,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-09 08:06:26,489 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,SelfDestructingSolverStorable27 [2024-11-09 08:06:26,490 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:06:26,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:26,490 INFO L85 PathProgramCache]: Analyzing trace with hash -912303336, now seen corresponding path program 1 times [2024-11-09 08:06:26,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:26,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045907960] [2024-11-09 08:06:26,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:26,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:28,132 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 08:06:28,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:28,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045907960] [2024-11-09 08:06:28,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045907960] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:06:28,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205322190] [2024-11-09 08:06:28,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:28,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:28,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:28,135 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:06:28,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 08:06:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:28,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-11-09 08:06:28,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:06:28,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 08:06:28,497 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:06:28,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 08:06:28,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:06:28,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 08:06:28,546 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-11-09 08:06:28,724 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 08:06:28,724 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-11-09 08:06:28,727 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-11-09 08:06:28,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:06:28,803 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 23 treesize of output 11 [2024-11-09 08:06:28,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:06:28,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-09 08:06:29,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:29,032 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 17 treesize of output 15 [2024-11-09 08:06:29,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:29,038 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 27 treesize of output 21 [2024-11-09 08:06:29,135 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 08:06:29,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:06:29,430 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1854 (Array Int Int))) (or (forall ((v_ArrVal_1855 Int)) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1854) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1855)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (not (= v_ArrVal_1854 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1854 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) (forall ((v_ArrVal_1854 (Array Int Int))) (or (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1854) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (not (= v_ArrVal_1854 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1854 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))))) is different from false [2024-11-09 08:06:29,660 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1851 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1851) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4))))) (forall ((v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1851 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_ArrVal_1855 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1851) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4) 7) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1852) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1855) 4)))))) is different from false [2024-11-09 08:06:29,693 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1851 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1851) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4))))) (forall ((v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1851 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_ArrVal_1855 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1851) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1852) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1855) 4)))))) is different from false [2024-11-09 08:06:29,711 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (and (forall ((v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1851 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_ArrVal_1855 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1851) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1852) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1855) 4))))) (forall ((v_ArrVal_1851 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1851) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4))))))) is different from false [2024-11-09 08:06:29,748 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (and (forall ((v_ArrVal_1851 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1851) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4))))) (forall ((v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1851 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_ArrVal_1855 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1851) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1852) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1855) 4))))))) is different from false [2024-11-09 08:06:29,765 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))) (and (forall ((v_ArrVal_1851 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< 0 (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1851) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4) 5)))) (forall ((v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1851 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_ArrVal_1855 Int)) (or (< (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1851) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4) 7) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1852) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1855) 4))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|))))) is different from false [2024-11-09 08:06:29,785 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (and (forall ((v_ArrVal_1851 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int)) (or (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1851) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|))) (forall ((v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1851 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_ArrVal_1855 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1851) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1852) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1855) 4))))))) is different from false [2024-11-09 08:06:29,826 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (and (forall ((v_ArrVal_1851 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< 0 (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1851) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4) 5)))) (forall ((v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1851 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_ArrVal_1855 Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1851) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1852) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1855) 4))))))) is different from false [2024-11-09 08:06:29,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:29,837 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 47 treesize of output 48 [2024-11-09 08:06:29,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:29,844 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 37 treesize of output 38 [2024-11-09 08:06:29,848 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 66 treesize of output 62 [2024-11-09 08:06:29,852 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 112 treesize of output 106 [2024-11-09 08:06:29,858 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 40 treesize of output 38 [2024-11-09 08:06:29,866 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 47 treesize of output 45 [2024-11-09 08:06:29,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:29,880 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 50 treesize of output 52 [2024-11-09 08:06:29,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:29,895 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 57 treesize of output 59 [2024-11-09 08:06:29,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:29,946 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 23 treesize of output 24 [2024-11-09 08:06:29,949 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:06:29,951 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 17 [2024-11-09 08:06:29,953 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:06:29,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 08:06:30,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:30,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2024-11-09 08:06:30,404 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 9 not checked. [2024-11-09 08:06:30,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205322190] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:06:30,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:06:30,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 60 [2024-11-09 08:06:30,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931181166] [2024-11-09 08:06:30,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:06:30,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-11-09 08:06:30,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:30,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-11-09 08:06:30,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2569, Unknown=8, NotChecked=872, Total=3660 [2024-11-09 08:06:30,407 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 61 states, 60 states have (on average 2.533333333333333) internal successors, (152), 61 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:31,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:31,805 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2024-11-09 08:06:31,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 08:06:31,805 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.533333333333333) internal successors, (152), 61 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-09 08:06:31,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:31,810 INFO L225 Difference]: With dead ends: 86 [2024-11-09 08:06:31,810 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 08:06:31,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 94 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=346, Invalid=3968, Unknown=8, NotChecked=1080, Total=5402 [2024-11-09 08:06:31,812 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 36 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 562 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:31,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 766 Invalid, 1946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1376 Invalid, 0 Unknown, 562 Unchecked, 0.7s Time] [2024-11-09 08:06:31,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 08:06:31,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2024-11-09 08:06:31,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.12) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:31,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-11-09 08:06:31,818 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 65 [2024-11-09 08:06:31,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:31,818 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-11-09 08:06:31,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.533333333333333) internal successors, (152), 61 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:31,819 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-11-09 08:06:31,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 08:06:31,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:31,819 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:31,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-09 08:06:32,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:32,021 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:06:32,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:32,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1783366225, now seen corresponding path program 1 times [2024-11-09 08:06:32,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:32,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278617727] [2024-11-09 08:06:32,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:32,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:32,972 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 08:06:32,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:32,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278617727] [2024-11-09 08:06:32,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278617727] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:06:32,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259486441] [2024-11-09 08:06:32,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:32,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:32,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:32,974 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:06:32,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 08:06:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:33,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-09 08:06:33,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:06:33,249 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:06:33,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2024-11-09 08:06:33,287 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 08:06:33,439 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 08:06:33,439 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 33 treesize of output 32 [2024-11-09 08:06:33,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:06:33,501 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 32 treesize of output 16 [2024-11-09 08:06:33,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:33,638 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 26 treesize of output 20 [2024-11-09 08:06:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 08:06:33,696 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:06:33,952 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1963 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_74| Int) (v_ArrVal_1965 Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1963) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_74| v_ArrVal_1965) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_74|))) is different from false [2024-11-09 08:06:34,030 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1963 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_74| Int) (v_ArrVal_1965 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| 4)) v_ArrVal_1963) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_74| v_ArrVal_1965) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_74|))) is different from false [2024-11-09 08:06:34,037 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1963 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_74| Int) (v_ArrVal_1965 Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_74|) (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_1963) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_74| v_ArrVal_1965) 4) 0)))) is different from false [2024-11-09 08:06:34,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:34,215 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 24 treesize of output 25 [2024-11-09 08:06:34,218 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 41 treesize of output 37 [2024-11-09 08:06:34,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2024-11-09 08:06:34,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:34,228 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 57 treesize of output 59 [2024-11-09 08:06:34,394 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 2 not checked. [2024-11-09 08:06:34,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259486441] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:06:34,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:06:34,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 25] total 48 [2024-11-09 08:06:34,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650527359] [2024-11-09 08:06:34,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:06:34,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-09 08:06:34,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:34,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-09 08:06:34,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1788, Unknown=41, NotChecked=264, Total=2256 [2024-11-09 08:06:34,397 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 48 states, 48 states have (on average 2.7916666666666665) internal successors, (134), 48 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:35,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:35,374 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2024-11-09 08:06:35,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 08:06:35,374 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.7916666666666665) internal successors, (134), 48 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-09 08:06:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:35,375 INFO L225 Difference]: With dead ends: 88 [2024-11-09 08:06:35,375 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 08:06:35,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 109 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=275, Invalid=3001, Unknown=42, NotChecked=342, Total=3660 [2024-11-09 08:06:35,376 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:35,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 829 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1277 Invalid, 0 Unknown, 195 Unchecked, 0.6s Time] [2024-11-09 08:06:35,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 08:06:35,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2024-11-09 08:06:35,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 79 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:35,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2024-11-09 08:06:35,379 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 66 [2024-11-09 08:06:35,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:35,379 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2024-11-09 08:06:35,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.7916666666666665) internal successors, (134), 48 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:35,379 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2024-11-09 08:06:35,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 08:06:35,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:35,380 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:35,396 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-11-09 08:06:35,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:35,581 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:06:35,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:35,581 INFO L85 PathProgramCache]: Analyzing trace with hash 124432906, now seen corresponding path program 1 times [2024-11-09 08:06:35,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:35,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716033292] [2024-11-09 08:06:35,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:35,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:36,778 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 08:06:36,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:36,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716033292] [2024-11-09 08:06:36,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716033292] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:06:36,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457738976] [2024-11-09 08:06:36,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:36,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:36,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:36,780 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:06:36,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-09 08:06:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:37,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-09 08:06:37,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:06:37,143 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:06:37,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 08:06:37,181 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-11-09 08:06:37,373 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 08:06:37,373 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-11-09 08:06:37,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:06:37,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-09 08:06:37,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:37,560 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 27 treesize of output 21 [2024-11-09 08:06:37,640 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 08:06:37,640 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:06:38,012 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_81| Int) (v_ArrVal_2075 Int) (v_ArrVal_2073 (Array Int Int))) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2073) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_81| v_ArrVal_2075) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_81|))) is different from false [2024-11-09 08:06:38,025 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_81| Int) (v_ArrVal_2075 Int) (v_ArrVal_2073 (Array Int Int))) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2073) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_81| v_ArrVal_2075) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_81|))) is different from false [2024-11-09 08:06:38,203 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_81| Int) (v_ArrVal_2075 Int) (v_ArrVal_2073 (Array Int Int))) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2073) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_81| v_ArrVal_2075) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_81|))) is different from false [2024-11-09 08:06:38,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:38,412 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 23 treesize of output 24 [2024-11-09 08:06:38,414 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 34 [2024-11-09 08:06:38,419 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 26 treesize of output 24 [2024-11-09 08:06:38,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:38,431 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 36 treesize of output 38 [2024-11-09 08:06:38,585 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 08:06:38,586 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 13 treesize of output 12 [2024-11-09 08:06:38,635 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 3 not checked. [2024-11-09 08:06:38,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457738976] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:06:38,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:06:38,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 24] total 48 [2024-11-09 08:06:38,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874513319] [2024-11-09 08:06:38,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:06:38,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-09 08:06:38,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:38,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-09 08:06:38,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1841, Unknown=73, NotChecked=270, Total=2352 [2024-11-09 08:06:38,637 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 49 states, 48 states have (on average 2.8541666666666665) internal successors, (137), 49 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:39,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:39,755 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-11-09 08:06:39,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 08:06:39,755 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.8541666666666665) internal successors, (137), 49 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-09 08:06:39,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:39,756 INFO L225 Difference]: With dead ends: 87 [2024-11-09 08:06:39,756 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 08:06:39,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 109 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=285, Invalid=3190, Unknown=77, NotChecked=354, Total=3906 [2024-11-09 08:06:39,756 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 60 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 209 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:39,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 762 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1191 Invalid, 0 Unknown, 209 Unchecked, 0.6s Time] [2024-11-09 08:06:39,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 08:06:39,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2024-11-09 08:06:39,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.105263157894737) internal successors, (84), 80 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:39,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-11-09 08:06:39,758 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 68 [2024-11-09 08:06:39,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:39,759 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-11-09 08:06:39,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.8541666666666665) internal successors, (137), 49 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:39,759 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-11-09 08:06:39,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 08:06:39,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:39,760 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:39,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-09 08:06:39,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:39,960 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:06:39,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:39,961 INFO L85 PathProgramCache]: Analyzing trace with hash 424087740, now seen corresponding path program 2 times [2024-11-09 08:06:39,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:39,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559828318] [2024-11-09 08:06:39,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:39,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:06:42,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:42,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559828318] [2024-11-09 08:06:42,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559828318] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:06:42,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190903444] [2024-11-09 08:06:42,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 08:06:42,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:42,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:42,096 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:06:42,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-09 08:06:42,353 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 08:06:42,354 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 08:06:42,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-09 08:06:42,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:06:42,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 08:06:42,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 08:06:42,516 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:06:42,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 08:06:42,562 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 16 treesize of output 11 [2024-11-09 08:06:42,571 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 16 treesize of output 11 [2024-11-09 08:06:42,578 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 16 treesize of output 11 [2024-11-09 08:06:42,584 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 16 treesize of output 11 [2024-11-09 08:06:42,678 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 15 [2024-11-09 08:06:42,683 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 15 [2024-11-09 08:06:43,092 INFO L349 Elim1Store]: treesize reduction 92, result has 35.2 percent of original size [2024-11-09 08:06:43,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 96 [2024-11-09 08:06:43,178 INFO L349 Elim1Store]: treesize reduction 64, result has 47.5 percent of original size [2024-11-09 08:06:43,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 67 [2024-11-09 08:06:43,799 INFO L349 Elim1Store]: treesize reduction 44, result has 51.6 percent of original size [2024-11-09 08:06:43,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 129 treesize of output 151 [2024-11-09 08:06:43,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:06:43,854 INFO L349 Elim1Store]: treesize reduction 104, result has 32.5 percent of original size [2024-11-09 08:06:43,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 149 treesize of output 147 [2024-11-09 08:06:44,111 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:06:44,112 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 13 treesize of output 11 [2024-11-09 08:06:44,132 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 7 treesize of output 3 [2024-11-09 08:06:44,181 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 7 treesize of output 3 [2024-11-09 08:06:48,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:06:48,792 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2024-11-09 08:06:48,793 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 66 treesize of output 43 [2024-11-09 08:06:48,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:48,801 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 17 treesize of output 15 [2024-11-09 08:06:48,843 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:06:48,843 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:06:48,919 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 10 treesize of output 8 [2024-11-09 08:06:51,505 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse3))) (and (forall ((v_ArrVal_2194 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) (= 0 (select (select .cse2 .cse1) 4)))))) (forall ((v_ArrVal_2194 Int) (v_ArrVal_2192 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse5 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) (not (= v_ArrVal_2192 (store (select |c_#memory_$Pointer$#1.offset| .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2192 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_2192) .cse5) 4) 0))))))) is different from false [2024-11-09 08:06:51,539 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (and (forall ((v_ArrVal_2194 Int) (v_ArrVal_2192 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (or (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) (not (= (store (select |c_#memory_$Pointer$#1.offset| .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2192 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)) v_ArrVal_2192)) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_2192) .cse0) 4) 0) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (forall ((v_ArrVal_2194 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (or (= (select (select .cse4 .cse5) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse5) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))))))) is different from false [2024-11-09 08:06:51,572 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse3))) (and (forall ((v_ArrVal_2194 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (< .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= (select (select .cse2 .cse0) 4) 0))))) (forall ((v_ArrVal_2194 Int) (v_ArrVal_2192 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse5 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (or (not (= (store (select |c_#memory_$Pointer$#1.offset| .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2192 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)) v_ArrVal_2192)) (= .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (< .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_2192) .cse5) 4) 0))))))) is different from false [2024-11-09 08:06:51,654 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (and (forall ((v_ArrVal_2194 Int) (v_ArrVal_2192 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (not (= v_ArrVal_2192 (store (select |c_#memory_$Pointer$#1.offset| .cse0) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2192 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2192) .cse1) 4) 0) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1)))) (forall ((v_ArrVal_2194 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (= (select (select .cse4 .cse5) 4) 0) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse5)))))))) is different from false [2024-11-09 08:06:51,685 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse10 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse10)) (.cse2 (select .cse10 4)) (.cse6 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse3 (select .cse6 4)) (.cse5 (select .cse4 .cse2))) (and (forall ((v_ArrVal_2194 Int) (v_ArrVal_2192 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse6)) (.cse0 (select (select (store .cse4 .cse2 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0) (not (= v_ArrVal_2192 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2192 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (= (select (select (store .cse1 .cse2 v_ArrVal_2192) .cse0) 4) 0) (< .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (forall ((v_ArrVal_2194 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse8 (store .cse4 .cse2 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse7) (= (select (select .cse8 .cse7) 4) 0) (< .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))))))))) is different from false [2024-11-09 08:06:51,722 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse10 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse10)) (.cse1 (select .cse10 4)) (.cse6 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse3 (select .cse6 4)) (.cse5 (select .cse4 .cse1))) (and (forall ((v_ArrVal_2194 Int) (v_ArrVal_2192 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base| .cse6)) (.cse2 (select (select (store .cse4 .cse1 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_node_create_#res#1.base|) 4))) (or (not (= (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2192 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)) v_ArrVal_2192)) (= (select (select (store .cse0 .cse1 v_ArrVal_2192) .cse2) 4) 0) (= |c_ULTIMATE.start_node_create_#res#1.base| .cse2) (< .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (forall ((v_ArrVal_2194 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse7 (store .cse4 .cse1 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_node_create_#res#1.base|) 4))) (or (= (select (select .cse7 .cse8) 4) 0) (= |c_ULTIMATE.start_node_create_#res#1.base| .cse8) (< .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))))))))) is different from false [2024-11-09 08:06:51,763 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse10 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse10)) (.cse4 (select .cse10 4)) (.cse8 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse8 4)) (.cse5 (select .cse3 .cse4))) (and (forall ((v_ArrVal_2194 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse2 (store .cse3 .cse4 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= .cse1 |c_ULTIMATE.start_node_create_~temp~0#1.base|) (= (select (select .cse2 .cse1) 4) 0))))) (forall ((v_ArrVal_2194 Int) (v_ArrVal_2192 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse8)) (.cse7 (select (select (store .cse3 .cse4 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (not (= (store (select .cse6 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2192 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)) v_ArrVal_2192)) (= (select (select (store .cse6 .cse4 v_ArrVal_2192) .cse7) 4) 0) (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|))))))))) is different from false [2024-11-09 08:06:51,801 INFO L349 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2024-11-09 08:06:51,801 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 118 [2024-11-09 08:06:51,835 INFO L349 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2024-11-09 08:06:51,836 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 213 treesize of output 180 [2024-11-09 08:06:52,316 INFO L349 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2024-11-09 08:06:52,316 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 211 treesize of output 158 [2024-11-09 08:06:52,323 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 18 treesize of output 16 [2024-11-09 08:06:52,566 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse13 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (and (or (and (forall ((v_ArrVal_2194 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14)) (.cse4 (select v_arrayElimArr_14 4))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194))))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (not (= (select v_arrayElimArr_14 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse1) (= (select (select .cse2 .cse1) 4) 0))))) (forall ((v_ArrVal_2194 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (or (not (= (select v_arrayElimArr_14 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse5 (let ((.cse7 (select v_arrayElimArr_14 4))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| (select (select (store .cse6 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))))) (forall ((v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (or (not (= (select v_arrayElimArr_14 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2194 Int)) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (let ((.cse11 (store .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (let ((.cse8 (let ((.cse10 (select v_arrayElimArr_14 4))) (store .cse9 .cse10 (store (select .cse9 .cse10) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194))))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (select .cse11 .cse12) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse12))))))))) .cse13) (or .cse13 (forall ((v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2194 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse15 (select v_arrayElimArr_13 4))) (let ((.cse16 (select (select (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse17 .cse15 (store (select .cse17 .cse15) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) (.cse14 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (store .cse14 .cse15 v_ArrVal_2192) .cse16) 4) 0) (= .cse16 |c_ULTIMATE.start_node_create_~temp~0#1.base|) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (not (= v_ArrVal_2192 (store (select .cse14 .cse15) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2192 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (or (forall ((v_arrayElimArr_14 (Array Int Int))) (or (not (= (select v_arrayElimArr_14 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2194 Int)) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (let ((.cse21 (store .cse19 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse19 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)))) (let ((.cse22 (select (select .cse21 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (let ((.cse18 (let ((.cse20 (select v_arrayElimArr_14 4))) (store .cse19 .cse20 (store (select .cse19 .cse20) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194))))) (select .cse18 (select (select .cse18 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (select .cse21 .cse22) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse22)))))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|))) (or (not .cse13) (forall ((v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2194 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse23 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse24 (select (select (let ((.cse25 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse25 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse25 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (select (store .cse23 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2192) .cse24) 4) 0) (not (= (store (select .cse23 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2192 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)) v_ArrVal_2192)) (not (= (select v_arrayElimArr_13 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select v_arrayElimArr_12 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse24))))) (or (forall ((v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2194 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse26 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse27 (select v_arrayElimArr_13 4)) (.cse28 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (store .cse26 .cse27 v_ArrVal_2192) (select (select (store .cse28 .cse27 (store (select .cse28 .cse27) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (not (= v_ArrVal_2192 (store (select .cse26 .cse27) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2192 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| (select (select (store .cse28 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse28 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))))) .cse13) (or (forall ((v_ArrVal_2194 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse30 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (or (not (= (select v_arrayElimArr_14 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse29 (let ((.cse31 (select v_arrayElimArr_14 4))) (store .cse30 .cse31 (store (select .cse30 .cse31) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194))))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| (select (select (store .cse30 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse30 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))))) .cse13) (or (forall ((v_ArrVal_2194 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse33 (let ((.cse34 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14)) (.cse35 (select v_arrayElimArr_14 4))) (store .cse34 .cse35 (store (select .cse34 .cse35) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194))))) (let ((.cse32 (select (select .cse33 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (not (= (select v_arrayElimArr_14 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse32) (= (select (select .cse33 .cse32) 4) 0) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|))))) .cse13) (or (and (forall ((v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2194 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse36 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse37 (select v_arrayElimArr_13 4)) (.cse38 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (store .cse36 .cse37 v_ArrVal_2192) (select (select (store .cse38 .cse37 (store (select .cse38 .cse37) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= v_ArrVal_2192 (store (select .cse36 .cse37) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2192 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| (select (select (store .cse38 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse38 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))))) (forall ((v_ArrVal_2194 Int) (v_ArrVal_2192 (Array Int Int)) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse40 (select v_arrayElimArr_13 4))) (let ((.cse41 (select (select (let ((.cse42 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse42 .cse40 (store (select .cse42 .cse40) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2194))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) (.cse39 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (store .cse39 .cse40 v_ArrVal_2192) .cse41) 4) 0) (= .cse41 |c_ULTIMATE.start_node_create_~temp~0#1.base|) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= v_ArrVal_2192 (store (select .cse39 .cse40) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2192 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (< (select v_arrayElimArr_12 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))))) .cse13))) is different from false [2024-11-09 08:06:54,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:54,388 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 282 treesize of output 223 [2024-11-09 08:06:54,468 INFO L349 Elim1Store]: treesize reduction 23, result has 67.1 percent of original size [2024-11-09 08:06:54,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1098 treesize of output 1021 [2024-11-09 08:06:54,556 INFO L349 Elim1Store]: treesize reduction 44, result has 63.3 percent of original size [2024-11-09 08:06:54,556 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 4 case distinctions, treesize of input 386 treesize of output 437 [2024-11-09 08:06:54,574 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 490 treesize of output 458 [2024-11-09 08:06:54,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:54,625 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 431 treesize of output 445 [2024-11-09 08:06:54,669 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-09 08:06:54,670 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 351 treesize of output 360 [2024-11-09 08:06:54,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:54,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 347 treesize of output 365 [2024-11-09 08:06:54,761 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 456 treesize of output 422 [2024-11-09 08:06:55,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 8 treesize of output 4 [2024-11-09 08:06:55,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:55,063 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 60 treesize of output 62 [2024-11-09 08:06:55,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:55,155 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 41 treesize of output 43 [2024-11-09 08:06:55,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:55,186 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 21 treesize of output 23 [2024-11-09 08:06:55,215 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 12 not checked. [2024-11-09 08:06:55,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190903444] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:06:55,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:06:55,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 73 [2024-11-09 08:06:55,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192798400] [2024-11-09 08:06:55,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:06:55,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-11-09 08:06:55,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:55,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-11-09 08:06:55,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=3918, Unknown=17, NotChecked=1064, Total=5256 [2024-11-09 08:06:55,218 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 73 states, 73 states have (on average 2.287671232876712) internal successors, (167), 73 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:57,356 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2024-11-09 08:06:57,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-09 08:06:57,357 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 2.287671232876712) internal successors, (167), 73 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-09 08:06:57,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:57,357 INFO L225 Difference]: With dead ends: 141 [2024-11-09 08:06:57,357 INFO L226 Difference]: Without dead ends: 141 [2024-11-09 08:06:57,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 102 SyntacticMatches, 7 SemanticMatches, 84 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1444 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=375, Invalid=5646, Unknown=17, NotChecked=1272, Total=7310 [2024-11-09 08:06:57,358 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 70 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 592 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:57,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1226 Invalid, 2017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1414 Invalid, 0 Unknown, 592 Unchecked, 0.9s Time] [2024-11-09 08:06:57,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-09 08:06:57,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2024-11-09 08:06:57,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0820895522388059) internal successors, (145), 138 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:57,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 145 transitions. [2024-11-09 08:06:57,361 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 145 transitions. Word has length 71 [2024-11-09 08:06:57,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:57,361 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 145 transitions. [2024-11-09 08:06:57,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 2.287671232876712) internal successors, (167), 73 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:57,362 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2024-11-09 08:06:57,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 08:06:57,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:57,363 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:57,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-09 08:06:57,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:57,567 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 08:06:57,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:57,567 INFO L85 PathProgramCache]: Analyzing trace with hash 261816652, now seen corresponding path program 2 times [2024-11-09 08:06:57,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:57,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481932245] [2024-11-09 08:06:57,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:57,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat