./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 19:04:00,775 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 19:04:00,840 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 19:04:00,843 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 19:04:00,843 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 19:04:00,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 19:04:00,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 19:04:00,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 19:04:00,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 19:04:00,859 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 19:04:00,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 19:04:00,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 19:04:00,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 19:04:00,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 19:04:00,862 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 19:04:00,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 19:04:00,863 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 19:04:00,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 19:04:00,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 19:04:00,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 19:04:00,863 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 19:04:00,866 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 19:04:00,866 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 19:04:00,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 19:04:00,867 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 19:04:00,867 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 19:04:00,867 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 19:04:00,867 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 19:04:00,867 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 19:04:00,867 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 19:04:00,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 19:04:00,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 19:04:00,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 19:04:00,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 19:04:00,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 19:04:00,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 19:04:00,869 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 19:04:00,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 19:04:00,870 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 19:04:00,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 19:04:00,870 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 19:04:00,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 19:04:00,870 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 -> c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc [2024-11-22 19:04:01,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 19:04:01,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 19:04:01,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 19:04:01,075 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 19:04:01,076 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 19:04:01,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2024-11-22 19:04:02,270 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 19:04:02,466 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 19:04:02,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2024-11-22 19:04:02,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d92cc8b38/4b50f70806fa44648b68ac4a9809fb2c/FLAG1014fb339 [2024-11-22 19:04:02,835 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d92cc8b38/4b50f70806fa44648b68ac4a9809fb2c [2024-11-22 19:04:02,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 19:04:02,839 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 19:04:02,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 19:04:02,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 19:04:02,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 19:04:02,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:04:02" (1/1) ... [2024-11-22 19:04:02,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7df0f1b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:04:02, skipping insertion in model container [2024-11-22 19:04:02,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:04:02" (1/1) ... [2024-11-22 19:04:02,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 19:04:03,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 19:04:03,177 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 19:04:03,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 19:04:03,238 INFO L204 MainTranslator]: Completed translation [2024-11-22 19:04:03,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:04:03 WrapperNode [2024-11-22 19:04:03,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 19:04:03,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 19:04:03,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 19:04:03,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 19:04:03,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:04:03" (1/1) ... [2024-11-22 19:04:03,255 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:04:03" (1/1) ... [2024-11-22 19:04:03,271 INFO L138 Inliner]: procedures = 122, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2024-11-22 19:04:03,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 19:04:03,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 19:04:03,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 19:04:03,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 19:04:03,279 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:04:03" (1/1) ... [2024-11-22 19:04:03,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:04:03" (1/1) ... [2024-11-22 19:04:03,282 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:04:03" (1/1) ... [2024-11-22 19:04:03,296 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2024-11-22 19:04:03,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:04:03" (1/1) ... [2024-11-22 19:04:03,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:04:03" (1/1) ... [2024-11-22 19:04:03,301 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:04:03" (1/1) ... [2024-11-22 19:04:03,303 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:04:03" (1/1) ... [2024-11-22 19:04:03,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:04:03" (1/1) ... [2024-11-22 19:04:03,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:04:03" (1/1) ... [2024-11-22 19:04:03,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 19:04:03,308 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 19:04:03,308 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 19:04:03,308 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 19:04:03,309 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:04:03" (1/1) ... [2024-11-22 19:04:03,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 19:04:03,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:04:03,338 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-22 19:04:03,340 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-22 19:04:03,373 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-22 19:04:03,373 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-22 19:04:03,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 19:04:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 19:04:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 19:04:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 19:04:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 19:04:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 19:04:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 19:04:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 19:04:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 19:04:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 19:04:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 19:04:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 19:04:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 19:04:03,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 19:04:03,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 19:04:03,463 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 19:04:03,465 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 19:04:03,482 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-22 19:04:03,663 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-11-22 19:04:03,663 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 19:04:03,674 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 19:04:03,674 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-22 19:04:03,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:04:03 BoogieIcfgContainer [2024-11-22 19:04:03,674 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 19:04:03,676 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 19:04:03,676 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 19:04:03,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 19:04:03,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 07:04:02" (1/3) ... [2024-11-22 19:04:03,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333aca0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:04:03, skipping insertion in model container [2024-11-22 19:04:03,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:04:03" (2/3) ... [2024-11-22 19:04:03,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333aca0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:04:03, skipping insertion in model container [2024-11-22 19:04:03,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:04:03" (3/3) ... [2024-11-22 19:04:03,680 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-2.i [2024-11-22 19:04:03,693 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 19:04:03,693 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2024-11-22 19:04:03,725 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 19:04:03,730 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;@58e417a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 19:04:03,730 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2024-11-22 19:04:03,733 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 64 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:04:03,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-22 19:04:03,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:04:03,744 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-22 19:04:03,744 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-22 19:04:03,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:04:03,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2024-11-22 19:04:03,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:04:03,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751656167] [2024-11-22 19:04:03,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:04:03,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:04:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:04:03,970 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-22 19:04:03,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:04:03,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751656167] [2024-11-22 19:04:03,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751656167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:04:03,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:04:03,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 19:04:03,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665875262] [2024-11-22 19:04:03,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:04:03,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:04:03,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:04:04,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:04:04,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:04:04,006 INFO L87 Difference]: Start difference. First operand has 66 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 64 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:04:04,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:04:04,076 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2024-11-22 19:04:04,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:04:04,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-22 19:04:04,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:04:04,083 INFO L225 Difference]: With dead ends: 62 [2024-11-22 19:04:04,083 INFO L226 Difference]: Without dead ends: 56 [2024-11-22 19:04:04,084 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-22 19:04:04,087 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 14 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 19:04:04,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 81 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:04:04,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-22 19:04:04,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-22 19:04:04,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 55 states have internal predecessors, (59), 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-22 19:04:04,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2024-11-22 19:04:04,116 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 4 [2024-11-22 19:04:04,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:04:04,117 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2024-11-22 19:04:04,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:04:04,117 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2024-11-22 19:04:04,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-22 19:04:04,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:04:04,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-22 19:04:04,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 19:04:04,119 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-22 19:04:04,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:04:04,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2024-11-22 19:04:04,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:04:04,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833244596] [2024-11-22 19:04:04,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:04:04,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:04:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:04:04,248 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-22 19:04:04,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:04:04,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833244596] [2024-11-22 19:04:04,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833244596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:04:04,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:04:04,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 19:04:04,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882114291] [2024-11-22 19:04:04,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:04:04,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:04:04,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:04:04,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:04:04,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:04:04,253 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:04:04,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:04:04,291 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2024-11-22 19:04:04,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:04:04,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-22 19:04:04,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:04:04,293 INFO L225 Difference]: With dead ends: 53 [2024-11-22 19:04:04,293 INFO L226 Difference]: Without dead ends: 53 [2024-11-22 19:04:04,294 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-22 19:04:04,296 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 12 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:04:04,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 74 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:04:04,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-22 19:04:04,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-22 19:04:04,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 52 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-22 19:04:04,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2024-11-22 19:04:04,301 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 4 [2024-11-22 19:04:04,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:04:04,301 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2024-11-22 19:04:04,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:04:04,302 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2024-11-22 19:04:04,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-22 19:04:04,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:04:04,302 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:04:04,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 19:04:04,302 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-22 19:04:04,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:04:04,303 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2024-11-22 19:04:04,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:04:04,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95151757] [2024-11-22 19:04:04,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:04:04,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:04:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:04:04,363 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-22 19:04:04,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:04:04,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95151757] [2024-11-22 19:04:04,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95151757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:04:04,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:04:04,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 19:04:04,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467959613] [2024-11-22 19:04:04,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:04:04,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:04:04,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:04:04,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:04:04,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:04:04,367 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-22 19:04:04,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:04:04,411 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2024-11-22 19:04:04,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:04:04,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-22 19:04:04,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:04:04,413 INFO L225 Difference]: With dead ends: 51 [2024-11-22 19:04:04,413 INFO L226 Difference]: Without dead ends: 51 [2024-11-22 19:04:04,414 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-22 19:04:04,414 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:04:04,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 76 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:04:04,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-22 19:04:04,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-22 19:04:04,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 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-22 19:04:04,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2024-11-22 19:04:04,421 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 9 [2024-11-22 19:04:04,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:04:04,421 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2024-11-22 19:04:04,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-22 19:04:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2024-11-22 19:04:04,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-22 19:04:04,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:04:04,423 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:04:04,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 19:04:04,423 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-22 19:04:04,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:04:04,425 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2024-11-22 19:04:04,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:04:04,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826393550] [2024-11-22 19:04:04,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:04:04,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:04:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:04:04,548 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-22 19:04:04,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:04:04,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826393550] [2024-11-22 19:04:04,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826393550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:04:04,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:04:04,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 19:04:04,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417418909] [2024-11-22 19:04:04,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:04:04,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:04:04,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:04:04,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:04:04,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:04:04,551 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-22 19:04:04,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:04:04,584 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2024-11-22 19:04:04,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:04:04,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-22 19:04:04,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:04:04,584 INFO L225 Difference]: With dead ends: 49 [2024-11-22 19:04:04,585 INFO L226 Difference]: Without dead ends: 49 [2024-11-22 19:04:04,585 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-22 19:04:04,585 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:04:04,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:04:04,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-22 19:04:04,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-22 19:04:04,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 48 states have internal predecessors, (52), 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-22 19:04:04,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2024-11-22 19:04:04,589 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 9 [2024-11-22 19:04:04,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:04:04,589 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2024-11-22 19:04:04,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-22 19:04:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2024-11-22 19:04:04,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 19:04:04,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:04:04,590 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:04:04,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 19:04:04,590 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-22 19:04:04,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:04:04,591 INFO L85 PathProgramCache]: Analyzing trace with hash 427661500, now seen corresponding path program 1 times [2024-11-22 19:04:04,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:04:04,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332079027] [2024-11-22 19:04:04,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:04:04,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:04:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:04:04,649 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-22 19:04:04,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:04:04,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332079027] [2024-11-22 19:04:04,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332079027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:04:04,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:04:04,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:04:04,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710926317] [2024-11-22 19:04:04,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:04:04,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:04:04,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:04:04,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:04:04,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:04:04,652 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-22 19:04:04,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:04:04,665 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2024-11-22 19:04:04,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:04:04,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-11-22 19:04:04,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:04:04,666 INFO L225 Difference]: With dead ends: 54 [2024-11-22 19:04:04,666 INFO L226 Difference]: Without dead ends: 54 [2024-11-22 19:04:04,667 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-22 19:04:04,667 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 4 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 93 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-22 19:04:04,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 93 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:04:04,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-22 19:04:04,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2024-11-22 19:04:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 49 states have internal predecessors, (53), 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-22 19:04:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2024-11-22 19:04:04,671 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 11 [2024-11-22 19:04:04,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:04:04,671 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2024-11-22 19:04:04,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-22 19:04:04,672 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2024-11-22 19:04:04,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 19:04:04,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:04:04,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:04:04,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 19:04:04,672 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-22 19:04:04,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:04:04,673 INFO L85 PathProgramCache]: Analyzing trace with hash 200371689, now seen corresponding path program 1 times [2024-11-22 19:04:04,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:04:04,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061797079] [2024-11-22 19:04:04,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:04:04,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:04:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:04:04,744 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-22 19:04:04,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:04:04,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061797079] [2024-11-22 19:04:04,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061797079] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:04:04,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006485837] [2024-11-22 19:04:04,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:04:04,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:04:04,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:04:04,747 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-22 19:04:04,749 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-22 19:04:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:04:04,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 19:04:04,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:04:04,883 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-22 19:04:04,884 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:04:04,924 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-22 19:04:04,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006485837] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 19:04:04,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 19:04:04,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-22 19:04:04,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614230682] [2024-11-22 19:04:04,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 19:04:04,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 19:04:04,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:04:04,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 19:04:04,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-22 19:04:04,927 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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-22 19:04:04,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:04:04,949 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2024-11-22 19:04:04,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 19:04:04,950 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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 16 [2024-11-22 19:04:04,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:04:04,950 INFO L225 Difference]: With dead ends: 65 [2024-11-22 19:04:04,950 INFO L226 Difference]: Without dead ends: 65 [2024-11-22 19:04:04,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-22 19:04:04,951 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:04:04,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 182 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:04:04,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-22 19:04:04,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-22 19:04:04,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.36) internal successors, (68), 64 states have internal predecessors, (68), 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-22 19:04:04,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2024-11-22 19:04:04,955 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 16 [2024-11-22 19:04:04,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:04:04,955 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2024-11-22 19:04:04,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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-22 19:04:04,955 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2024-11-22 19:04:04,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-22 19:04:04,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:04:04,956 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:04:04,964 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-22 19:04:05,160 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-22 19:04:05,161 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-22 19:04:05,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:04:05,162 INFO L85 PathProgramCache]: Analyzing trace with hash 527522044, now seen corresponding path program 2 times [2024-11-22 19:04:05,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:04:05,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367902265] [2024-11-22 19:04:05,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 19:04:05,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:04:05,197 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 19:04:05,197 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 19:04:05,315 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-22 19:04:05,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:04:05,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367902265] [2024-11-22 19:04:05,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367902265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:04:05,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:04:05,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 19:04:05,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590158498] [2024-11-22 19:04:05,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:04:05,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 19:04:05,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:04:05,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 19:04:05,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 19:04:05,318 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-22 19:04:05,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:04:05,414 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2024-11-22 19:04:05,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 19:04:05,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 31 [2024-11-22 19:04:05,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:04:05,415 INFO L225 Difference]: With dead ends: 62 [2024-11-22 19:04:05,415 INFO L226 Difference]: Without dead ends: 62 [2024-11-22 19:04:05,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 19:04:05,416 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 16 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 19:04:05,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 96 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:04:05,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-22 19:04:05,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-22 19:04:05,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 61 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-22 19:04:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2024-11-22 19:04:05,419 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 31 [2024-11-22 19:04:05,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:04:05,420 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2024-11-22 19:04:05,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-22 19:04:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2024-11-22 19:04:05,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-22 19:04:05,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:04:05,422 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:04:05,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 19:04:05,423 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-22 19:04:05,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:04:05,423 INFO L85 PathProgramCache]: Analyzing trace with hash 527522045, now seen corresponding path program 1 times [2024-11-22 19:04:05,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:04:05,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998163339] [2024-11-22 19:04:05,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:04:05,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:04:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:04:05,653 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-22 19:04:05,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:04:05,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998163339] [2024-11-22 19:04:05,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998163339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:04:05,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:04:05,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 19:04:05,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64936002] [2024-11-22 19:04:05,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:04:05,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 19:04:05,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:04:05,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 19:04:05,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 19:04:05,660 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-22 19:04:05,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:04:05,761 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2024-11-22 19:04:05,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 19:04:05,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 31 [2024-11-22 19:04:05,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:04:05,763 INFO L225 Difference]: With dead ends: 69 [2024-11-22 19:04:05,763 INFO L226 Difference]: Without dead ends: 69 [2024-11-22 19:04:05,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 19:04:05,764 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 8 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 19:04:05,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 128 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:04:05,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-22 19:04:05,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2024-11-22 19:04:05,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 64 states have internal predecessors, (69), 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-22 19:04:05,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2024-11-22 19:04:05,772 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 31 [2024-11-22 19:04:05,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:04:05,773 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2024-11-22 19:04:05,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-22 19:04:05,773 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2024-11-22 19:04:05,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-22 19:04:05,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:04:05,773 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:04:05,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 19:04:05,774 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-22 19:04:05,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:04:05,774 INFO L85 PathProgramCache]: Analyzing trace with hash -453751472, now seen corresponding path program 1 times [2024-11-22 19:04:05,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:04:05,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2764129] [2024-11-22 19:04:05,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:04:05,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:04:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:04:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-22 19:04:06,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:04:06,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2764129] [2024-11-22 19:04:06,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2764129] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:04:06,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225544243] [2024-11-22 19:04:06,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:04:06,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:04:06,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:04:06,253 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-22 19:04:06,254 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-22 19:04:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:04:06,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-22 19:04:06,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:04:06,542 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-22 19:04:06,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:04:06,603 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-22 19:04:06,686 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-22 19:04:06,687 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:04:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-22 19:04:06,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225544243] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 19:04:06,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 19:04:06,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2024-11-22 19:04:06,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434960100] [2024-11-22 19:04:06,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 19:04:06,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-22 19:04:06,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:04:06,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-22 19:04:06,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2024-11-22 19:04:06,959 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 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-22 19:04:07,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:04:07,240 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2024-11-22 19:04:07,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 19:04:07,240 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 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 35 [2024-11-22 19:04:07,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:04:07,240 INFO L225 Difference]: With dead ends: 65 [2024-11-22 19:04:07,241 INFO L226 Difference]: Without dead ends: 65 [2024-11-22 19:04:07,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2024-11-22 19:04:07,241 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 19 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 19:04:07,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 358 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:04:07,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-22 19:04:07,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-22 19:04:07,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 64 states have internal predecessors, (68), 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-22 19:04:07,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2024-11-22 19:04:07,247 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 35 [2024-11-22 19:04:07,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:04:07,250 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2024-11-22 19:04:07,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 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-22 19:04:07,251 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2024-11-22 19:04:07,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 19:04:07,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:04:07,251 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:04:07,262 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-22 19:04:07,451 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,SelfDestructingSolverStorable8 [2024-11-22 19:04:07,452 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-22 19:04:07,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:04:07,453 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941388, now seen corresponding path program 1 times [2024-11-22 19:04:07,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:04:07,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269713917] [2024-11-22 19:04:07,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:04:07,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:04:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:04:08,157 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-22 19:04:08,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:04:08,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269713917] [2024-11-22 19:04:08,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269713917] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:04:08,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401839873] [2024-11-22 19:04:08,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:04:08,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:04:08,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:04:08,186 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-22 19:04:08,187 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-22 19:04:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:04:08,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-22 19:04:08,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:04:08,328 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-22 19:04:08,382 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 19:04:08,382 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-22 19:04:08,428 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-22 19:04:08,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 19:04:08,464 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-22 19:04:08,471 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-22 19:04:08,533 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-22 19:04:08,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2024-11-22 19:04:08,546 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 19:04:08,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-22 19:04:08,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2024-11-22 19:04:08,774 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-22 19:04:08,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 35 [2024-11-22 19:04:08,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:04:08,802 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 40 treesize of output 32 [2024-11-22 19:04:08,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-22 19:04:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-22 19:04:08,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:04:09,153 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-22 19:04:09,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401839873] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 19:04:09,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 19:04:09,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 29 [2024-11-22 19:04:09,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519008819] [2024-11-22 19:04:09,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 19:04:09,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-22 19:04:09,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:04:09,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-22 19:04:09,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2024-11-22 19:04:09,155 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 30 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-22 19:04:09,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:04:09,654 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2024-11-22 19:04:09,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-22 19:04:09,655 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 30 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) Word has length 37 [2024-11-22 19:04:09,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:04:09,655 INFO L225 Difference]: With dead ends: 77 [2024-11-22 19:04:09,655 INFO L226 Difference]: Without dead ends: 77 [2024-11-22 19:04:09,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=1243, Unknown=0, NotChecked=0, Total=1406 [2024-11-22 19:04:09,656 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 39 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 19:04:09,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 278 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 19:04:09,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-22 19:04:09,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2024-11-22 19:04:09,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 69 states have internal predecessors, (76), 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-22 19:04:09,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2024-11-22 19:04:09,660 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 37 [2024-11-22 19:04:09,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:04:09,661 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2024-11-22 19:04:09,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 30 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-22 19:04:09,661 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2024-11-22 19:04:09,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 19:04:09,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:04:09,661 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:04:09,670 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-22 19:04:09,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:04:09,862 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-22 19:04:09,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:04:09,862 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941389, now seen corresponding path program 1 times [2024-11-22 19:04:09,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:04:09,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877023787] [2024-11-22 19:04:09,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:04:09,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:04:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:04:10,587 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-22 19:04:10,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:04:10,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877023787] [2024-11-22 19:04:10,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877023787] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:04:10,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144188972] [2024-11-22 19:04:10,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:04:10,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:04:10,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:04:10,590 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-22 19:04:10,591 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-22 19:04:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:04:10,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-22 19:04:10,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:04:10,720 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-22 19:04:10,749 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 19:04:10,750 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-22 19:04:10,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 19:04:10,797 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-22 19:04:10,828 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-22 19:04:10,835 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-22 19:04:10,888 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-22 19:04:10,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2024-11-22 19:04:10,898 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-22 19:04:10,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-22 19:04:11,116 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-22 19:04:11,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2024-11-22 19:04:11,122 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-22 19:04:11,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 52 [2024-11-22 19:04:11,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:04:11,155 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 46 treesize of output 38 [2024-11-22 19:04:11,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:04:11,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2024-11-22 19:04:11,271 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-22 19:04:11,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:04:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-22 19:04:11,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144188972] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 19:04:11,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 19:04:11,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2024-11-22 19:04:11,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626645644] [2024-11-22 19:04:11,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 19:04:11,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-22 19:04:11,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:04:11,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-22 19:04:11,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2024-11-22 19:04:11,806 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 33 states, 32 states have (on average 2.46875) internal successors, (79), 33 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-22 19:04:16,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 19:04:16,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:04:16,235 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2024-11-22 19:04:16,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 19:04:16,236 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 33 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) Word has length 37 [2024-11-22 19:04:16,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:04:16,236 INFO L225 Difference]: With dead ends: 84 [2024-11-22 19:04:16,236 INFO L226 Difference]: Without dead ends: 84 [2024-11-22 19:04:16,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2024-11-22 19:04:16,237 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 63 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-22 19:04:16,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 332 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 657 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-11-22 19:04:16,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-22 19:04:16,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2024-11-22 19:04:16,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.2424242424242424) internal successors, (82), 75 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-22 19:04:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2024-11-22 19:04:16,247 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 37 [2024-11-22 19:04:16,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:04:16,247 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2024-11-22 19:04:16,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 33 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-22 19:04:16,247 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2024-11-22 19:04:16,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-22 19:04:16,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:04:16,248 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:04:16,257 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-22 19:04:16,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:04:16,449 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-22 19:04:16,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:04:16,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1642838496, now seen corresponding path program 1 times [2024-11-22 19:04:16,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:04:16,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526302056] [2024-11-22 19:04:16,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:04:16,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:04:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:04:17,623 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-22 19:04:17,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:04:17,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526302056] [2024-11-22 19:04:17,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526302056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:04:17,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807974055] [2024-11-22 19:04:17,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:04:17,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:04:17,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:04:17,626 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-22 19:04:17,627 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-22 19:04:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:04:17,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-22 19:04:17,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:04:17,816 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-22 19:04:17,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 19:04:17,873 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-22 19:04:17,884 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-22 19:04:17,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-22 19:04:17,943 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-22 19:04:17,949 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 35 treesize of output 19 [2024-11-22 19:04:17,961 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-22 19:04:17,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2024-11-22 19:04:18,037 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-22 19:04:18,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2024-11-22 19:04:18,050 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-22 19:04:18,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-22 19:04:18,057 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-22 19:04:18,295 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-22 19:04:18,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 37 [2024-11-22 19:04:18,308 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-22 19:04:18,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 46 [2024-11-22 19:04:18,316 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-22 19:04:18,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 42 [2024-11-22 19:04:18,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:04:18,391 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 42 treesize of output 34 [2024-11-22 19:04:18,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:04:18,401 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 30 treesize of output 30 [2024-11-22 19:04:18,526 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-22 19:04:18,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:04:27,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:04:27,303 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 76 treesize of output 80 [2024-11-22 19:04:27,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:04:27,365 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 76 treesize of output 80 [2024-11-22 19:04:27,654 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) (.cse1 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) (and (or (and (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_958)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (or (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_958 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_956) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_958)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse1)) .cse2) (or (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_958 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_956) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_958)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse1) (or .cse1 .cse2 (forall ((v_ArrVal_963 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_958)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (or (forall ((v_ArrVal_963 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))) .cse1))) is different from false [2024-11-22 19:04:27,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:04:27,920 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-22 19:04:27,922 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:04:27,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-11-22 19:04:27,954 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2024-11-22 19:04:27,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2024-11-22 19:04:27,958 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:04:27,960 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 32 treesize of output 20 [2024-11-22 19:04:27,978 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 19:04:27,978 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 43 treesize of output 1 [2024-11-22 19:04:27,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:04:27,984 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 22 treesize of output 23 [2024-11-22 19:04:27,988 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 24 [2024-11-22 19:04:27,992 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-22 19:04:28,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:04:28,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 31 [2024-11-22 19:04:28,011 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 24 [2024-11-22 19:04:28,015 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-22 19:04:28,140 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 4 not checked. [2024-11-22 19:04:28,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807974055] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 19:04:28,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 19:04:28,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 18] total 44 [2024-11-22 19:04:28,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775105777] [2024-11-22 19:04:28,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 19:04:28,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-22 19:04:28,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:04:28,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-22 19:04:28,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1623, Unknown=52, NotChecked=82, Total=1892 [2024-11-22 19:04:28,143 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 44 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 44 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-22 19:04:29,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:04:29,566 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2024-11-22 19:04:29,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-22 19:04:29,566 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 44 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) Word has length 41 [2024-11-22 19:04:29,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:04:29,566 INFO L225 Difference]: With dead ends: 76 [2024-11-22 19:04:29,566 INFO L226 Difference]: Without dead ends: 76 [2024-11-22 19:04:29,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=283, Invalid=2861, Unknown=52, NotChecked=110, Total=3306 [2024-11-22 19:04:29,568 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 22 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 19:04:29,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 589 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 798 Invalid, 0 Unknown, 35 Unchecked, 0.7s Time] [2024-11-22 19:04:29,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-22 19:04:29,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-22 19:04:29,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 75 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-22 19:04:29,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2024-11-22 19:04:29,571 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 41 [2024-11-22 19:04:29,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:04:29,572 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2024-11-22 19:04:29,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 44 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-22 19:04:29,572 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2024-11-22 19:04:29,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-22 19:04:29,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:04:29,574 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:04:29,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 19:04:29,774 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,SelfDestructingSolverStorable11 [2024-11-22 19:04:29,775 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-22 19:04:29,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:04:29,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1679000631, now seen corresponding path program 1 times [2024-11-22 19:04:29,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:04:29,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031320133] [2024-11-22 19:04:29,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:04:29,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:04:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:04:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-22 19:04:30,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:04:30,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031320133] [2024-11-22 19:04:30,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031320133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:04:30,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620450788] [2024-11-22 19:04:30,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:04:30,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:04:30,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:04:30,231 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-22 19:04:30,232 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-22 19:04:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:04:30,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-22 19:04:30,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:04:30,357 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-22 19:04:30,382 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-22 19:04:30,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-22 19:04:30,401 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-22 19:04:30,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-22 19:04:30,430 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 19:04:30,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-22 19:04:30,508 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-22 19:04:30,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-22 19:04:30,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-22 19:04:30,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2024-11-22 19:04:30,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-22 19:04:30,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-22 19:04:30,689 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 16 treesize of output 8 [2024-11-22 19:04:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-22 19:04:30,692 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:04:30,711 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1136 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1136) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2024-11-22 19:04:30,716 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1136 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1136) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) is different from false [2024-11-22 19:04:30,723 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1135 (Array Int Int))) (or (not (= v_ArrVal_1135 (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_1135 .cse0))))) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1135) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1136) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2024-11-22 19:04:30,731 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 39 [2024-11-22 19:04:30,734 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-22 19:04:30,986 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 10 not checked. [2024-11-22 19:04:30,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620450788] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 19:04:30,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 19:04:30,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 30 [2024-11-22 19:04:30,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669537624] [2024-11-22 19:04:30,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 19:04:30,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-22 19:04:30,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:04:30,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-22 19:04:30,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=620, Unknown=3, NotChecked=156, Total=870 [2024-11-22 19:04:30,988 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 30 states, 30 states have (on average 2.7666666666666666) internal successors, (83), 30 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-22 19:04:31,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:04:31,459 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2024-11-22 19:04:31,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 19:04:31,459 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.7666666666666666) internal successors, (83), 30 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 42 [2024-11-22 19:04:31,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:04:31,460 INFO L225 Difference]: With dead ends: 70 [2024-11-22 19:04:31,460 INFO L226 Difference]: Without dead ends: 70 [2024-11-22 19:04:31,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=938, Unknown=3, NotChecked=198, Total=1332 [2024-11-22 19:04:31,460 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 19:04:31,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 492 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 487 Invalid, 0 Unknown, 97 Unchecked, 0.3s Time] [2024-11-22 19:04:31,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-22 19:04:31,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-22 19:04:31,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 69 states have internal predecessors, (73), 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-22 19:04:31,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2024-11-22 19:04:31,463 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 42 [2024-11-22 19:04:31,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:04:31,463 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2024-11-22 19:04:31,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.7666666666666666) internal successors, (83), 30 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-22 19:04:31,463 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2024-11-22 19:04:31,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-22 19:04:31,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:04:31,464 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:04:31,471 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-22 19:04:31,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:04:31,665 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-22 19:04:31,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:04:31,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728484, now seen corresponding path program 2 times [2024-11-22 19:04:31,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:04:31,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645513534] [2024-11-22 19:04:31,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 19:04:31,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:04:31,702 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 19:04:31,702 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 19:04:33,209 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 19:04:33,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:04:33,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645513534] [2024-11-22 19:04:33,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645513534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:04:33,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017492987] [2024-11-22 19:04:33,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 19:04:33,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:04:33,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:04:33,211 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-22 19:04:33,212 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-22 19:04:33,334 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 19:04:33,335 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 19:04:33,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-11-22 19:04:33,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:04:33,376 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-22 19:04:33,467 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 19:04:33,467 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-22 19:04:33,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 19:04:33,524 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-22 19:04:33,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 23 treesize of output 11 [2024-11-22 19:04:33,577 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-22 19:04:33,647 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-22 19:04:33,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2024-11-22 19:04:33,723 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-22 19:04:33,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2024-11-22 19:04:33,746 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-22 19:04:33,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 36 [2024-11-22 19:04:33,819 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-22 19:04:33,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 41 [2024-11-22 19:04:33,833 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-22 19:04:33,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 33 [2024-11-22 19:04:33,955 INFO L349 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2024-11-22 19:04:33,955 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 3 case distinctions, treesize of input 71 treesize of output 64 [2024-11-22 19:04:33,987 INFO L349 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2024-11-22 19:04:33,987 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 48 [2024-11-22 19:04:34,463 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-22 19:04:34,463 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 68 [2024-11-22 19:04:34,470 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-22 19:04:34,470 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 3 case distinctions, treesize of input 110 treesize of output 96 [2024-11-22 19:04:35,018 INFO L349 Elim1Store]: treesize reduction 96, result has 35.1 percent of original size [2024-11-22 19:04:35,018 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 97 [2024-11-22 19:04:35,078 INFO L349 Elim1Store]: treesize reduction 88, result has 37.1 percent of original size [2024-11-22 19:04:35,078 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 6 case distinctions, treesize of input 73 treesize of output 85 [2024-11-22 19:04:35,524 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2024-11-22 19:04:35,525 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 134 treesize of output 113 [2024-11-22 19:04:35,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:04:35,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 65 treesize of output 81 [2024-11-22 19:04:35,881 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 19:04:35,881 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:04:42,937 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1319 (Array Int Int))) (or (not (= v_ArrVal_1319 (store .cse0 .cse1 (select v_ArrVal_1319 .cse1)))) (forall ((v_ArrVal_1320 (Array Int Int))) (or (not (= v_ArrVal_1320 (store .cse2 .cse1 (select v_ArrVal_1320 .cse1)))) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1321 Int) (v_ArrVal_1331 Int) (v_ArrVal_1330 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1320)) (.cse5 (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1321)) (.cse3 (select v_ArrVal_1330 0))) (or (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| .cse3) (< .cse3 0) (not (= v_ArrVal_1330 (store (store (select .cse4 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 .cse3) 4 (select v_ArrVal_1330 4)))) (= .cse3 0) (not (= (select .cse5 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)) (= (select (select (store .cse4 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1330) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3) 0) (= (select .cse5 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1319))) (store .cse6 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (store (store (select .cse6 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1331))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3)) 1)))))))) (forall ((v_ArrVal_1319 (Array Int Int))) (or (not (= v_ArrVal_1319 (store .cse0 .cse1 (select v_ArrVal_1319 .cse1)))) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_create_~head~0#1.offset_52| Int) (v_ArrVal_1321 Int) (v_ArrVal_1331 Int)) (let ((.cse7 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1319))) (store .cse8 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (store (store (select .cse8 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1331))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_circular_create_~head~0#1.offset_52|))) (or (= (select |c_#valid| .cse7) 1) (< |v_ULTIMATE.start_sll_circular_create_~head~0#1.offset_52| 0) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| .cse7) (not (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1321) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~head~0#1.offset_52|)))))) (or (not (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1321 Int) (v_ArrVal_1320 (Array Int Int)) (v_DerPreprocessor_19 Int) (v_ArrVal_1330 (Array Int Int))) (let ((.cse9 (select v_ArrVal_1330 0))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1321) (select (store .cse0 .cse1 v_DerPreprocessor_19) .cse9)) 1) (not (= (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 .cse9) 4 (select v_ArrVal_1330 4)) v_ArrVal_1330)) (not (= v_ArrVal_1320 (store .cse2 .cse1 (select v_ArrVal_1320 .cse1)))) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| .cse9) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (< .cse9 0) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1320) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1330) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse9) 0))))))) is different from false [2024-11-22 19:04:42,965 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 20 [2024-11-22 19:04:42,970 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:04:42,973 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 34 treesize of output 30 [2024-11-22 19:04:42,976 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:04:42,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:04:42,982 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 2 case distinctions, treesize of input 50 treesize of output 49 [2024-11-22 19:04:42,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:04:42,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 39 [2024-11-22 19:04:43,000 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 33 treesize of output 25 [2024-11-22 19:04:43,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:04:43,012 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 12 treesize of output 16 [2024-11-22 19:04:43,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:04:43,102 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 110 treesize of output 114 [2024-11-22 19:04:43,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:04:43,128 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 82 treesize of output 86 [2024-11-22 19:04:43,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2024-11-22 19:04:43,160 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:04:43,160 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:04:43,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 122 treesize of output 114 [2024-11-22 19:04:43,297 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:04:43,300 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:04:43,302 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:04:43,304 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:04:43,304 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:04:43,347 INFO L349 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2024-11-22 19:04:43,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 90 [2024-11-22 19:04:43,419 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:04:43,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:04:43,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 80 [2024-11-22 19:04:43,512 INFO L349 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2024-11-22 19:04:43,513 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 220 treesize of output 192 [2024-11-22 19:04:43,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:04:43,839 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 153 treesize of output 155 [2024-11-22 19:04:43,854 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:04:43,879 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 951 treesize of output 931 [2024-11-22 19:04:45,322 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-22 19:04:45,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017492987] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 19:04:45,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 19:04:45,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 20] total 59 [2024-11-22 19:04:45,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822462021] [2024-11-22 19:04:45,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 19:04:45,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-11-22 19:04:45,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:04:45,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-11-22 19:04:45,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3194, Unknown=40, NotChecked=114, Total=3540 [2024-11-22 19:04:45,324 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 60 states, 59 states have (on average 2.1016949152542375) internal successors, (124), 60 states have internal predecessors, (124), 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-22 19:05:00,189 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse3 (select .cse11 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0))) (let ((.cse2 (= (select |c_#valid| .cse4) 1)) (.cse0 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse4)) (.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0)) (.cse5 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse3)) (.cse6 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0))) (and (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| Int)) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| 1) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1)) (or (and .cse0 .cse1) (and (or .cse2 (= .cse3 .cse4)) (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_31| Int)) (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_31|) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_31|) 0) 0))))) (or (and (or .cse2 .cse0) .cse1) .cse5) (or .cse1 .cse5) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1321 Int)) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| 1) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1321) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) .cse6) (<= (select |c_#length| .cse3) 8) (or (< |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1321 Int) (v_ArrVal_1331 Int)) (let ((.cse7 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 v_ArrVal_1331)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= 1 (select |c_#valid| .cse7)) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| .cse7) (not (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1321) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1)))))) (<= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) .cse6 (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1321 Int)) (let ((.cse9 (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1321))) (or (forall ((v_ArrVal_1331 Int) (v_ArrVal_1330 (Array Int Int))) (let ((.cse8 (select v_ArrVal_1330 0))) (or (not (= (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 (select v_ArrVal_1330 4)) v_ArrVal_1330)) (< .cse8 0) (= .cse8 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1330) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse8) 0) (= (select .cse9 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 v_ArrVal_1331)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse8)) 1)))) (not (= (select .cse9 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1))))) (or .cse6 (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1321 Int) (v_arrayElimCell_101 Int)) (let ((.cse10 (store (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| 1) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1321))) (or (= (select .cse10 v_arrayElimCell_101) 1) (= (select .cse10 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1321 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) (not (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1)) (forall ((v_ArrVal_1330 (Array Int Int))) (let ((.cse12 (select v_ArrVal_1330 0))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1321) (select .cse11 .cse12)) 1) (not (= (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 (select v_ArrVal_1330 4)) v_ArrVal_1330)) (< .cse12 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1330) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse12) 0))))))))))) is different from false [2024-11-22 19:05:03,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:03,077 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2024-11-22 19:05:03,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-22 19:05:03,077 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 2.1016949152542375) internal successors, (124), 60 states have internal predecessors, (124), 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 43 [2024-11-22 19:05:03,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:03,077 INFO L225 Difference]: With dead ends: 80 [2024-11-22 19:05:03,077 INFO L226 Difference]: Without dead ends: 80 [2024-11-22 19:05:03,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=397, Invalid=5112, Unknown=49, NotChecked=294, Total=5852 [2024-11-22 19:05:03,079 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 44 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 1895 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 2030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:03,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 723 Invalid, 2030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1895 Invalid, 0 Unknown, 121 Unchecked, 3.0s Time] [2024-11-22 19:05:03,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-22 19:05:03,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2024-11-22 19:05:03,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 72 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-22 19:05:03,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2024-11-22 19:05:03,081 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 43 [2024-11-22 19:05:03,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:03,081 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2024-11-22 19:05:03,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 2.1016949152542375) internal successors, (124), 60 states have internal predecessors, (124), 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-22 19:05:03,081 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2024-11-22 19:05:03,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-22 19:05:03,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:03,081 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:03,090 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-22 19:05:03,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:05:03,282 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-22 19:05:03,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:03,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728483, now seen corresponding path program 2 times [2024-11-22 19:05:03,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:03,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464630597] [2024-11-22 19:05:03,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 19:05:03,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:03,314 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 19:05:03,315 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 19:05:05,286 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 19:05:05,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:05,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464630597] [2024-11-22 19:05:05,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464630597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:05:05,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901678032] [2024-11-22 19:05:05,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 19:05:05,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:05:05,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:05:05,287 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-22 19:05:05,288 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-22 19:05:05,409 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 19:05:05,410 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 19:05:05,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-22 19:05:05,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:05:05,438 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-22 19:05:05,445 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-22 19:05:05,608 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 19:05:05,608 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-22 19:05:05,628 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 19:05:05,628 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-22 19:05:05,723 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-22 19:05:05,729 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-22 19:05:05,799 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-22 19:05:05,804 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-22 19:05:05,896 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-22 19:05:05,896 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 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-22 19:05:06,012 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-22 19:05:06,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 37 [2024-11-22 19:05:06,056 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-22 19:05:06,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2024-11-22 19:05:06,162 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-22 19:05:06,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 61 [2024-11-22 19:05:06,171 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-22 19:05:06,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 33 [2024-11-22 19:05:06,410 INFO L349 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2024-11-22 19:05:06,411 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 3 case distinctions, treesize of input 103 treesize of output 84 [2024-11-22 19:05:06,456 INFO L349 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2024-11-22 19:05:06,456 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 48 [2024-11-22 19:05:07,604 INFO L349 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2024-11-22 19:05:07,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 223 treesize of output 177 [2024-11-22 19:05:07,618 INFO L349 Elim1Store]: treesize reduction 140, result has 0.7 percent of original size [2024-11-22 19:05:07,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 230 treesize of output 213 [2024-11-22 19:05:08,802 INFO L349 Elim1Store]: treesize reduction 142, result has 33.3 percent of original size [2024-11-22 19:05:08,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 137 treesize of output 139 [2024-11-22 19:05:08,929 INFO L349 Elim1Store]: treesize reduction 134, result has 34.6 percent of original size [2024-11-22 19:05:08,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 96 treesize of output 123 [2024-11-22 19:05:10,783 INFO L349 Elim1Store]: treesize reduction 8, result has 93.4 percent of original size [2024-11-22 19:05:10,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 280 treesize of output 259 [2024-11-22 19:05:11,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:05:11,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 144 treesize of output 312 [2024-11-22 19:05:20,529 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 19:05:20,529 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:05:34,021 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_1527 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (.cse2 (select v_ArrVal_1527 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select .cse0 .cse1) .cse2)) (< .cse2 0) (not (= (store (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_1527 .cse4)) v_ArrVal_1527)) (< 0 (+ 5 (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1527) .cse5) .cse2)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1))))) (forall ((v_ArrVal_1527 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse9 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (.cse6 (select v_ArrVal_1527 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1527) .cse5) .cse6))) (or (< .cse6 0) (= .cse7 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_1528 Int)) (<= (+ .cse7 8) (select |c_#length| (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (store .cse8 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1528))) .cse5) .cse6)))) (not (= (store (select .cse9 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_1527 .cse4)) v_ArrVal_1527)) (= .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (forall ((v_ArrVal_1527 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse12 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (.cse10 (select v_ArrVal_1527 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1527) .cse5) .cse10))) (or (< .cse10 0) (= .cse11 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= (store (select .cse12 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_1527 .cse4)) v_ArrVal_1527)) (< 0 (+ 5 .cse11)) (= .cse10 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1527 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (.cse13 (select v_ArrVal_1527 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1527) .cse5) .cse13))) (or (< .cse13 0) (= .cse14 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= (store (select .cse15 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_1527 .cse4)) v_ArrVal_1527)) (< 0 (+ 5 .cse14)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_1527 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse19 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (.cse16 (select v_ArrVal_1527 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (< .cse16 0) (forall ((v_ArrVal_1528 Int)) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (let ((.cse18 (select .cse20 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse17 (store .cse20 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse18 .cse4 v_ArrVal_1528)))) (or (= (select (select .cse17 (select .cse18 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) .cse16) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (< (+ 7 (select (select (store .cse19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1527) .cse5) .cse16)) (select |c_#length| (select (select .cse17 .cse5) .cse16)))))))) (not (= (store (select .cse19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_1527 .cse4)) v_ArrVal_1527)) (= .cse16 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse23 (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_1527 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (.cse21 (select v_ArrVal_1527 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse22 (select (select (store .cse24 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1527) .cse5) .cse21))) (or (< .cse21 0) (= .cse22 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (< (+ 7 .cse22) (select |c_#length| (select (select |c_#memory_$Pointer$#1.base| .cse23) .cse21))) (not (= (store (select .cse24 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_1527 .cse4)) v_ArrVal_1527)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse23)))) (forall ((v_ArrVal_1527 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse28 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (.cse25 (select v_ArrVal_1527 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (< .cse25 0) (forall ((v_ArrVal_1528 Int)) (= (select (let ((.cse26 (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (select (store .cse26 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse27 .cse4 v_ArrVal_1528)) (select .cse27 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) .cse25) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (not (= (store (select .cse28 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_1527 .cse4)) v_ArrVal_1527)) (< 0 (+ 5 (select (select (store .cse28 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1527) .cse5) .cse25))) (= .cse25 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse30 (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (let ((.cse29 (select (select .cse30 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse29) (forall ((v_ArrVal_1527 (Array Int Int))) (let ((.cse31 (select v_ArrVal_1527 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse32 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select .cse30 .cse29) .cse31)) (< .cse31 0) (< (+ 7 (select (select (store .cse32 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1527) .cse5) .cse31)) (select |c_#length| (select (select |c_#memory_$Pointer$#1.base| .cse29) .cse31))) (not (= (store (select .cse32 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_1527 .cse4)) v_ArrVal_1527))))))))))) is different from false