./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:18:03,629 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:18:03,749 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:18:03,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:18:03,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:18:03,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:18:03,810 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:18:03,811 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:18:03,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:18:03,818 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:18:03,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:18:03,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:18:03,820 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:18:03,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:18:03,823 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:18:03,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:18:03,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:18:03,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:18:03,824 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:18:03,825 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:18:03,825 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:18:03,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:18:03,826 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:18:03,826 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:18:03,827 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:18:03,827 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:18:03,828 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:18:03,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:18:03,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:18:03,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:18:03,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:18:03,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:18:03,832 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:18:03,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:18:03,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:18:03,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:18:03,833 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:18:03,833 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:18:03,833 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 [2023-11-06 22:18:04,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:18:04,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:18:04,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:18:04,210 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:18:04,211 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:18:04,213 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2023-11-06 22:18:07,320 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:18:07,699 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:18:07,700 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2023-11-06 22:18:07,715 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/data/275303eef/c62b18a1bf5348d8b634dafa6e3de9dd/FLAG67a79a325 [2023-11-06 22:18:07,735 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/data/275303eef/c62b18a1bf5348d8b634dafa6e3de9dd [2023-11-06 22:18:07,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:18:07,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:18:07,753 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:18:07,753 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:18:07,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:18:07,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:18:07" (1/1) ... [2023-11-06 22:18:07,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2075fa39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:07, skipping insertion in model container [2023-11-06 22:18:07,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:18:07" (1/1) ... [2023-11-06 22:18:07,814 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:18:08,096 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:18:08,114 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:18:08,206 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:18:08,244 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:18:08,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:08 WrapperNode [2023-11-06 22:18:08,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:18:08,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:18:08,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:18:08,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:18:08,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:08" (1/1) ... [2023-11-06 22:18:08,269 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:08" (1/1) ... [2023-11-06 22:18:08,295 INFO L138 Inliner]: procedures = 122, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 99 [2023-11-06 22:18:08,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:18:08,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:18:08,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:18:08,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:18:08,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:08" (1/1) ... [2023-11-06 22:18:08,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:08" (1/1) ... [2023-11-06 22:18:08,313 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:08" (1/1) ... [2023-11-06 22:18:08,313 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:08" (1/1) ... [2023-11-06 22:18:08,322 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:08" (1/1) ... [2023-11-06 22:18:08,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:08" (1/1) ... [2023-11-06 22:18:08,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:08" (1/1) ... [2023-11-06 22:18:08,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:08" (1/1) ... [2023-11-06 22:18:08,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:18:08,335 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:18:08,335 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:18:08,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:18:08,337 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:08" (1/1) ... [2023-11-06 22:18:08,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:18:08,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:18:08,383 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:18:08,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:18:08,419 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-06 22:18:08,420 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-06 22:18:08,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:18:08,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:18:08,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:18:08,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:18:08,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:18:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:18:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:18:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:18:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:18:08,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:18:08,541 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:18:08,544 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:18:08,584 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-06 22:18:08,900 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:18:08,907 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:18:08,907 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-06 22:18:08,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:18:08 BoogieIcfgContainer [2023-11-06 22:18:08,909 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:18:08,928 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:18:08,928 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:18:08,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:18:08,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:18:07" (1/3) ... [2023-11-06 22:18:08,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4ffbcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:18:08, skipping insertion in model container [2023-11-06 22:18:08,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:08" (2/3) ... [2023-11-06 22:18:08,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4ffbcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:18:08, skipping insertion in model container [2023-11-06 22:18:08,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:18:08" (3/3) ... [2023-11-06 22:18:08,934 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2023-11-06 22:18:08,951 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:18:08,951 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2023-11-06 22:18:08,992 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:18:08,999 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@1f6de631, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:18:09,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2023-11-06 22:18:09,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 45 states have (on average 2.022222222222222) internal successors, (91), 81 states have internal predecessors, (91), 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) [2023-11-06 22:18:09,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-06 22:18:09,011 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:18:09,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-06 22:18:09,013 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-06 22:18:09,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:09,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2023-11-06 22:18:09,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:09,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389900026] [2023-11-06 22:18:09,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:09,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:09,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:18:09,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389900026] [2023-11-06 22:18:09,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389900026] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:09,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:09,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:18:09,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648092030] [2023-11-06 22:18:09,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:09,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:18:09,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:18:09,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:18:09,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:18:09,422 INFO L87 Difference]: Start difference. First operand has 83 states, 45 states have (on average 2.022222222222222) internal successors, (91), 81 states have internal predecessors, (91), 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) [2023-11-06 22:18:09,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:18:09,575 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2023-11-06 22:18:09,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:18:09,578 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 [2023-11-06 22:18:09,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:18:09,585 INFO L225 Difference]: With dead ends: 78 [2023-11-06 22:18:09,585 INFO L226 Difference]: Without dead ends: 72 [2023-11-06 22:18:09,587 INFO L412 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 [2023-11-06 22:18:09,591 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:18:09,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 94 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:18:09,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-06 22:18:09,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-11-06 22:18:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 41 states have (on average 1.829268292682927) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:09,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2023-11-06 22:18:09,628 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 4 [2023-11-06 22:18:09,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:18:09,629 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2023-11-06 22:18:09,629 INFO L496 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) [2023-11-06 22:18:09,629 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2023-11-06 22:18:09,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-06 22:18:09,629 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:18:09,630 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-06 22:18:09,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:18:09,630 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-06 22:18:09,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:09,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2023-11-06 22:18:09,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:09,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821167469] [2023-11-06 22:18:09,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:09,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:09,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:09,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:18:09,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821167469] [2023-11-06 22:18:09,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821167469] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:09,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:09,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:18:09,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885882737] [2023-11-06 22:18:09,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:09,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:18:09,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:18:09,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:18:09,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:18:09,792 INFO L87 Difference]: Start difference. First operand 72 states and 75 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) [2023-11-06 22:18:09,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:18:09,856 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2023-11-06 22:18:09,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:18:09,857 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 [2023-11-06 22:18:09,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:18:09,858 INFO L225 Difference]: With dead ends: 68 [2023-11-06 22:18:09,858 INFO L226 Difference]: Without dead ends: 68 [2023-11-06 22:18:09,859 INFO L412 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 [2023-11-06 22:18:09,861 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 21 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:18:09,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 87 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:18:09,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-06 22:18:09,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-06 22:18:09,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 67 states have internal predecessors, (71), 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) [2023-11-06 22:18:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2023-11-06 22:18:09,870 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 4 [2023-11-06 22:18:09,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:18:09,871 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2023-11-06 22:18:09,871 INFO L496 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) [2023-11-06 22:18:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2023-11-06 22:18:09,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 22:18:09,872 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:18:09,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:09,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:18:09,873 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-06 22:18:09,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:09,874 INFO L85 PathProgramCache]: Analyzing trace with hash -401980428, now seen corresponding path program 1 times [2023-11-06 22:18:09,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:09,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073887294] [2023-11-06 22:18:09,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:09,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:09,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:18:09,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073887294] [2023-11-06 22:18:09,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073887294] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:09,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:09,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:18:09,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935308436] [2023-11-06 22:18:09,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:09,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:18:09,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:18:09,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:18:09,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:18:09,976 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-11-06 22:18:10,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:18:10,036 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2023-11-06 22:18:10,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:18:10,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2023-11-06 22:18:10,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:18:10,038 INFO L225 Difference]: With dead ends: 66 [2023-11-06 22:18:10,038 INFO L226 Difference]: Without dead ends: 66 [2023-11-06 22:18:10,038 INFO L412 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 [2023-11-06 22:18:10,040 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 7 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:18:10,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 94 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:18:10,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-06 22:18:10,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-11-06 22:18:10,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 65 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) [2023-11-06 22:18:10,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2023-11-06 22:18:10,048 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 10 [2023-11-06 22:18:10,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:18:10,049 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2023-11-06 22:18:10,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-11-06 22:18:10,049 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2023-11-06 22:18:10,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 22:18:10,050 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:18:10,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:10,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:18:10,051 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-06 22:18:10,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:10,052 INFO L85 PathProgramCache]: Analyzing trace with hash -401980427, now seen corresponding path program 1 times [2023-11-06 22:18:10,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:10,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439563935] [2023-11-06 22:18:10,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:10,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:10,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:10,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:18:10,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439563935] [2023-11-06 22:18:10,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439563935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:10,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:10,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:18:10,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319581625] [2023-11-06 22:18:10,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:10,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:18:10,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:18:10,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:18:10,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:18:10,171 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-11-06 22:18:10,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:18:10,227 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2023-11-06 22:18:10,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:18:10,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2023-11-06 22:18:10,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:18:10,229 INFO L225 Difference]: With dead ends: 64 [2023-11-06 22:18:10,229 INFO L226 Difference]: Without dead ends: 64 [2023-11-06 22:18:10,230 INFO L412 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 [2023-11-06 22:18:10,231 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 5 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:18:10,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 97 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:18:10,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-06 22:18:10,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-11-06 22:18:10,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 63 states have internal predecessors, (67), 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) [2023-11-06 22:18:10,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2023-11-06 22:18:10,239 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 10 [2023-11-06 22:18:10,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:18:10,240 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2023-11-06 22:18:10,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-11-06 22:18:10,240 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2023-11-06 22:18:10,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 22:18:10,241 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:18:10,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:10,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:18:10,241 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-06 22:18:10,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:10,242 INFO L85 PathProgramCache]: Analyzing trace with hash -401981869, now seen corresponding path program 1 times [2023-11-06 22:18:10,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:10,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898824539] [2023-11-06 22:18:10,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:10,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:10,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:10,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:18:10,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898824539] [2023-11-06 22:18:10,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898824539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:10,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:10,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:18:10,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014511419] [2023-11-06 22:18:10,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:10,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:18:10,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:18:10,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:18:10,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:18:10,327 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-11-06 22:18:10,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:18:10,339 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2023-11-06 22:18:10,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:18:10,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2023-11-06 22:18:10,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:18:10,341 INFO L225 Difference]: With dead ends: 72 [2023-11-06 22:18:10,341 INFO L226 Difference]: Without dead ends: 72 [2023-11-06 22:18:10,341 INFO L412 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 [2023-11-06 22:18:10,342 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 7 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 122 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 [2023-11-06 22:18:10,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 122 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:18:10,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-06 22:18:10,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2023-11-06 22:18:10,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.619047619047619) 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) [2023-11-06 22:18:10,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2023-11-06 22:18:10,350 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 10 [2023-11-06 22:18:10,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:18:10,350 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2023-11-06 22:18:10,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-11-06 22:18:10,350 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2023-11-06 22:18:10,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 22:18:10,351 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:18:10,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:10,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:18:10,352 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-06 22:18:10,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:10,353 INFO L85 PathProgramCache]: Analyzing trace with hash 243865783, now seen corresponding path program 1 times [2023-11-06 22:18:10,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:10,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170437405] [2023-11-06 22:18:10,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:10,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:10,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:10,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:18:10,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170437405] [2023-11-06 22:18:10,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170437405] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:10,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:10,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:18:10,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160938800] [2023-11-06 22:18:10,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:10,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:18:10,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:18:10,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:18:10,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:18:10,625 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2023-11-06 22:18:10,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:18:10,743 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2023-11-06 22:18:10,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:18:10,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2023-11-06 22:18:10,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:18:10,749 INFO L225 Difference]: With dead ends: 70 [2023-11-06 22:18:10,750 INFO L226 Difference]: Without dead ends: 70 [2023-11-06 22:18:10,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:18:10,753 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 26 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:18:10,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 109 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:18:10,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-06 22:18:10,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2023-11-06 22:18:10,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 68 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) [2023-11-06 22:18:10,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2023-11-06 22:18:10,766 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2023-11-06 22:18:10,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:18:10,766 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2023-11-06 22:18:10,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2023-11-06 22:18:10,767 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2023-11-06 22:18:10,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 22:18:10,767 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:18:10,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:10,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:18:10,768 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-06 22:18:10,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:10,768 INFO L85 PathProgramCache]: Analyzing trace with hash 243865784, now seen corresponding path program 1 times [2023-11-06 22:18:10,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:10,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372820332] [2023-11-06 22:18:10,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:10,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:11,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:18:11,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372820332] [2023-11-06 22:18:11,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372820332] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:11,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:11,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:18:11,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445732187] [2023-11-06 22:18:11,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:11,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:18:11,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:18:11,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:18:11,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:18:11,007 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) [2023-11-06 22:18:11,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:18:11,184 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2023-11-06 22:18:11,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:18:11,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2023-11-06 22:18:11,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:18:11,186 INFO L225 Difference]: With dead ends: 70 [2023-11-06 22:18:11,186 INFO L226 Difference]: Without dead ends: 70 [2023-11-06 22:18:11,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:18:11,187 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 43 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:18:11,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 139 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:18:11,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-06 22:18:11,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2023-11-06 22:18:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.565217391304348) internal successors, (72), 68 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) [2023-11-06 22:18:11,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2023-11-06 22:18:11,193 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 12 [2023-11-06 22:18:11,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:18:11,194 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2023-11-06 22:18:11,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) [2023-11-06 22:18:11,194 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2023-11-06 22:18:11,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 22:18:11,195 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:18:11,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:11,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:18:11,195 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-06 22:18:11,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:11,196 INFO L85 PathProgramCache]: Analyzing trace with hash -27720857, now seen corresponding path program 1 times [2023-11-06 22:18:11,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:11,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802682916] [2023-11-06 22:18:11,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:11,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:11,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:18:11,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802682916] [2023-11-06 22:18:11,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802682916] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:18:11,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7403654] [2023-11-06 22:18:11,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:11,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:18:11,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:18:11,301 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:18:11,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:18:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:11,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:18:11,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:11,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:11,489 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:18:11,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:11,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7403654] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:18:11,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:18:11,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-06 22:18:11,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434105317] [2023-11-06 22:18:11,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:18:11,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:18:11,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:18:11,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:18:11,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:18:11,532 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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) [2023-11-06 22:18:11,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:18:11,557 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2023-11-06 22:18:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:18:11,558 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 [2023-11-06 22:18:11,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:18:11,559 INFO L225 Difference]: With dead ends: 87 [2023-11-06 22:18:11,559 INFO L226 Difference]: Without dead ends: 87 [2023-11-06 22:18:11,560 INFO L412 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 [2023-11-06 22:18:11,560 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 16 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 242 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 [2023-11-06 22:18:11,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 242 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:18:11,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-06 22:18:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2023-11-06 22:18:11,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.5) internal successors, (90), 82 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:11,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2023-11-06 22:18:11,581 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 16 [2023-11-06 22:18:11,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:18:11,582 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2023-11-06 22:18:11,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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) [2023-11-06 22:18:11,582 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2023-11-06 22:18:11,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 22:18:11,583 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:18:11,584 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:11,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:18:11,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-06 22:18:11,792 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-06 22:18:11,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:11,792 INFO L85 PathProgramCache]: Analyzing trace with hash -868554549, now seen corresponding path program 1 times [2023-11-06 22:18:11,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:11,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683811277] [2023-11-06 22:18:11,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:11,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:12,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:12,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:18:12,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683811277] [2023-11-06 22:18:12,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683811277] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:18:12,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671868711] [2023-11-06 22:18:12,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:12,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:18:12,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:18:12,023 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:18:12,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:18:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:12,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 22:18:12,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:12,238 INFO L351 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 [2023-11-06 22:18:12,324 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:18:12,325 INFO L351 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 [2023-11-06 22:18:12,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:12,336 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:18:12,475 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:12,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671868711] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:18:12,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:18:12,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2023-11-06 22:18:12,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535399819] [2023-11-06 22:18:12,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:18:12,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:18:12,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:18:12,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:18:12,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:18:12,479 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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) [2023-11-06 22:18:12,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:18:12,620 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2023-11-06 22:18:12,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:18:12,621 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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 18 [2023-11-06 22:18:12,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:18:12,622 INFO L225 Difference]: With dead ends: 81 [2023-11-06 22:18:12,622 INFO L226 Difference]: Without dead ends: 81 [2023-11-06 22:18:12,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:18:12,623 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 14 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:18:12,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 144 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:18:12,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-06 22:18:12,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-06 22:18:12,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 80 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:12,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2023-11-06 22:18:12,629 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 18 [2023-11-06 22:18:12,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:18:12,629 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2023-11-06 22:18:12,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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) [2023-11-06 22:18:12,630 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2023-11-06 22:18:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 22:18:12,630 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:18:12,631 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:12,642 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:18:12,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:18:12,837 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-06 22:18:12,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:12,838 INFO L85 PathProgramCache]: Analyzing trace with hash -868554548, now seen corresponding path program 1 times [2023-11-06 22:18:12,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:12,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769042507] [2023-11-06 22:18:12,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:12,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:13,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:13,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:18:13,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769042507] [2023-11-06 22:18:13,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769042507] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:18:13,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260622959] [2023-11-06 22:18:13,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:13,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:18:13,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:18:13,041 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:18:13,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:18:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:13,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-06 22:18:13,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:13,204 INFO L351 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 [2023-11-06 22:18:13,209 INFO L351 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 [2023-11-06 22:18:13,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:18:13,322 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 22:18:13,331 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:18:13,331 INFO L351 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 [2023-11-06 22:18:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:13,361 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:18:13,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:13,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260622959] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:18:13,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:18:13,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2023-11-06 22:18:13,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234825464] [2023-11-06 22:18:13,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:18:13,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:18:13,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:18:13,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:18:13,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:18:13,624 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 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) [2023-11-06 22:18:13,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:18:13,930 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2023-11-06 22:18:13,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:18:13,931 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 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 18 [2023-11-06 22:18:13,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:18:13,931 INFO L225 Difference]: With dead ends: 79 [2023-11-06 22:18:13,932 INFO L226 Difference]: Without dead ends: 79 [2023-11-06 22:18:13,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:18:13,933 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 20 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:18:13,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 223 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:18:13,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-06 22:18:13,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-06 22:18:13,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 78 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) [2023-11-06 22:18:13,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2023-11-06 22:18:13,937 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 18 [2023-11-06 22:18:13,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:18:13,937 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2023-11-06 22:18:13,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 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) [2023-11-06 22:18:13,938 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2023-11-06 22:18:13,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 22:18:13,939 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:18:13,940 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:13,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:18:14,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:18:14,147 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-06 22:18:14,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:14,147 INFO L85 PathProgramCache]: Analyzing trace with hash 140768543, now seen corresponding path program 1 times [2023-11-06 22:18:14,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:14,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578861807] [2023-11-06 22:18:14,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:14,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:14,353 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-06 22:18:14,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:18:14,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578861807] [2023-11-06 22:18:14,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578861807] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:14,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:14,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:18:14,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839492014] [2023-11-06 22:18:14,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:14,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:18:14,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:18:14,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:18:14,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:18:14,356 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:18:14,526 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2023-11-06 22:18:14,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:18:14,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-11-06 22:18:14,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:18:14,528 INFO L225 Difference]: With dead ends: 94 [2023-11-06 22:18:14,528 INFO L226 Difference]: Without dead ends: 94 [2023-11-06 22:18:14,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:18:14,529 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 76 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:18:14,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 103 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:18:14,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-06 22:18:14,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 76. [2023-11-06 22:18:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 75 states have internal predecessors, (80), 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) [2023-11-06 22:18:14,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2023-11-06 22:18:14,533 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 37 [2023-11-06 22:18:14,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:18:14,533 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2023-11-06 22:18:14,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:14,534 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2023-11-06 22:18:14,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 22:18:14,535 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:18:14,535 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:14,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:18:14,536 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-06 22:18:14,536 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:14,536 INFO L85 PathProgramCache]: Analyzing trace with hash 140768544, now seen corresponding path program 1 times [2023-11-06 22:18:14,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:14,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682335861] [2023-11-06 22:18:14,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:14,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:14,920 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 22:18:14,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:18:14,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682335861] [2023-11-06 22:18:14,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682335861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:14,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:14,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:18:14,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993599354] [2023-11-06 22:18:14,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:14,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:18:14,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:18:14,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:18:14,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:18:14,923 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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) [2023-11-06 22:18:15,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:18:15,100 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2023-11-06 22:18:15,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:18:15,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 [2023-11-06 22:18:15,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:18:15,101 INFO L225 Difference]: With dead ends: 84 [2023-11-06 22:18:15,101 INFO L226 Difference]: Without dead ends: 84 [2023-11-06 22:18:15,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:18:15,102 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 64 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:18:15,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 113 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:18:15,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-06 22:18:15,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2023-11-06 22:18:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.296875) internal successors, (83), 78 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) [2023-11-06 22:18:15,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2023-11-06 22:18:15,106 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 37 [2023-11-06 22:18:15,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:18:15,106 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2023-11-06 22:18:15,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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) [2023-11-06 22:18:15,106 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2023-11-06 22:18:15,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 22:18:15,107 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:18:15,108 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:15,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:18:15,108 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-06 22:18:15,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:15,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1658160837, now seen corresponding path program 1 times [2023-11-06 22:18:15,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:15,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284401592] [2023-11-06 22:18:15,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:15,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:18:16,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:18:16,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284401592] [2023-11-06 22:18:16,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284401592] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:18:16,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882961159] [2023-11-06 22:18:16,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:16,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:18:16,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:18:16,276 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:18:16,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:18:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:16,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-06 22:18:16,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:16,668 INFO L351 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 [2023-11-06 22:18:16,784 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:18:16,784 INFO L351 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 [2023-11-06 22:18:16,855 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:18:16,911 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:18:17,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:18:17,045 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-06 22:18:17,090 INFO L351 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 [2023-11-06 22:18:17,201 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:18:17,202 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:18:17,447 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:18:17,447 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 32 [2023-11-06 22:18:17,462 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:18:17,462 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 144 [2023-11-06 22:18:17,474 INFO L351 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 154 treesize of output 146 [2023-11-06 22:18:17,754 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2023-11-06 22:18:18,162 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:18:18,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882961159] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:18:18,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:18:18,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2023-11-06 22:18:18,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705612467] [2023-11-06 22:18:18,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:18:18,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-06 22:18:18,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:18:18,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-06 22:18:18,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=821, Unknown=13, NotChecked=0, Total=930 [2023-11-06 22:18:18,166 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 31 states, 31 states have (on average 2.903225806451613) internal successors, (90), 31 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:19,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:18:19,128 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2023-11-06 22:18:19,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:18:19,129 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.903225806451613) internal successors, (90), 31 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-11-06 22:18:19,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:18:19,129 INFO L225 Difference]: With dead ends: 79 [2023-11-06 22:18:19,130 INFO L226 Difference]: Without dead ends: 79 [2023-11-06 22:18:19,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=282, Invalid=1511, Unknown=13, NotChecked=0, Total=1806 [2023-11-06 22:18:19,131 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 35 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:18:19,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 804 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:18:19,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-06 22:18:19,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-06 22:18:19,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.28125) internal successors, (82), 78 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) [2023-11-06 22:18:19,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2023-11-06 22:18:19,135 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 41 [2023-11-06 22:18:19,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:18:19,136 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2023-11-06 22:18:19,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.903225806451613) internal successors, (90), 31 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:19,136 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2023-11-06 22:18:19,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-06 22:18:19,137 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:18:19,138 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:19,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:18:19,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:18:19,338 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-06 22:18:19,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:19,339 INFO L85 PathProgramCache]: Analyzing trace with hash -56889687, now seen corresponding path program 1 times [2023-11-06 22:18:19,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:19,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264878302] [2023-11-06 22:18:19,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:19,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:19,613 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-06 22:18:19,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:18:19,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264878302] [2023-11-06 22:18:19,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264878302] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:19,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:19,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:18:19,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76152300] [2023-11-06 22:18:19,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:19,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:18:19,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:18:19,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:18:19,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:18:19,616 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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) [2023-11-06 22:18:19,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:18:19,858 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2023-11-06 22:18:19,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:18:19,859 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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 [2023-11-06 22:18:19,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:18:19,860 INFO L225 Difference]: With dead ends: 98 [2023-11-06 22:18:19,860 INFO L226 Difference]: Without dead ends: 98 [2023-11-06 22:18:19,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:18:19,861 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 96 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:18:19,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 114 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:18:19,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-06 22:18:19,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 77. [2023-11-06 22:18:19,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 64 states have (on average 1.25) internal successors, (80), 76 states have internal predecessors, (80), 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) [2023-11-06 22:18:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2023-11-06 22:18:19,865 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 43 [2023-11-06 22:18:19,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:18:19,866 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2023-11-06 22:18:19,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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) [2023-11-06 22:18:19,866 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2023-11-06 22:18:19,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-06 22:18:19,867 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:18:19,868 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:19,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:18:19,868 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-06 22:18:19,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:19,869 INFO L85 PathProgramCache]: Analyzing trace with hash -56889686, now seen corresponding path program 1 times [2023-11-06 22:18:19,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:19,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688918863] [2023-11-06 22:18:19,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:19,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:19,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:20,265 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 22:18:20,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:18:20,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688918863] [2023-11-06 22:18:20,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688918863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:20,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:20,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:18:20,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834890567] [2023-11-06 22:18:20,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:20,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:18:20,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:18:20,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:18:20,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:18:20,268 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 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) [2023-11-06 22:18:20,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:18:20,488 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2023-11-06 22:18:20,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:18:20,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 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 [2023-11-06 22:18:20,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:18:20,489 INFO L225 Difference]: With dead ends: 80 [2023-11-06 22:18:20,490 INFO L226 Difference]: Without dead ends: 80 [2023-11-06 22:18:20,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:18:20,491 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 71 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:18:20,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 122 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:18:20,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-06 22:18:20,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2023-11-06 22:18:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.21875) internal successors, (78), 74 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:20,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2023-11-06 22:18:20,494 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 43 [2023-11-06 22:18:20,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:18:20,494 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2023-11-06 22:18:20,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 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) [2023-11-06 22:18:20,495 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2023-11-06 22:18:20,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-06 22:18:20,496 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:18:20,496 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:20,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:18:20,496 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-06 22:18:20,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:20,497 INFO L85 PathProgramCache]: Analyzing trace with hash -56889649, now seen corresponding path program 1 times [2023-11-06 22:18:20,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:20,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826907416] [2023-11-06 22:18:20,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:20,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:21,852 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:18:21,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:18:21,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826907416] [2023-11-06 22:18:21,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826907416] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:18:21,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664045993] [2023-11-06 22:18:21,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:21,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:18:21,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:18:21,854 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:18:21,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:18:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:22,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-06 22:18:22,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:22,158 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:18:22,158 INFO L351 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 [2023-11-06 22:18:22,179 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 22:18:22,180 INFO L351 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 [2023-11-06 22:18:22,253 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-06 22:18:22,254 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-11-06 22:18:22,288 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:18:22,327 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2023-11-06 22:18:22,357 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:18:22,358 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-06 22:18:22,452 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-06 22:18:22,493 INFO L351 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 [2023-11-06 22:18:22,589 INFO L351 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 [2023-11-06 22:18:22,601 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 22:18:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:18:22,609 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:18:22,709 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1393 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1393) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 1)) is different from false [2023-11-06 22:18:22,721 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1393 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1393) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) 1)) is different from false [2023-11-06 22:18:22,741 INFO L322 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2023-11-06 22:18:22,742 INFO L351 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 24 treesize of output 23 [2023-11-06 22:18:22,813 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1393 (Array Int Int)) (v_ArrVal_1392 (Array Int Int)) (v_ArrVal_1391 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1391) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1392) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1393) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1391 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1391)))) is different from false [2023-11-06 22:18:22,824 INFO L351 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 142 treesize of output 140 [2023-11-06 22:18:22,832 INFO L351 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 24 treesize of output 16 [2023-11-06 22:18:22,849 INFO L351 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 [2023-11-06 22:18:23,114 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-06 22:18:23,114 INFO L351 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 16 treesize of output 15 [2023-11-06 22:18:23,124 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 10 not checked. [2023-11-06 22:18:23,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664045993] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:18:23,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:18:23,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 15] total 39 [2023-11-06 22:18:23,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891012385] [2023-11-06 22:18:23,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:18:23,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-06 22:18:23,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:18:23,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-06 22:18:23,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1195, Unknown=9, NotChecked=216, Total=1560 [2023-11-06 22:18:23,127 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 40 states, 39 states have (on average 2.769230769230769) internal successors, (108), 40 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:24,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:18:24,208 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2023-11-06 22:18:24,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:18:24,209 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.769230769230769) internal successors, (108), 40 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-11-06 22:18:24,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:18:24,210 INFO L225 Difference]: With dead ends: 89 [2023-11-06 22:18:24,210 INFO L226 Difference]: Without dead ends: 89 [2023-11-06 22:18:24,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=322, Invalid=1937, Unknown=9, NotChecked=282, Total=2550 [2023-11-06 22:18:24,212 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 106 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 200 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:18:24,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 394 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 679 Invalid, 0 Unknown, 200 Unchecked, 0.5s Time] [2023-11-06 22:18:24,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-06 22:18:24,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2023-11-06 22:18:24,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2023-11-06 22:18:24,216 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 43 [2023-11-06 22:18:24,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:18:24,216 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2023-11-06 22:18:24,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.769230769230769) internal successors, (108), 40 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:24,217 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2023-11-06 22:18:24,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-06 22:18:24,218 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:18:24,218 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:24,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:18:24,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-06 22:18:24,425 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-06 22:18:24,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:24,426 INFO L85 PathProgramCache]: Analyzing trace with hash -56889648, now seen corresponding path program 1 times [2023-11-06 22:18:24,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:24,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080148492] [2023-11-06 22:18:24,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:24,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:26,580 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:26,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:18:26,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080148492] [2023-11-06 22:18:26,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080148492] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:18:26,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726944376] [2023-11-06 22:18:26,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:26,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:18:26,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:18:26,584 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:18:26,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:18:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:26,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 76 conjunts are in the unsatisfiable core [2023-11-06 22:18:26,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:26,927 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:18:26,927 INFO L351 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 [2023-11-06 22:18:26,968 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 22:18:26,968 INFO L351 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 [2023-11-06 22:18:27,111 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-06 22:18:27,111 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-11-06 22:18:27,180 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:18:27,192 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:18:27,272 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2023-11-06 22:18:27,289 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2023-11-06 22:18:27,313 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:18:27,314 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-06 22:18:27,322 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-06 22:18:27,474 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-06 22:18:27,479 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:18:27,551 INFO L351 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 19 treesize of output 18 [2023-11-06 22:18:27,562 INFO L351 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 [2023-11-06 22:18:27,757 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:18:27,758 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 22:18:27,770 INFO L351 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 [2023-11-06 22:18:27,790 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 22:18:27,797 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-06 22:18:27,862 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:18:27,863 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:18:28,360 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:18:28,361 INFO L351 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 55 treesize of output 59 [2023-11-06 22:18:28,756 INFO L351 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 142 treesize of output 140 [2023-11-06 22:18:28,772 INFO L351 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 [2023-11-06 22:18:28,781 INFO L351 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 24 treesize of output 16 [2023-11-06 22:18:28,786 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:18:28,787 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:18:28,789 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-11-06 22:18:28,795 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:18:28,797 INFO L351 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 [2023-11-06 22:18:28,800 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:18:28,801 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:18:28,803 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-11-06 22:18:28,810 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2023-11-06 22:18:29,303 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-06 22:18:29,304 INFO L351 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 16 treesize of output 15 [2023-11-06 22:18:29,352 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:18:29,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726944376] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:18:29,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:18:29,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 16] total 47 [2023-11-06 22:18:29,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071271616] [2023-11-06 22:18:29,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:18:29,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-06 22:18:29,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:18:29,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-06 22:18:29,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2078, Unknown=4, NotChecked=0, Total=2256 [2023-11-06 22:18:29,356 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 48 states, 47 states have (on average 2.3617021276595747) internal successors, (111), 48 states have internal predecessors, (111), 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) [2023-11-06 22:18:31,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:18:31,833 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2023-11-06 22:18:31,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 22:18:31,840 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.3617021276595747) internal successors, (111), 48 states have internal predecessors, (111), 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 [2023-11-06 22:18:31,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:18:31,841 INFO L225 Difference]: With dead ends: 100 [2023-11-06 22:18:31,841 INFO L226 Difference]: Without dead ends: 100 [2023-11-06 22:18:31,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1147 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=572, Invalid=3980, Unknown=4, NotChecked=0, Total=4556 [2023-11-06 22:18:31,844 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 205 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:18:31,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 382 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:18:31,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-06 22:18:31,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2023-11-06 22:18:31,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 79 states have internal predecessors, (85), 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) [2023-11-06 22:18:31,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2023-11-06 22:18:31,848 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 43 [2023-11-06 22:18:31,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:18:31,848 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2023-11-06 22:18:31,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.3617021276595747) internal successors, (111), 48 states have internal predecessors, (111), 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) [2023-11-06 22:18:31,849 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2023-11-06 22:18:31,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-06 22:18:31,850 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:18:31,850 INFO L195 NwaCegarLoop]: trace histogram [4, 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, 1, 1] [2023-11-06 22:18:31,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:18:32,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-06 22:18:32,057 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-06 22:18:32,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:32,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1550719723, now seen corresponding path program 1 times [2023-11-06 22:18:32,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:18:32,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684327411] [2023-11-06 22:18:32,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:32,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:18:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:36,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:18:36,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684327411] [2023-11-06 22:18:36,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684327411] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:18:36,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682054681] [2023-11-06 22:18:36,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:36,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:18:36,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:18:36,073 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:18:36,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b89f18-3936-4477-82ef-985163b178d7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:18:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:36,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 98 conjunts are in the unsatisfiable core [2023-11-06 22:18:36,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:36,572 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 22:18:36,577 INFO L351 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 [2023-11-06 22:18:36,816 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-06 22:18:36,816 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-11-06 22:18:36,985 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:18:37,107 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:18:37,356 INFO L322 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-06 22:18:37,356 INFO L351 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 21 treesize of output 25 [2023-11-06 22:18:37,493 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:18:37,508 INFO L351 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 11 treesize of output 7 [2023-11-06 22:18:37,524 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:18:37,644 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:18:37,654 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2023-11-06 22:18:37,665 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2023-11-06 22:18:37,708 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:18:37,709 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 74 [2023-11-06 22:18:37,716 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-06 22:18:37,725 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-11-06 22:18:38,002 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-11-06 22:18:38,009 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:18:38,018 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 22:18:38,049 INFO L351 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 [2023-11-06 22:18:38,053 INFO L351 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 20 treesize of output 15 [2023-11-06 22:18:38,061 INFO L351 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 19 treesize of output 18 [2023-11-06 22:18:38,372 INFO L351 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 20 treesize of output 15 [2023-11-06 22:18:38,376 INFO L351 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 [2023-11-06 22:18:38,390 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 22:18:38,414 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:18:38,415 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-11-06 22:18:38,421 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-06 22:18:38,653 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:38,653 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:18:39,466 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1907) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1914) .cse2) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1907) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) |c_ULTIMATE.start_main_~data_init~0#1|)))))) is different from false [2023-11-06 22:18:39,509 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1903 Int) (v_ArrVal_1901 (Array Int Int)) (v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse0 .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1914) .cse2) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1901) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1907) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (forall ((v_ArrVal_1903 Int) (v_ArrVal_1901 (Array Int Int)) (v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1901) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1907) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse0 .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1914) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)) .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse4)))))) is different from false [2023-11-06 22:18:39,661 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse2 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (forall ((v_ArrVal_1898 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1898 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1898)) (forall ((v_ArrVal_1899 (Array Int Int))) (or (forall ((v_ArrVal_1903 Int) (v_ArrVal_1901 (Array Int Int)) (v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (let ((.cse1 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1898) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1914) .cse1) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1899) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1901) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1907) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1899 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1899)))))) (forall ((v_ArrVal_1898 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1898 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1898)) (forall ((v_ArrVal_1899 (Array Int Int))) (or (forall ((v_ArrVal_1903 Int) (v_ArrVal_1901 (Array Int Int)) (v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (let ((.cse5 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1899) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1901) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1907) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse5) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1914) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1898) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)) .cse5) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1899 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1899)))))))) is different from false [2023-11-06 22:18:39,704 INFO L351 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 226 treesize of output 224 [2023-11-06 22:18:39,712 INFO L351 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 210 treesize of output 202 [2023-11-06 22:18:39,723 INFO L351 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 735 treesize of output 733 [2023-11-06 22:18:39,739 INFO L351 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 215 treesize of output 199 [2023-11-06 22:18:39,751 INFO L351 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 74 treesize of output 70 [2023-11-06 22:18:39,770 INFO L351 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 95 treesize of output 87 [2023-11-06 22:18:40,776 INFO L351 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 283 treesize of output 281 [2023-11-06 22:18:40,785 INFO L351 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 267 treesize of output 251 [2023-11-06 22:18:40,796 INFO L351 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 125 treesize of output 117 [2023-11-06 22:18:40,808 INFO L351 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 662 treesize of output 660 [2023-11-06 22:18:40,819 INFO L351 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 154 treesize of output 146 [2023-11-06 22:18:40,830 INFO L351 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 70 treesize of output 66 [2023-11-06 22:19:44,854 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse18 (not .cse6)) (.cse26 (forall ((v_ArrVal_1906 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_ArrVal_1914 (Array Int Int))) (or (= v_arrayElimCell_98 0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1914) v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|)))) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse23 (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_103 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse52 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1914))) (or (= (select (select .cse52 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_100) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse52 v_arrayElimCell_100) v_arrayElimCell_103)))))) (.cse12 (forall ((v_ArrVal_1903 Int) (v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (or (= v_arrayElimCell_96 0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1914) v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|)))) (.cse28 (forall ((v_arrayElimCell_96 Int)) (or (= v_arrayElimCell_96 0) (forall ((v_arrayElimCell_98 Int)) (or (= v_arrayElimCell_98 0) (forall ((v_ArrVal_1906 (Array Int Int)) (v_arrayElimCell_97 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse51 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1914))) (or (forall ((v_arrayElimCell_94 Int)) (= (select (select .cse51 v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|)) (= (select (select .cse51 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (.cse29 (or .cse6 .cse26)) (.cse24 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_98 Int)) (or (= v_arrayElimCell_98 0) (forall ((v_ArrVal_1906 (Array Int Int)) (v_arrayElimCell_97 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse50 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1914))) (or (forall ((v_arrayElimCell_94 Int)) (= (select (select .cse50 v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|)) (= (select (select .cse50 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse10 (or (forall ((v_ArrVal_1903 Int) (v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_ArrVal_1897 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse49 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1914))) (or (= v_arrayElimCell_96 0) (= (select (select .cse49 v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse49 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse18)) (.cse14 (forall ((v_ArrVal_1903 Int) (v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (let ((.cse48 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1914))) (or (= v_arrayElimCell_96 0) (= (select (select .cse48 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse48 v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|))))) (.cse15 (forall ((v_arrayElimCell_96 Int)) (or (= v_arrayElimCell_96 0) (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse47 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1914))) (or (= (select (select .cse47 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_94 Int)) (= (select (select .cse47 v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|)) (= (select (select .cse47 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse16 (forall ((v_arrayElimCell_96 Int)) (or (= v_arrayElimCell_96 0) (forall ((v_ArrVal_1903 Int) (v_arrayElimCell_94 Int) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (let ((.cse46 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1914))) (or (= (select (select .cse46 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse46 v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse17 (forall ((v_arrayElimCell_96 Int)) (or (= v_arrayElimCell_96 0) (forall ((v_ArrVal_1903 Int) (v_arrayElimCell_94 Int) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1914) v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|))))) (.cse20 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (.cse7 (forall ((v_arrayElimCell_101 Int) (v_arrayElimCell_104 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimCell_101) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1914) v_arrayElimCell_101) v_arrayElimCell_104))))) (.cse4 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)))) (and (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_arrayElimCell_101 Int) (v_arrayElimCell_104 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1914))) (or (= (select (select .cse0 v_arrayElimCell_101) v_arrayElimCell_104) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|) 0)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_101 Int) (v_arrayElimCell_104 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1914))) (or (forall ((v_arrayElimCell_103 Int)) (= (select (select .cse2 v_arrayElimCell_100) v_arrayElimCell_103) |c_ULTIMATE.start_main_~data_init~0#1|)) (= (select (select .cse2 v_arrayElimCell_101) v_arrayElimCell_104) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|) 0)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| Int)) (or (forall ((v_arrayElimCell_100 Int)) (or (forall ((v_arrayElimCell_101 Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimCell_101) (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_arrayElimCell_104 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1914))) (or (forall ((v_arrayElimCell_103 Int)) (= (select (select .cse3 v_arrayElimCell_100) v_arrayElimCell_103) |c_ULTIMATE.start_main_~data_init~0#1|)) (= (select (select .cse3 v_arrayElimCell_101) v_arrayElimCell_104) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimCell_100))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|) 0)))) (or .cse4 (and (forall ((v_arrayElimCell_100 Int)) (or (forall ((v_arrayElimCell_101 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimCell_101) (forall ((v_arrayElimCell_104 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1914))) (or (forall ((v_arrayElimCell_103 Int)) (= (select (select .cse5 v_arrayElimCell_100) v_arrayElimCell_103) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse5 v_arrayElimCell_101) v_arrayElimCell_104))))))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimCell_100))) (or .cse6 .cse7))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| Int)) (or (forall ((v_arrayElimCell_100 Int)) (or (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1914))) (or (forall ((v_arrayElimCell_103 Int)) (= (select (select .cse8 v_arrayElimCell_100) v_arrayElimCell_103) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimCell_100))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|) 0)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1914))) (or (forall ((v_arrayElimCell_103 Int)) (= (select (select .cse9 v_arrayElimCell_100) v_arrayElimCell_103) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|) 0)))) (or (and .cse10 (or .cse6 (forall ((v_arrayElimCell_96 Int)) (or (= v_arrayElimCell_96 0) (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1914))) (or (= (select (select .cse11 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_94 Int)) (= (select (select .cse11 v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) .cse12 (forall ((v_arrayElimCell_96 Int)) (or (= v_arrayElimCell_96 0) (forall ((v_arrayElimCell_98 Int)) (or (= v_arrayElimCell_98 0) (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_arrayElimCell_97 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1914))) (or (= (select (select .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_94 Int)) (= (select (select .cse13 v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|)) (= (select (select .cse13 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) .cse14 .cse15 .cse16 .cse17 (or .cse18 (forall ((v_arrayElimCell_96 Int)) (or (= v_arrayElimCell_96 0) (forall ((v_arrayElimCell_98 Int)) (or (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_arrayElimCell_97 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1914))) (or (forall ((v_arrayElimCell_94 Int)) (= (select (select .cse19 v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|)) (= (select (select .cse19 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_arrayElimCell_98 0))))))) .cse20) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1914) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|) 0)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_arrayElimCell_101 Int) (v_arrayElimCell_104 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1914))) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimCell_101) (= (select (select .cse21 v_arrayElimCell_101) v_arrayElimCell_104) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse21 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|) 0)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_arrayElimCell_100 Int) (v_arrayElimCell_101 Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimCell_101) (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_arrayElimCell_104 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (let ((.cse22 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1914))) (or (forall ((v_arrayElimCell_103 Int)) (= (select (select .cse22 v_arrayElimCell_100) v_arrayElimCell_103) |c_ULTIMATE.start_main_~data_init~0#1|)) (= (select (select .cse22 v_arrayElimCell_101) v_arrayElimCell_104) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse22 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|) 0)))) (or .cse23 .cse20) (or .cse4 (let ((.cse25 (forall ((v_ArrVal_1906 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_ArrVal_1914 (Array Int Int))) (or (= v_arrayElimCell_98 0) (= (select v_ArrVal_1914 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1914) v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|))))) (and (or .cse6 (and .cse24 .cse25 .cse26 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_98 Int)) (or (= v_arrayElimCell_98 0) (forall ((v_ArrVal_1906 (Array Int Int)) (v_arrayElimCell_97 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse27 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1914))) (or (= (select v_ArrVal_1914 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_94 Int)) (= (select (select .cse27 v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|)) (= (select (select .cse27 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (or (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (or (= v_arrayElimCell_96 0) (= (select v_ArrVal_1914 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1914) v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse18) .cse28 .cse29 (forall ((v_arrayElimCell_96 Int)) (or (= v_arrayElimCell_96 0) (forall ((v_arrayElimCell_98 Int)) (or (= v_arrayElimCell_98 0) (forall ((v_ArrVal_1906 (Array Int Int)) (v_arrayElimCell_97 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1914))) (or (= (select v_ArrVal_1914 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_94 Int)) (= (select (select .cse30 v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|)) (= (select (select .cse30 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (or (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (or (= v_arrayElimCell_96 0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1914) v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse18) (or .cse18 (and (forall ((v_arrayElimCell_96 Int)) (or (= v_arrayElimCell_96 0) (forall ((v_arrayElimCell_94 Int) (v_ArrVal_1906 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse31 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1914))) (or (= (select (select .cse31 v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse31 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((v_arrayElimCell_96 Int)) (or (= v_arrayElimCell_96 0) (forall ((v_ArrVal_1906 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse32 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1914))) (or (= (select v_ArrVal_1914 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_94 Int)) (= (select (select .cse32 v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|)) (= (select (select .cse32 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((v_arrayElimCell_96 Int)) (or (= v_arrayElimCell_96 0) (forall ((v_arrayElimCell_94 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1914) v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_arrayElimCell_96 Int)) (or (= v_arrayElimCell_96 0) (forall ((v_arrayElimCell_94 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (or (= (select v_ArrVal_1914 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1914) v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (or .cse6 .cse25)))) (or (and (forall ((v_arrayElimCell_100 Int)) (or (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_arrayElimCell_101 Int) (v_arrayElimCell_104 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse33 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1914))) (or (= (select (select .cse33 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_103 Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse33 v_arrayElimCell_100) v_arrayElimCell_103))) (= (select (select .cse33 v_arrayElimCell_101) v_arrayElimCell_104) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_100))) (or (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_101 Int) (v_arrayElimCell_104 Int) (v_arrayElimCell_103 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse34 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1914))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_100) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse34 v_arrayElimCell_100) v_arrayElimCell_103)) (= (select (select .cse34 v_arrayElimCell_101) v_arrayElimCell_104) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse18) (forall ((v_arrayElimCell_100 Int)) (or (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_arrayElimCell_103 Int) (v_ArrVal_1914 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1914) v_arrayElimCell_100) v_arrayElimCell_103))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_100))) (forall ((v_arrayElimCell_100 Int)) (or (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_arrayElimCell_103 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse35 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1914))) (or (= (select (select .cse35 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse35 v_arrayElimCell_100) v_arrayElimCell_103))))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_100))) (or .cse6 .cse23)) .cse20) (or (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_103 Int) (v_ArrVal_1914 (Array Int Int))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_100) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1914) v_arrayElimCell_100) v_arrayElimCell_103)))) .cse20) (or (and (or .cse12 .cse20) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|) 0)) (forall ((v_arrayElimCell_96 Int)) (or (= v_arrayElimCell_96 0) (forall ((v_arrayElimCell_98 Int)) (or (= v_arrayElimCell_98 0) (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_arrayElimCell_97 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse36 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1914))) (or (forall ((v_arrayElimCell_94 Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse36 v_arrayElimCell_94) v_arrayElimCell_96))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse36 v_arrayElimCell_97) v_arrayElimCell_98)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse36 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_arrayElimCell_96 Int)) (or (= v_arrayElimCell_96 0) (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse37 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1914))) (or (forall ((v_arrayElimCell_94 Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse37 v_arrayElimCell_94) v_arrayElimCell_96))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse37 v_arrayElimCell_97) v_arrayElimCell_98)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse37 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|) 0)))) (or .cse14 .cse20) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_1903 Int) (v_arrayElimCell_96 Int) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (let ((.cse38 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1914))) (or (forall ((v_arrayElimCell_94 Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse38 v_arrayElimCell_94) v_arrayElimCell_96))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse38 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|) 0)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_98 Int)) (or (= v_arrayElimCell_98 0) (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_arrayElimCell_97 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse39 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1914))) (or (forall ((v_arrayElimCell_94 Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse39 v_arrayElimCell_94) v_arrayElimCell_96))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse39 v_arrayElimCell_97) v_arrayElimCell_98)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse39 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|) 0)))) (or .cse4 (and .cse28 .cse29)) (or .cse6 .cse4 (and .cse24 .cse26)) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| Int)) (or (forall ((v_arrayElimCell_96 Int)) (or (= v_arrayElimCell_96 0) (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (let ((.cse40 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1914))) (or (forall ((v_arrayElimCell_94 Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse40 v_arrayElimCell_94) v_arrayElimCell_96))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse40 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|) 0)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse41 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1914))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse41 v_arrayElimCell_97) v_arrayElimCell_98)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse41 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|) 0)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1903 Int) (v_arrayElimCell_96 Int) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse42 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1914))) (or (forall ((v_arrayElimCell_94 Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse42 v_arrayElimCell_94) v_arrayElimCell_96))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse42 v_arrayElimCell_97) v_arrayElimCell_98)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse42 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|) 0)))) (or (and .cse10 (or .cse6 .cse14) .cse15 .cse16 .cse17) .cse20) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse43 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1914))) (or (= v_arrayElimCell_98 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse43 v_arrayElimCell_97) v_arrayElimCell_98)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse43 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|) 0))))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49|) 0)) (forall ((v_arrayElimCell_100 Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_arrayElimCell_100) (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_arrayElimCell_101 Int) (v_arrayElimCell_104 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (let ((.cse44 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1903)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_49| v_ArrVal_1914))) (or (forall ((v_arrayElimCell_103 Int)) (= (select (select .cse44 v_arrayElimCell_100) v_arrayElimCell_103) |c_ULTIMATE.start_main_~data_init~0#1|)) (= (select (select .cse44 v_arrayElimCell_101) v_arrayElimCell_104) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse44 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))))) (or (and .cse7 (forall ((v_arrayElimCell_100 Int) (v_arrayElimCell_101 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimCell_101) (forall ((v_arrayElimCell_104 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (let ((.cse45 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1914))) (or (forall ((v_arrayElimCell_103 Int)) (= (select (select .cse45 v_arrayElimCell_100) v_arrayElimCell_103) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse45 v_arrayElimCell_101) v_arrayElimCell_104)))))))) .cse6 .cse4))))) is different from true [2023-11-06 22:20:55,036 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:20:55,187 INFO L322 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2023-11-06 22:20:55,188 INFO L351 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 4 case distinctions, treesize of input 866 treesize of output 853 [2023-11-06 22:20:55,251 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:20:55,302 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:20:55,302 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 520 treesize of output 528 [2023-11-06 22:20:55,387 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:20:55,388 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 514 treesize of output 524 [2023-11-06 22:20:55,441 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:20:55,441 INFO L351 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 591 treesize of output 567 [2023-11-06 22:20:55,521 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:20:55,521 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 395 treesize of output 401 [2023-11-06 22:20:55,597 INFO L351 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 6 treesize of output 4 [2023-11-06 22:21:00,499 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:21:00,613 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:21:00,671 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:21:00,672 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 52 [2023-11-06 22:21:00,768 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 82 [2023-11-06 22:21:16,061 WARN L293 SmtUtils]: Spent 5.49s on a formula simplification that was a NOOP. DAG size: 649 (called from [L 319] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-06 22:21:16,062 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:16,063 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 153 case distinctions, treesize of input 558 treesize of output 1738 [2023-11-06 22:21:38,080 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:21:38,085 INFO L351 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 52 treesize of output 48 [2023-11-06 22:21:38,092 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2023-11-06 22:21:38,103 INFO L351 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 [2023-11-06 22:21:38,143 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:21:38,146 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:21:38,199 INFO L322 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-06 22:21:38,200 INFO L351 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 353 treesize of output 331 [2023-11-06 22:21:38,212 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:21:38,230 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:38,230 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 159 [2023-11-06 22:21:38,259 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:38,260 INFO L351 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 153 treesize of output 153 [2023-11-06 22:21:38,289 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:38,290 INFO L351 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 64 treesize of output 62 [2023-11-06 22:21:38,344 INFO L351 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 6 treesize of output 4 [2023-11-06 22:21:39,198 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:39,199 INFO L351 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 220 treesize of output 202 [2023-11-06 22:21:39,380 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:21:39,431 INFO L322 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-06 22:21:39,432 INFO L351 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 94 treesize of output 100 [2023-11-06 22:21:39,455 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:39,455 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 208 treesize of output 208 [2023-11-06 22:21:39,482 INFO L351 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 226 treesize of output 218 [2023-11-06 22:21:39,500 INFO L351 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 242 treesize of output 236 [2023-11-06 22:21:39,524 INFO L351 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 6 treesize of output 4 [2023-11-06 22:21:39,793 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:39,793 INFO L351 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 37 treesize of output 41 [2023-11-06 22:21:39,866 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:21:39,870 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:21:39,991 INFO L322 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2023-11-06 22:21:39,991 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 746 treesize of output 733 [2023-11-06 22:21:40,014 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:21:40,060 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:40,060 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 400 treesize of output 408 [2023-11-06 22:21:40,155 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:40,156 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 394 treesize of output 404 [2023-11-06 22:21:40,218 INFO L351 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 296 treesize of output 280 [2023-11-06 22:21:40,311 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:40,312 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 291 treesize of output 297 [2023-11-06 22:21:41,408 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:21:42,249 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:21:42,306 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:42,307 INFO L351 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 65 treesize of output 69 [2023-11-06 22:21:45,255 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:45,256 INFO L351 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 118 treesize of output 118 [2023-11-06 22:21:45,461 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:21:45,465 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:21:45,468 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:21:45,565 INFO L322 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2023-11-06 22:21:45,565 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 506 treesize of output 493 [2023-11-06 22:21:45,581 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:21:45,613 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:45,614 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 340 treesize of output 348 [2023-11-06 22:21:45,668 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:45,668 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 334 treesize of output 344 [2023-11-06 22:21:45,734 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:45,735 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 239 treesize of output 245 [2023-11-06 22:21:46,699 INFO L351 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 6 treesize of output 4 [2023-11-06 22:21:49,492 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:21:49,537 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:21:49,565 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-06 22:21:49,704 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:21:49,771 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:49,772 INFO L351 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 47 treesize of output 51 [2023-11-06 22:21:52,678 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:52,679 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 113 [2023-11-06 22:21:52,757 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:21:52,760 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:21:52,814 INFO L322 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-06 22:21:52,814 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 189 treesize of output 187 [2023-11-06 22:21:52,823 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:21:52,840 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:52,840 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 213 [2023-11-06 22:21:52,870 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:52,871 INFO L351 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 207 treesize of output 207 [2023-11-06 22:21:52,899 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:52,900 INFO L351 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 185 treesize of output 183 [2023-11-06 22:21:52,927 INFO L351 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 6 treesize of output 4 [2023-11-06 22:21:53,512 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:53,513 INFO L351 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 220 treesize of output 216 [2023-11-06 22:21:53,981 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:21:54,036 INFO L322 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-06 22:21:54,037 INFO L351 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 309 treesize of output 307 [2023-11-06 22:21:54,052 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:21:54,069 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:54,070 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 335 treesize of output 333 [2023-11-06 22:21:54,102 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:54,103 INFO L351 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 327 treesize of output 327 [2023-11-06 22:21:54,123 INFO L351 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 296 treesize of output 280 [2023-11-06 22:21:54,154 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:54,154 INFO L351 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 289 treesize of output 287 [2023-11-06 22:21:54,177 INFO L351 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 6 treesize of output 4 [2023-11-06 22:21:55,107 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:55,108 INFO L351 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 210 treesize of output 210 [2023-11-06 22:21:55,324 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:21:55,329 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:21:55,453 INFO L322 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2023-11-06 22:21:55,454 INFO L351 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 4 case distinctions, treesize of input 626 treesize of output 613 [2023-11-06 22:21:55,474 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:21:55,518 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:55,519 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 460 treesize of output 468 [2023-11-06 22:21:55,588 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:55,588 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 454 treesize of output 464 [2023-11-06 22:21:55,621 INFO L351 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 296 treesize of output 280 [2023-11-06 22:21:55,690 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:21:55,691 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 343 treesize of output 349 [2023-11-06 22:21:55,793 INFO L351 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 6 treesize of output 4