./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71fe950642bac282d48da6f500677ae534e71a907f9a56d9941372cc95f40daa --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:53:41,439 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:53:41,512 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 06:53:41,516 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:53:41,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:53:41,539 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:53:41,540 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:53:41,540 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:53:41,541 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:53:41,542 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:53:41,542 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:53:41,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:53:41,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:53:41,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:53:41,544 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:53:41,545 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:53:41,545 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:53:41,546 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:53:41,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:53:41,547 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:53:41,547 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 06:53:41,549 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 06:53:41,549 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 06:53:41,550 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:53:41,550 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 06:53:41,551 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 06:53:41,551 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:53:41,551 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:53:41,552 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:53:41,552 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:53:41,552 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:53:41,553 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:53:41,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:53:41,553 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:53:41,554 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:53:41,554 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:53:41,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:53:41,555 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:53:41,555 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:53:41,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:53:41,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:53:41,557 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_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/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_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 71fe950642bac282d48da6f500677ae534e71a907f9a56d9941372cc95f40daa [2023-11-29 06:53:41,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:53:41,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:53:41,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:53:41,815 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:53:41,816 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:53:41,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i [2023-11-29 06:53:44,628 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:53:44,833 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:53:44,833 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i [2023-11-29 06:53:44,848 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/data/7c7e70d0e/ffd2400309f74995b2f630d1ea3e5ebf/FLAG91f6ba3e9 [2023-11-29 06:53:44,861 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/data/7c7e70d0e/ffd2400309f74995b2f630d1ea3e5ebf [2023-11-29 06:53:44,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:53:44,864 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:53:44,865 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:53:44,865 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:53:44,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:53:44,870 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:53:44" (1/1) ... [2023-11-29 06:53:44,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@86cf538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:53:44, skipping insertion in model container [2023-11-29 06:53:44,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:53:44" (1/1) ... [2023-11-29 06:53:44,920 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:53:45,193 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:53:45,204 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:53:45,249 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:53:45,276 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:53:45,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:53:45 WrapperNode [2023-11-29 06:53:45,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:53:45,277 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:53:45,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:53:45,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:53:45,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:53:45" (1/1) ... [2023-11-29 06:53:45,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:53:45" (1/1) ... [2023-11-29 06:53:45,320 INFO L138 Inliner]: procedures = 122, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2023-11-29 06:53:45,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:53:45,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:53:45,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:53:45,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:53:45,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:53:45" (1/1) ... [2023-11-29 06:53:45,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:53:45" (1/1) ... [2023-11-29 06:53:45,338 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:53:45" (1/1) ... [2023-11-29 06:53:45,356 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2023-11-29 06:53:45,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:53:45" (1/1) ... [2023-11-29 06:53:45,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:53:45" (1/1) ... [2023-11-29 06:53:45,366 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:53:45" (1/1) ... [2023-11-29 06:53:45,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:53:45" (1/1) ... [2023-11-29 06:53:45,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:53:45" (1/1) ... [2023-11-29 06:53:45,373 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:53:45" (1/1) ... [2023-11-29 06:53:45,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:53:45,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:53:45,377 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:53:45,377 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:53:45,378 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:53:45" (1/1) ... [2023-11-29 06:53:45,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:53:45,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:53:45,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:53:45,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:53:45,442 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-29 06:53:45,443 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-29 06:53:45,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 06:53:45,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 06:53:45,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 06:53:45,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 06:53:45,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 06:53:45,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:53:45,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 06:53:45,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 06:53:45,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 06:53:45,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 06:53:45,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 06:53:45,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:53:45,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 06:53:45,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:53:45,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:53:45,572 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:53:45,574 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:53:45,605 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-29 06:53:45,616 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 06:53:45,837 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume !false; [2023-11-29 06:53:45,837 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume false; [2023-11-29 06:53:45,837 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume !false; [2023-11-29 06:53:45,838 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume false;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2023-11-29 06:53:45,838 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false; [2023-11-29 06:53:45,839 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:53:45,879 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:53:45,879 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 06:53:45,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:53:45 BoogieIcfgContainer [2023-11-29 06:53:45,880 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:53:45,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:53:45,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:53:45,885 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:53:45,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:53:44" (1/3) ... [2023-11-29 06:53:45,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e36f409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:53:45, skipping insertion in model container [2023-11-29 06:53:45,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:53:45" (2/3) ... [2023-11-29 06:53:45,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e36f409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:53:45, skipping insertion in model container [2023-11-29 06:53:45,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:53:45" (3/3) ... [2023-11-29 06:53:45,888 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-1.i [2023-11-29 06:53:45,902 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:53:45,902 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2023-11-29 06:53:45,938 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:53:45,943 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;@5f6dd6ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:53:45,943 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2023-11-29 06:53:45,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 64 states have internal predecessors, (73), 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-29 06:53:45,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 06:53:45,951 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:53:45,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 06:53:45,953 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 06:53:45,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:53:45,958 INFO L85 PathProgramCache]: Analyzing trace with hash 172438, now seen corresponding path program 1 times [2023-11-29 06:53:45,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:53:45,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916440979] [2023-11-29 06:53:45,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:45,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:53:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:46,148 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-29 06:53:46,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:53:46,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916440979] [2023-11-29 06:53:46,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916440979] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:53:46,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:53:46,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:53:46,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893322585] [2023-11-29 06:53:46,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:53:46,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:53:46,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:53:46,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:53:46,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:53:46,177 INFO L87 Difference]: Start difference. First operand has 66 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 64 states have internal predecessors, (73), 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 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:46,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:53:46,265 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2023-11-29 06:53:46,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:53:46,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-29 06:53:46,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:53:46,272 INFO L225 Difference]: With dead ends: 62 [2023-11-29 06:53:46,272 INFO L226 Difference]: Without dead ends: 57 [2023-11-29 06:53:46,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-29 06:53:46,277 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 23 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:53:46,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 67 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:53:46,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-29 06:53:46,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-29 06:53:46,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 29 states have (on average 2.103448275862069) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 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-29 06:53:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2023-11-29 06:53:46,306 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 3 [2023-11-29 06:53:46,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:53:46,307 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2023-11-29 06:53:46,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:46,307 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2023-11-29 06:53:46,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 06:53:46,308 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:53:46,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 06:53:46,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:53:46,309 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 06:53:46,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:53:46,309 INFO L85 PathProgramCache]: Analyzing trace with hash 172439, now seen corresponding path program 1 times [2023-11-29 06:53:46,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:53:46,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633492703] [2023-11-29 06:53:46,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:46,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:53:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:46,416 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-29 06:53:46,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:53:46,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633492703] [2023-11-29 06:53:46,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633492703] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:53:46,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:53:46,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:53:46,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010697740] [2023-11-29 06:53:46,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:53:46,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:53:46,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:53:46,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:53:46,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:53:46,420 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:46,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:53:46,483 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2023-11-29 06:53:46,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:53:46,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-29 06:53:46,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:53:46,485 INFO L225 Difference]: With dead ends: 53 [2023-11-29 06:53:46,485 INFO L226 Difference]: Without dead ends: 53 [2023-11-29 06:53:46,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-29 06:53:46,487 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 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-29 06:53:46,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:53:46,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-29 06:53:46,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-11-29 06:53:46,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 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-29 06:53:46,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2023-11-29 06:53:46,495 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 3 [2023-11-29 06:53:46,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:53:46,495 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2023-11-29 06:53:46,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2023-11-29 06:53:46,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 06:53:46,496 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:53:46,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:53:46,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:53:46,497 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 06:53:46,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:53:46,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1828434129, now seen corresponding path program 1 times [2023-11-29 06:53:46,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:53:46,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193834976] [2023-11-29 06:53:46,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:46,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:53:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:46,620 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-29 06:53:46,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:53:46,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193834976] [2023-11-29 06:53:46,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193834976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:53:46,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:53:46,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:53:46,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292435027] [2023-11-29 06:53:46,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:53:46,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:53:46,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:53:46,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:53:46,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:53:46,623 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:46,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:53:46,682 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2023-11-29 06:53:46,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:53:46,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 06:53:46,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:53:46,683 INFO L225 Difference]: With dead ends: 51 [2023-11-29 06:53:46,684 INFO L226 Difference]: Without dead ends: 51 [2023-11-29 06:53:46,684 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-29 06:53:46,685 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:53:46,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 66 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:53:46,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-29 06:53:46,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-29 06:53:46,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.896551724137931) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 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-29 06:53:46,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2023-11-29 06:53:46,692 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 8 [2023-11-29 06:53:46,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:53:46,692 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2023-11-29 06:53:46,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:46,693 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2023-11-29 06:53:46,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 06:53:46,693 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:53:46,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:53:46,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 06:53:46,694 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 06:53:46,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:53:46,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1828434130, now seen corresponding path program 1 times [2023-11-29 06:53:46,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:53:46,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394651927] [2023-11-29 06:53:46,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:46,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:53:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:46,799 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-29 06:53:46,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:53:46,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394651927] [2023-11-29 06:53:46,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394651927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:53:46,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:53:46,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:53:46,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673703948] [2023-11-29 06:53:46,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:53:46,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:53:46,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:53:46,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:53:46,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:53:46,802 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:46,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:53:46,850 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2023-11-29 06:53:46,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:53:46,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 06:53:46,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:53:46,852 INFO L225 Difference]: With dead ends: 49 [2023-11-29 06:53:46,852 INFO L226 Difference]: Without dead ends: 49 [2023-11-29 06:53:46,852 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-29 06:53:46,854 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:53:46,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 69 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:53:46,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-29 06:53:46,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-29 06:53:46,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:46,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2023-11-29 06:53:46,859 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 8 [2023-11-29 06:53:46,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:53:46,860 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2023-11-29 06:53:46,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:46,860 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2023-11-29 06:53:46,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 06:53:46,861 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:53:46,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:53:46,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 06:53:46,861 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 06:53:46,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:53:46,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1828432688, now seen corresponding path program 1 times [2023-11-29 06:53:46,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:53:46,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620009802] [2023-11-29 06:53:46,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:46,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:53:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:46,934 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-29 06:53:46,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:53:46,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620009802] [2023-11-29 06:53:46,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620009802] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:53:46,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:53:46,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:53:46,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80419093] [2023-11-29 06:53:46,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:53:46,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:53:46,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:53:46,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:53:46,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:53:46,937 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:46,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:53:46,960 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2023-11-29 06:53:46,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:53:46,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 06:53:46,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:53:46,962 INFO L225 Difference]: With dead ends: 56 [2023-11-29 06:53:46,962 INFO L226 Difference]: Without dead ends: 56 [2023-11-29 06:53:46,962 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-29 06:53:46,964 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:53:46,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 86 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:53:46,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-29 06:53:46,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2023-11-29 06:53:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.8) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:46,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-11-29 06:53:46,970 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 8 [2023-11-29 06:53:46,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:53:46,970 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-11-29 06:53:46,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:46,971 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-11-29 06:53:46,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 06:53:46,971 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:53:46,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:53:46,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 06:53:46,972 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 06:53:46,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:53:46,972 INFO L85 PathProgramCache]: Analyzing trace with hash 483574356, now seen corresponding path program 1 times [2023-11-29 06:53:46,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:53:46,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471002493] [2023-11-29 06:53:46,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:46,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:53:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:47,115 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-29 06:53:47,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:53:47,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471002493] [2023-11-29 06:53:47,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471002493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:53:47,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:53:47,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:53:47,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421710726] [2023-11-29 06:53:47,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:53:47,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:53:47,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:53:47,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:53:47,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:53:47,117 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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-29 06:53:47,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:53:47,195 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2023-11-29 06:53:47,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:53:47,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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-29 06:53:47,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:53:47,197 INFO L225 Difference]: With dead ends: 55 [2023-11-29 06:53:47,197 INFO L226 Difference]: Without dead ends: 55 [2023-11-29 06:53:47,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-29 06:53:47,198 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 19 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:53:47,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 79 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:53:47,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-29 06:53:47,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2023-11-29 06:53:47,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 53 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:47,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2023-11-29 06:53:47,203 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 10 [2023-11-29 06:53:47,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:53:47,204 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2023-11-29 06:53:47,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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-29 06:53:47,204 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2023-11-29 06:53:47,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 06:53:47,204 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:53:47,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:53:47,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 06:53:47,205 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 06:53:47,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:53:47,206 INFO L85 PathProgramCache]: Analyzing trace with hash 483574357, now seen corresponding path program 1 times [2023-11-29 06:53:47,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:53:47,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108903235] [2023-11-29 06:53:47,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:47,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:53:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:47,409 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-29 06:53:47,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:53:47,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108903235] [2023-11-29 06:53:47,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108903235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:53:47,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:53:47,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:53:47,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107015112] [2023-11-29 06:53:47,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:53:47,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:53:47,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:53:47,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:53:47,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:53:47,412 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-29 06:53:47,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:53:47,516 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2023-11-29 06:53:47,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:53:47,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-29 06:53:47,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:53:47,517 INFO L225 Difference]: With dead ends: 54 [2023-11-29 06:53:47,517 INFO L226 Difference]: Without dead ends: 54 [2023-11-29 06:53:47,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:53:47,518 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 19 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:53:47,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 100 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:53:47,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-29 06:53:47,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-29 06:53:47,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 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-29 06:53:47,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2023-11-29 06:53:47,523 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 10 [2023-11-29 06:53:47,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:53:47,523 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2023-11-29 06:53:47,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-29 06:53:47,524 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2023-11-29 06:53:47,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 06:53:47,524 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:53:47,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:53:47,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 06:53:47,525 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 06:53:47,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:53:47,525 INFO L85 PathProgramCache]: Analyzing trace with hash 846250062, now seen corresponding path program 1 times [2023-11-29 06:53:47,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:53:47,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894555561] [2023-11-29 06:53:47,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:47,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:53:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:47,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:53:47,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:53:47,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894555561] [2023-11-29 06:53:47,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894555561] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:53:47,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:53:47,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:53:47,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149890320] [2023-11-29 06:53:47,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:53:47,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:53:47,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:53:47,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:53:47,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:53:47,598 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-29 06:53:47,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:53:47,660 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2023-11-29 06:53:47,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:53:47,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2023-11-29 06:53:47,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:53:47,661 INFO L225 Difference]: With dead ends: 52 [2023-11-29 06:53:47,661 INFO L226 Difference]: Without dead ends: 52 [2023-11-29 06:53:47,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:53:47,662 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:53:47,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 82 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:53:47,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-29 06:53:47,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-11-29 06:53:47,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:47,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2023-11-29 06:53:47,666 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 13 [2023-11-29 06:53:47,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:53:47,667 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2023-11-29 06:53:47,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-29 06:53:47,667 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2023-11-29 06:53:47,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 06:53:47,668 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:53:47,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:53:47,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 06:53:47,668 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 06:53:47,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:53:47,669 INFO L85 PathProgramCache]: Analyzing trace with hash 846250063, now seen corresponding path program 1 times [2023-11-29 06:53:47,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:53:47,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815983515] [2023-11-29 06:53:47,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:47,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:53:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:47,754 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-29 06:53:47,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:53:47,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815983515] [2023-11-29 06:53:47,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815983515] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:53:47,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439119464] [2023-11-29 06:53:47,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:47,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:53:47,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:53:47,760 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:53:47,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 06:53:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:47,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 06:53:47,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:53:47,922 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-29 06:53:47,923 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:53:47,949 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-29 06:53:47,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439119464] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:53:47,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:53:47,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-11-29 06:53:47,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737888333] [2023-11-29 06:53:47,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:53:47,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:53:47,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:53:47,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:53:47,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:53:47,952 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:47,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:53:47,985 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2023-11-29 06:53:47,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:53:47,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 13 [2023-11-29 06:53:47,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:53:47,987 INFO L225 Difference]: With dead ends: 65 [2023-11-29 06:53:47,987 INFO L226 Difference]: Without dead ends: 65 [2023-11-29 06:53:47,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:53:47,988 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:53:47,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 125 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:53:47,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-29 06:53:47,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2023-11-29 06:53:47,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.5333333333333334) internal successors, (69), 62 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-29 06:53:47,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2023-11-29 06:53:47,993 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 13 [2023-11-29 06:53:47,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:53:47,993 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2023-11-29 06:53:47,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:47,994 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2023-11-29 06:53:47,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 06:53:47,994 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:53:47,994 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:53:48,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 06:53:48,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:53:48,196 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 06:53:48,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:53:48,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1498875891, now seen corresponding path program 1 times [2023-11-29 06:53:48,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:53:48,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268101062] [2023-11-29 06:53:48,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:48,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:53:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:48,359 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-29 06:53:48,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:53:48,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268101062] [2023-11-29 06:53:48,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268101062] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:53:48,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709802872] [2023-11-29 06:53:48,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:48,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:53:48,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:53:48,361 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:53:48,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 06:53:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:48,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 06:53:48,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:53:48,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 06:53:48,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 06:53:48,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:53:48,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:53:48,626 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:53:48,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 06:53:48,659 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-29 06:53:48,659 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:53:48,875 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-29 06:53:48,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709802872] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:53:48,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:53:48,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2023-11-29 06:53:48,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315926271] [2023-11-29 06:53:48,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:53:48,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:53:48,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:53:48,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:53:48,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:53:48,878 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 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-29 06:53:49,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:53:49,103 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2023-11-29 06:53:49,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:53:49,104 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 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 15 [2023-11-29 06:53:49,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:53:49,105 INFO L225 Difference]: With dead ends: 61 [2023-11-29 06:53:49,105 INFO L226 Difference]: Without dead ends: 61 [2023-11-29 06:53:49,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:53:49,106 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:53:49,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 189 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:53:49,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-29 06:53:49,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-29 06:53:49,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2023-11-29 06:53:49,111 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 15 [2023-11-29 06:53:49,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:53:49,111 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2023-11-29 06:53:49,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 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-29 06:53:49,111 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2023-11-29 06:53:49,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 06:53:49,112 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:53:49,112 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:53:49,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-29 06:53:49,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:53:49,316 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 06:53:49,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:53:49,317 INFO L85 PathProgramCache]: Analyzing trace with hash 311681207, now seen corresponding path program 1 times [2023-11-29 06:53:49,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:53:49,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880898378] [2023-11-29 06:53:49,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:49,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:53:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:49,542 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 06:53:49,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:53:49,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880898378] [2023-11-29 06:53:49,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880898378] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:53:49,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:53:49,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:53:49,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392558138] [2023-11-29 06:53:49,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:53:49,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:53:49,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:53:49,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:53:49,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:53:49,545 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:49,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:53:49,634 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2023-11-29 06:53:49,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:53:49,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-29 06:53:49,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:53:49,635 INFO L225 Difference]: With dead ends: 61 [2023-11-29 06:53:49,635 INFO L226 Difference]: Without dead ends: 61 [2023-11-29 06:53:49,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:53:49,636 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 21 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:53:49,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 60 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:53:49,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-29 06:53:49,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2023-11-29 06:53:49,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2023-11-29 06:53:49,640 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 29 [2023-11-29 06:53:49,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:53:49,641 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2023-11-29 06:53:49,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:49,641 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2023-11-29 06:53:49,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 06:53:49,642 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:53:49,642 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:53:49,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 06:53:49,642 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 06:53:49,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:53:49,643 INFO L85 PathProgramCache]: Analyzing trace with hash 311681208, now seen corresponding path program 1 times [2023-11-29 06:53:49,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:53:49,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222662440] [2023-11-29 06:53:49,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:49,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:53:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 06:53:49,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:53:49,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222662440] [2023-11-29 06:53:49,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222662440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:53:49,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:53:49,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:53:49,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580877727] [2023-11-29 06:53:49,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:53:49,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:53:49,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:53:49,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:53:49,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:53:49,908 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:50,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:53:50,006 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2023-11-29 06:53:50,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:53:50,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-29 06:53:50,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:53:50,007 INFO L225 Difference]: With dead ends: 64 [2023-11-29 06:53:50,008 INFO L226 Difference]: Without dead ends: 64 [2023-11-29 06:53:50,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:53:50,009 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:53:50,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 105 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:53:50,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-29 06:53:50,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2023-11-29 06:53:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.346938775510204) internal successors, (66), 60 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:50,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2023-11-29 06:53:50,013 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 29 [2023-11-29 06:53:50,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:53:50,014 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2023-11-29 06:53:50,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:50,014 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2023-11-29 06:53:50,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 06:53:50,015 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:53:50,015 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:53:50,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 06:53:50,016 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 06:53:50,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:53:50,016 INFO L85 PathProgramCache]: Analyzing trace with hash -424413485, now seen corresponding path program 1 times [2023-11-29 06:53:50,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:53:50,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50001856] [2023-11-29 06:53:50,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:50,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:53:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:50,691 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-29 06:53:50,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:53:50,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50001856] [2023-11-29 06:53:50,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50001856] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:53:50,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001157307] [2023-11-29 06:53:50,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:50,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:53:50,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:53:50,693 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:53:50,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 06:53:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:50,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-29 06:53:50,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:53:51,013 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 06:53:51,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-29 06:53:51,122 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 06:53:51,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 06:53:51,253 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-29 06:53:51,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-29 06:53:51,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:53:51,385 INFO L378 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-29 06:53:51,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 06:53:51,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 06:53:51,525 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 06:53:51,525 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:53:51,538 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_847 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_847) |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|)) is different from false [2023-11-29 06:53:51,555 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_845) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_847) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2023-11-29 06:53:51,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:53:51,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2023-11-29 06:53:51,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2023-11-29 06:53:51,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2023-11-29 06:53:51,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-11-29 06:53:52,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:53:52,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 43 treesize of output 113 [2023-11-29 06:53:52,269 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2023-11-29 06:53:52,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001157307] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:53:52,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:53:52,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 12] total 30 [2023-11-29 06:53:52,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736670487] [2023-11-29 06:53:52,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:53:52,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 06:53:52,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:53:52,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 06:53:52,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=715, Unknown=2, NotChecked=110, Total=930 [2023-11-29 06:53:52,272 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 30 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-29 06:53:52,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:53:52,813 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2023-11-29 06:53:52,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 06:53:52,814 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 30 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) Word has length 32 [2023-11-29 06:53:52,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:53:52,814 INFO L225 Difference]: With dead ends: 61 [2023-11-29 06:53:52,814 INFO L226 Difference]: Without dead ends: 61 [2023-11-29 06:53:52,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=241, Invalid=1097, Unknown=2, NotChecked=142, Total=1482 [2023-11-29 06:53:52,816 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 43 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:53:52,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 302 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 307 Invalid, 0 Unknown, 53 Unchecked, 0.2s Time] [2023-11-29 06:53:52,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-29 06:53:52,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-29 06:53:52,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:52,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2023-11-29 06:53:52,820 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 32 [2023-11-29 06:53:52,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:53:52,820 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2023-11-29 06:53:52,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 30 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-29 06:53:52,820 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2023-11-29 06:53:52,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 06:53:52,821 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:53:52,822 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:53:52,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 06:53:53,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:53:53,028 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 06:53:53,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:53:53,028 INFO L85 PathProgramCache]: Analyzing trace with hash 160606883, now seen corresponding path program 1 times [2023-11-29 06:53:53,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:53:53,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398452319] [2023-11-29 06:53:53,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:53,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:53:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:53,211 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 06:53:53,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:53:53,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398452319] [2023-11-29 06:53:53,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398452319] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:53:53,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:53:53,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:53:53,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4053114] [2023-11-29 06:53:53,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:53:53,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:53:53,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:53:53,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:53:53,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:53:53,213 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 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-29 06:53:53,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:53:53,330 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2023-11-29 06:53:53,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:53:53,331 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 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 34 [2023-11-29 06:53:53,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:53:53,331 INFO L225 Difference]: With dead ends: 65 [2023-11-29 06:53:53,331 INFO L226 Difference]: Without dead ends: 65 [2023-11-29 06:53:53,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:53:53,332 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 34 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:53:53,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 68 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:53:53,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-29 06:53:53,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2023-11-29 06:53:53,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:53,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2023-11-29 06:53:53,336 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 34 [2023-11-29 06:53:53,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:53:53,336 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2023-11-29 06:53:53,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 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-29 06:53:53,336 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2023-11-29 06:53:53,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 06:53:53,337 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:53:53,338 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:53:53,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 06:53:53,338 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 06:53:53,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:53:53,339 INFO L85 PathProgramCache]: Analyzing trace with hash 160606884, now seen corresponding path program 1 times [2023-11-29 06:53:53,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:53:53,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267389381] [2023-11-29 06:53:53,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:53,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:53:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:53,574 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 06:53:53,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:53:53,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267389381] [2023-11-29 06:53:53,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267389381] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:53:53,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:53:53,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:53:53,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771270930] [2023-11-29 06:53:53,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:53:53,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:53:53,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:53:53,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:53:53,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:53:53,576 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:53,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:53:53,672 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2023-11-29 06:53:53,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:53:53,676 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-29 06:53:53,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:53:53,677 INFO L225 Difference]: With dead ends: 62 [2023-11-29 06:53:53,677 INFO L226 Difference]: Without dead ends: 62 [2023-11-29 06:53:53,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:53:53,678 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:53:53,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 74 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:53:53,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-29 06:53:53,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2023-11-29 06:53:53,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:53,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2023-11-29 06:53:53,681 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 34 [2023-11-29 06:53:53,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:53:53,682 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2023-11-29 06:53:53,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:53:53,682 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2023-11-29 06:53:53,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 06:53:53,683 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:53:53,683 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:53:53,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 06:53:53,683 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 06:53:53,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:53:53,684 INFO L85 PathProgramCache]: Analyzing trace with hash 160606921, now seen corresponding path program 1 times [2023-11-29 06:53:53,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:53:53,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790428199] [2023-11-29 06:53:53,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:53,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:53:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:54,527 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 06:53:54,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:53:54,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790428199] [2023-11-29 06:53:54,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790428199] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:53:54,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464460423] [2023-11-29 06:53:54,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:54,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:53:54,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:53:54,529 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:53:54,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 06:53:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:54,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 75 conjunts are in the unsatisfiable core [2023-11-29 06:53:54,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:53:54,843 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 06:53:54,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-29 06:53:54,916 INFO L349 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2023-11-29 06:53:54,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2023-11-29 06:53:55,074 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2023-11-29 06:53:55,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 28 [2023-11-29 06:53:55,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:53:55,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:53:55,202 INFO L378 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-29 06:53:55,211 INFO L378 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-29 06:53:55,241 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:53:55,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 06:53:55,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 06:53:55,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-29 06:53:55,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 06:53:55,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 06:53:55,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-11-29 06:53:55,496 INFO L378 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 50 treesize of output 33 [2023-11-29 06:53:55,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 06:53:55,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 06:53:55,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:53:55,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2023-11-29 06:53:55,598 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:53:55,599 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:53:56,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:53:56,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 61 [2023-11-29 06:53:56,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 171 [2023-11-29 06:53:56,460 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:53:56,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 127 [2023-11-29 06:53:56,468 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:53:56,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2023-11-29 06:53:56,477 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:53:56,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:53:56,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 59 [2023-11-29 06:53:56,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:53:56,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2023-11-29 06:53:56,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 92 [2023-11-29 06:53:56,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 190 [2023-11-29 06:53:56,681 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:53:56,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2023-11-29 06:53:56,691 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:53:56,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2023-11-29 06:53:56,702 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:53:56,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:53:56,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2023-11-29 06:53:56,724 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:53:56,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-29 06:53:56,754 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:53:56,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2023-11-29 06:53:56,765 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:53:56,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2023-11-29 06:54:03,241 INFO L349 Elim1Store]: treesize reduction 5, result has 98.3 percent of original size [2023-11-29 06:54:03,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 751 treesize of output 994 [2023-11-29 06:54:13,008 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:54:13,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464460423] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:54:13,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:54:13,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 16] total 38 [2023-11-29 06:54:13,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751356665] [2023-11-29 06:54:13,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:54:13,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 06:54:13,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:54:13,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 06:54:13,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1296, Unknown=4, NotChecked=0, Total=1482 [2023-11-29 06:54:13,011 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 39 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 39 states have internal predecessors, (91), 0 states have call successors, (0), 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-29 06:54:13,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:54:13,961 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2023-11-29 06:54:13,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:54:13,962 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 39 states have internal predecessors, (91), 0 states have call successors, (0), 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 34 [2023-11-29 06:54:13,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:54:13,962 INFO L225 Difference]: With dead ends: 72 [2023-11-29 06:54:13,962 INFO L226 Difference]: Without dead ends: 72 [2023-11-29 06:54:13,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=334, Invalid=1732, Unknown=4, NotChecked=0, Total=2070 [2023-11-29 06:54:13,966 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 75 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:54:13,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 228 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 06:54:13,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-29 06:54:13,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2023-11-29 06:54:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 60 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:54:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2023-11-29 06:54:13,969 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 34 [2023-11-29 06:54:13,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:54:13,970 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2023-11-29 06:54:13,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 39 states have internal predecessors, (91), 0 states have call successors, (0), 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-29 06:54:13,970 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2023-11-29 06:54:13,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 06:54:13,971 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:54:13,971 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:54:13,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 06:54:14,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:54:14,176 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 06:54:14,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:54:14,177 INFO L85 PathProgramCache]: Analyzing trace with hash 160606922, now seen corresponding path program 1 times [2023-11-29 06:54:14,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:54:14,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421392779] [2023-11-29 06:54:14,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:14,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:54:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:16,258 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 06:54:16,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:54:16,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421392779] [2023-11-29 06:54:16,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421392779] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:54:16,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000008596] [2023-11-29 06:54:16,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:16,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:54:16,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:54:16,259 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:54:16,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 06:54:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:16,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-29 06:54:16,468 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:54:16,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 06:54:16,551 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:54:16,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 06:54:16,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:54:16,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:54:16,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 06:54:16,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 06:54:16,664 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:54:16,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 06:54:16,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 06:54:16,724 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 06:54:16,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2023-11-29 06:54:16,747 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 06:54:16,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 06:54:16,831 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 06:54:16,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 70 [2023-11-29 06:54:16,842 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-11-29 06:54:16,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 48 [2023-11-29 06:54:17,103 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-11-29 06:54:17,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 191 treesize of output 113 [2023-11-29 06:54:17,117 INFO L349 Elim1Store]: treesize reduction 88, result has 1.1 percent of original size [2023-11-29 06:54:17,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 191 treesize of output 191 [2023-11-29 06:54:17,273 INFO L349 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2023-11-29 06:54:17,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 183 treesize of output 121 [2023-11-29 06:54:17,321 INFO L349 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2023-11-29 06:54:17,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 79 treesize of output 95 [2023-11-29 06:54:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 06:54:19,021 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:54:19,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:54:19,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2023-11-29 06:54:19,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2023-11-29 06:54:19,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-11-29 06:54:19,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:54:19,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2023-11-29 06:54:19,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:54:19,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2023-11-29 06:54:19,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 06:54:19,867 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-29 06:54:19,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2023-11-29 06:54:19,869 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:54:19,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-11-29 06:54:19,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:54:19,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 8 [2023-11-29 06:54:19,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 06:54:19,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:54:19,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2023-11-29 06:54:19,905 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:54:19,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2023-11-29 06:54:19,915 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-29 06:54:19,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-11-29 06:54:19,918 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:54:19,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-11-29 06:54:19,925 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:54:19,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2023-11-29 06:54:19,929 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:54:19,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-11-29 06:54:19,936 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:54:19,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2023-11-29 06:54:20,123 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 06:54:20,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000008596] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:54:20,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:54:20,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10] total 34 [2023-11-29 06:54:20,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257114898] [2023-11-29 06:54:20,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:54:20,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-29 06:54:20,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:54:20,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-29 06:54:20,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1058, Unknown=2, NotChecked=0, Total=1190 [2023-11-29 06:54:20,127 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 35 states, 34 states have (on average 2.6176470588235294) internal successors, (89), 35 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:54:21,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:54:21,431 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2023-11-29 06:54:21,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 06:54:21,431 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.6176470588235294) internal successors, (89), 35 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-29 06:54:21,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:54:21,432 INFO L225 Difference]: With dead ends: 68 [2023-11-29 06:54:21,432 INFO L226 Difference]: Without dead ends: 68 [2023-11-29 06:54:21,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=318, Invalid=1842, Unknown=2, NotChecked=0, Total=2162 [2023-11-29 06:54:21,433 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 69 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:54:21,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 193 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 06:54:21,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-29 06:54:21,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2023-11-29 06:54:21,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 62 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-29 06:54:21,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2023-11-29 06:54:21,436 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 34 [2023-11-29 06:54:21,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:54:21,436 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2023-11-29 06:54:21,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.6176470588235294) internal successors, (89), 35 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:54:21,437 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2023-11-29 06:54:21,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-29 06:54:21,437 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:54:21,437 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:54:21,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 06:54:21,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 06:54:21,638 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 06:54:21,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:54:21,639 INFO L85 PathProgramCache]: Analyzing trace with hash 47258497, now seen corresponding path program 1 times [2023-11-29 06:54:21,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:54:21,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154655164] [2023-11-29 06:54:21,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:21,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:54:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:23,880 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:54:23,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:54:23,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154655164] [2023-11-29 06:54:23,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154655164] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:54:23,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237699440] [2023-11-29 06:54:23,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:23,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:54:23,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:54:23,882 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:54:23,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 06:54:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:24,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 94 conjunts are in the unsatisfiable core [2023-11-29 06:54:24,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:54:24,166 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 06:54:24,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-29 06:54:24,273 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-11-29 06:54:24,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2023-11-29 06:54:24,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:54:24,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 06:54:24,539 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2023-11-29 06:54:24,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2023-11-29 06:54:24,610 INFO L378 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-29 06:54:24,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:54:24,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:54:24,698 INFO L378 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-29 06:54:24,707 INFO L378 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-29 06:54:24,716 INFO L378 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-29 06:54:24,748 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:54:24,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 74 [2023-11-29 06:54:24,753 INFO L378 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-29 06:54:24,759 INFO L378 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-29 06:54:24,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 06:54:24,851 INFO L378 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-29 06:54:24,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-11-29 06:54:24,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 06:54:24,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2023-11-29 06:54:24,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 06:54:25,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 06:54:25,021 INFO L378 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 55 treesize of output 34 [2023-11-29 06:54:25,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 06:54:25,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:54:25,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 23 [2023-11-29 06:54:25,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 06:54:25,170 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:54:25,170 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:54:25,720 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1854 (Array Int Int)) (v_ArrVal_1853 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1848 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1848) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1853) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse0 .cse1 v_ArrVal_1851)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1861) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1849) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1854) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse3)))) (forall ((v_ArrVal_1854 (Array Int Int)) (v_ArrVal_1853 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1848 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1849) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1854) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse0 .cse1 v_ArrVal_1851)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1861) .cse4) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1848) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1853) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) is different from false [2023-11-29 06:54:25,781 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1845 (Array Int Int))) (or (not (= v_ArrVal_1845 (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1845 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1854 (Array Int Int)) (v_ArrVal_1853 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int) (v_ArrVal_1843 Int) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1848 (Array Int Int))) (let ((.cse4 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1845) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1848) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1853) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1851)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1861) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1843)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1849) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1854) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)) .cse4)) (= .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) (forall ((v_ArrVal_1845 (Array Int Int))) (or (not (= v_ArrVal_1845 (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1845 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1854 (Array Int Int)) (v_ArrVal_1853 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int) (v_ArrVal_1843 Int) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1848 (Array Int Int))) (let ((.cse5 (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1843)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1849) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1854) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse5) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1851)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1861) .cse5) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1845) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1848) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1853) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 06:54:25,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:54:25,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 72 [2023-11-29 06:54:25,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 210 [2023-11-29 06:54:25,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 198 [2023-11-29 06:54:25,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 96 [2023-11-29 06:54:25,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 703 treesize of output 701 [2023-11-29 06:54:25,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 191 [2023-11-29 06:54:25,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 87 [2023-11-29 06:54:26,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:54:26,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 87 [2023-11-29 06:54:26,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 573 treesize of output 543 [2023-11-29 06:54:26,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 109 [2023-11-29 06:54:26,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 117 [2023-11-29 06:54:26,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 646 treesize of output 644 [2023-11-29 06:54:26,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 71 [2023-11-29 06:54:26,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2023-11-29 06:56:28,281 WARN L876 $PredicateComparison]: unable to prove that (or (let ((.cse10 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8))) (let ((.cse15 (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1837 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_140 Int) (v_ArrVal_1852 (Array Int Int)) (v_arrayElimCell_143 Int) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int)) (let ((.cse82 (store (store (let ((.cse83 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse83 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse83 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1861))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse82 v_arrayElimCell_140) v_arrayElimCell_143)) (= (select (select .cse82 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse20 (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_140 Int) (v_ArrVal_1861 (Array Int Int)) (v_arrayElimCell_143 Int) (v_ArrVal_1851 Int) (v_ArrVal_1837 (Array Int Int))) (let ((.cse80 (store (let ((.cse81 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse81 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse81 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1861))) (or (= v_arrayElimCell_143 0) (= (select (select .cse80 v_arrayElimCell_140) v_arrayElimCell_143) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse80 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))))) (.cse39 (forall ((v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_arrayElimCell_146 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1837 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1861) v_arrayElimCell_146) v_arrayElimCell_149) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_146 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (.cse0 (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_140 Int) (v_arrayElimCell_143 Int) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int) (v_ArrVal_1837 (Array Int Int))) (or (= v_arrayElimCell_143 0) (= (select (select (store (let ((.cse79 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse79 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse79 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1861) v_arrayElimCell_140) v_arrayElimCell_143) |c_ULTIMATE.start_main_~data_init~0#1|)))) (.cse42 (not .cse10)) (.cse5 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (.cse8 (forall ((v_ArrVal_1852 (Array Int Int)) (v_arrayElimCell_141 Int) (v_arrayElimCell_144 Int) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1837 (Array Int Int))) (or (= v_arrayElimCell_144 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1861) v_arrayElimCell_141) v_arrayElimCell_144) |c_ULTIMATE.start_main_~data_init~0#1|)))) (.cse9 (forall ((v_arrayElimCell_144 Int) (v_arrayElimCell_143 Int) (v_ArrVal_1837 (Array Int Int))) (or (forall ((v_arrayElimCell_140 Int) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1861 (Array Int Int))) (let ((.cse78 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1861))) (or (= (select (select .cse78 v_arrayElimCell_140) v_arrayElimCell_143) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_141 Int)) (= (select (select .cse78 v_arrayElimCell_141) v_arrayElimCell_144) |c_ULTIMATE.start_main_~data_init~0#1|))))) (= v_arrayElimCell_144 0)))) (.cse66 (forall ((v_ArrVal_1852 (Array Int Int)) (v_arrayElimCell_141 Int) (v_arrayElimCell_144 Int) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1837 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1861 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (= v_arrayElimCell_144 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1861) v_arrayElimCell_141) v_arrayElimCell_144) |c_ULTIMATE.start_main_~data_init~0#1|)))) (.cse1 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (.cse7 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) (and (or .cse0 .cse1) (or (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_140 Int) (v_arrayElimCell_141 Int) (v_arrayElimCell_144 Int) (v_arrayElimCell_143 Int) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int) (v_ArrVal_1837 (Array Int Int))) (let ((.cse2 (store (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1861))) (or (= v_arrayElimCell_143 0) (= (select (select .cse2 v_arrayElimCell_140) v_arrayElimCell_143) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_144 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse2 v_arrayElimCell_141) v_arrayElimCell_144)) (= (select (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse1) (or .cse5 (forall ((v_arrayElimCell_140 Int) (v_ArrVal_1852 (Array Int Int)) (v_arrayElimCell_141 Int) (v_arrayElimCell_144 Int) (v_arrayElimCell_143 Int) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1837 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1861))) (or (= (select (select .cse6 v_arrayElimCell_140) v_arrayElimCell_143) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1861 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (= v_arrayElimCell_143 0) (= v_arrayElimCell_144 0) (= (select (select .cse6 v_arrayElimCell_141) v_arrayElimCell_144) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or .cse7 (and (or .cse5 (and .cse8 .cse9) .cse10) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1837 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_arrayElimCell_144 Int) (v_arrayElimCell_143 Int)) (or (= v_arrayElimCell_144 0) (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_140 Int) (v_ArrVal_1852 (Array Int Int)) (v_arrayElimCell_141 Int) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int)) (let ((.cse11 (store (store (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse12 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1861))) (or (= (select (select .cse11 v_arrayElimCell_141) v_arrayElimCell_144) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse11 v_arrayElimCell_140) v_arrayElimCell_143)) (= (select (select .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1837 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_arrayElimCell_141 Int) (v_arrayElimCell_144 Int) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int)) (let ((.cse13 (store (store (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse14 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse14 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1861))) (or (= (select (select .cse13 v_arrayElimCell_141) v_arrayElimCell_144) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_144 0) (= (select (select .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse15)) (or .cse7 (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_140 Int) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1852 (Array Int Int)) (v_arrayElimCell_143 Int) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int) (v_ArrVal_1837 (Array Int Int))) (let ((.cse16 (store (store (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse17 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse17 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1861))) (or (= v_arrayElimCell_143 0) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse16 v_arrayElimCell_140) v_arrayElimCell_143)) (= (select (select .cse16 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or (and (forall ((v_arrayElimCell_143 Int) (v_ArrVal_1837 (Array Int Int))) (or (= v_arrayElimCell_143 0) (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_140 Int) (v_arrayElimCell_141 Int) (v_arrayElimCell_144 Int) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int)) (let ((.cse18 (store (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse19 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse19 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1861))) (or (= (select (select .cse18 v_arrayElimCell_140) v_arrayElimCell_143) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse18 v_arrayElimCell_141) v_arrayElimCell_144))))))) (or .cse10 .cse20) (forall ((v_arrayElimCell_143 Int) (v_ArrVal_1837 (Array Int Int))) (or (= v_arrayElimCell_143 0) (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_140 Int) (v_arrayElimCell_141 Int) (v_arrayElimCell_144 Int) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int)) (let ((.cse21 (store (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse22 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse22 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1861))) (or (= (select (select .cse21 v_arrayElimCell_140) v_arrayElimCell_143) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse21 v_arrayElimCell_141) v_arrayElimCell_144)) (= (select (select .cse21 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((v_arrayElimCell_143 Int) (v_ArrVal_1837 (Array Int Int))) (or (= v_arrayElimCell_143 0) (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_140 Int) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int)) (= (select (select (store (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse23 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse23 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1861) v_arrayElimCell_140) v_arrayElimCell_143) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse1) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1837 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int) (v_arrayElimCell_147 Int)) (let ((.cse24 (store (store (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse25 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse25 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1861))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse24 v_arrayElimCell_147) v_arrayElimCell_150)) (= (select (select .cse24 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1837 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_arrayElimCell_146 Int) (v_arrayElimCell_147 Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_arrayElimCell_146) (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int) (v_arrayElimCell_149 Int)) (let ((.cse26 (store (store (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse27 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse27 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1861))) (or (= (select (select .cse26 v_arrayElimCell_146) v_arrayElimCell_149) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse26 v_arrayElimCell_147) v_arrayElimCell_150)) (= (select (select .cse26 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1837 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int)) (= (select (select (store (store (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse28 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse28 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1861) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or .cse7 (and (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1837 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_arrayElimCell_141 Int) (v_arrayElimCell_144 Int) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int)) (let ((.cse29 (store (store (let ((.cse30 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse30 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse30 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1861))) (or (= (select (select .cse29 v_arrayElimCell_141) v_arrayElimCell_144) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse29 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse15 (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1837 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_140 Int) (v_ArrVal_1852 (Array Int Int)) (v_arrayElimCell_141 Int) (v_arrayElimCell_144 Int) (v_arrayElimCell_143 Int) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int)) (let ((.cse31 (store (store (let ((.cse32 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse32 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse32 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1861))) (or (= (select (select .cse31 v_arrayElimCell_141) v_arrayElimCell_144) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse31 v_arrayElimCell_140) v_arrayElimCell_143)) (= (select (select .cse31 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (or .cse5 (and (or .cse8 .cse10) (forall ((v_arrayElimCell_143 Int) (v_ArrVal_1837 (Array Int Int))) (or (= v_arrayElimCell_143 0) (forall ((v_arrayElimCell_144 Int)) (or (forall ((v_arrayElimCell_140 Int) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1861 (Array Int Int))) (let ((.cse33 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1861))) (or (= (select (select .cse33 v_arrayElimCell_140) v_arrayElimCell_143) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_141 Int)) (= (select (select .cse33 v_arrayElimCell_141) v_arrayElimCell_144) |c_ULTIMATE.start_main_~data_init~0#1|))))) (= v_arrayElimCell_144 0))))))) (or .cse10 .cse20 .cse1) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1837 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_arrayElimCell_147 Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_arrayElimCell_147) (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_arrayElimCell_146 Int) (v_ArrVal_1851 Int) (v_arrayElimCell_149 Int)) (let ((.cse34 (store (store (let ((.cse35 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse35 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse35 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1861))) (or (= (select (select .cse34 v_arrayElimCell_146) v_arrayElimCell_149) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse34 v_arrayElimCell_147) v_arrayElimCell_150)) (= (select (select .cse34 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (or .cse7 (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_140 Int) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1852 (Array Int Int)) (v_arrayElimCell_141 Int) (v_arrayElimCell_144 Int) (v_arrayElimCell_143 Int) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int) (v_ArrVal_1837 (Array Int Int))) (let ((.cse36 (store (store (let ((.cse37 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse37 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse37 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1861))) (or (= v_arrayElimCell_143 0) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54|) 0)) (= (select (select .cse36 v_arrayElimCell_141) v_arrayElimCell_144) |c_ULTIMATE.start_main_~data_init~0#1|) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse36 v_arrayElimCell_140) v_arrayElimCell_143)) (= (select (select .cse36 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or .cse5 (forall ((v_arrayElimCell_150 Int) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_arrayElimCell_146 Int) (v_arrayElimCell_147 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1837 (Array Int Int))) (let ((.cse38 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1861))) (or (= (select (select .cse38 v_arrayElimCell_146) v_arrayElimCell_149) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse38 v_arrayElimCell_147) v_arrayElimCell_150) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_147 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= v_arrayElimCell_146 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (or .cse5 .cse10 .cse39) (or (and (or (and (forall ((v_arrayElimCell_147 Int) (v_ArrVal_1837 (Array Int Int))) (or (forall ((v_arrayElimCell_150 Int) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_arrayElimCell_146 Int) (v_arrayElimCell_149 Int)) (let ((.cse40 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1861))) (or (= (select (select .cse40 v_arrayElimCell_146) v_arrayElimCell_149) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse40 v_arrayElimCell_147) v_arrayElimCell_150) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_arrayElimCell_147 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_arrayElimCell_147 Int) (v_ArrVal_1837 (Array Int Int))) (or (= v_arrayElimCell_147 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_arrayElimCell_150 Int) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1861 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1861) v_arrayElimCell_147) v_arrayElimCell_150) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_arrayElimCell_147 Int) (v_ArrVal_1837 (Array Int Int))) (or (= v_arrayElimCell_147 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_arrayElimCell_150 Int) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_arrayElimCell_146 Int) (v_arrayElimCell_149 Int)) (let ((.cse41 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1861))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1861 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (= (select (select .cse41 v_arrayElimCell_146) v_arrayElimCell_149) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse41 v_arrayElimCell_147) v_arrayElimCell_150) |c_ULTIMATE.start_main_~data_init~0#1|))))))) .cse42) (forall ((v_arrayElimCell_147 Int) (v_ArrVal_1837 (Array Int Int))) (or (forall ((v_arrayElimCell_150 Int) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_arrayElimCell_146 Int) (v_arrayElimCell_149 Int)) (let ((.cse43 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1861))) (or (= (select (select .cse43 v_arrayElimCell_146) v_arrayElimCell_149) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse43 v_arrayElimCell_147) v_arrayElimCell_150) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_146 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (= v_arrayElimCell_147 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or .cse10 (and (forall ((v_arrayElimCell_146 Int) (v_ArrVal_1837 (Array Int Int))) (or (forall ((v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_arrayElimCell_149 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1861 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1861) v_arrayElimCell_146) v_arrayElimCell_149) |c_ULTIMATE.start_main_~data_init~0#1|))) (= v_arrayElimCell_146 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) .cse39))) .cse5) (or (forall ((v_ArrVal_1846 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1852 (Array Int Int)) (v_arrayElimCell_141 Int) (v_arrayElimCell_144 Int) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int) (v_ArrVal_1837 (Array Int Int))) (let ((.cse44 (store (store (let ((.cse45 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse45 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse45 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1861))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select .cse44 v_arrayElimCell_141) v_arrayElimCell_144) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_144 0) (= (select (select .cse44 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse7) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1837 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_arrayElimCell_146 Int) (v_ArrVal_1851 Int) (v_arrayElimCell_147 Int) (v_arrayElimCell_149 Int)) (let ((.cse46 (store (store (let ((.cse47 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse47 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse47 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1861))) (or (= (select (select .cse46 v_arrayElimCell_146) v_arrayElimCell_149) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse46 v_arrayElimCell_147) v_arrayElimCell_150)) (= (select (select .cse46 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (or .cse10 (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_140 Int) (v_arrayElimCell_141 Int) (v_arrayElimCell_144 Int) (v_arrayElimCell_143 Int) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int) (v_ArrVal_1837 (Array Int Int))) (let ((.cse48 (store (let ((.cse49 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse49 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse49 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1861))) (or (= v_arrayElimCell_143 0) (= (select (select .cse48 v_arrayElimCell_140) v_arrayElimCell_143) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse48 v_arrayElimCell_141) v_arrayElimCell_144))))) .cse1) (or .cse10 .cse0 .cse1) (or .cse5 .cse10 (forall ((v_arrayElimCell_150 Int) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_arrayElimCell_146 Int) (v_arrayElimCell_147 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1837 (Array Int Int))) (let ((.cse50 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1861))) (or (= (select (select .cse50 v_arrayElimCell_146) v_arrayElimCell_149) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse50 v_arrayElimCell_147) v_arrayElimCell_150) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_146 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (or .cse10 (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_140 Int) (v_arrayElimCell_141 Int) (v_arrayElimCell_144 Int) (v_arrayElimCell_143 Int) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int) (v_ArrVal_1837 (Array Int Int))) (let ((.cse51 (store (let ((.cse52 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse52 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse52 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1861))) (or (= v_arrayElimCell_143 0) (= (select (select .cse51 v_arrayElimCell_140) v_arrayElimCell_143) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse51 v_arrayElimCell_141) v_arrayElimCell_144)) (= (select (select .cse51 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse1) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1837 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_arrayElimCell_146 Int) (v_ArrVal_1851 Int) (v_arrayElimCell_149 Int)) (let ((.cse53 (store (store (let ((.cse54 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse54 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse54 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1861))) (or (= (select (select .cse53 v_arrayElimCell_146) v_arrayElimCell_149) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse53 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (or (and (forall ((v_arrayElimCell_147 Int) (v_ArrVal_1837 (Array Int Int))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_147) (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_1861 (Array Int Int)) (v_arrayElimCell_146 Int) (v_ArrVal_1851 Int) (v_arrayElimCell_149 Int)) (let ((.cse55 (store (let ((.cse56 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse56 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse56 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1861))) (or (= (select (select .cse55 v_arrayElimCell_146) v_arrayElimCell_149) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse55 v_arrayElimCell_147) v_arrayElimCell_150) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse55 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((v_arrayElimCell_147 Int) (v_ArrVal_1837 (Array Int Int))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_147) (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int)) (= (select (select (store (let ((.cse57 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse57 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse57 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1861) v_arrayElimCell_147) v_arrayElimCell_150) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int) (v_arrayElimCell_146 Int) (v_arrayElimCell_147 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1837 (Array Int Int))) (let ((.cse58 (store (let ((.cse59 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse59 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse59 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1861))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_147) (= (select (select .cse58 v_arrayElimCell_146) v_arrayElimCell_149) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse58 v_arrayElimCell_147) v_arrayElimCell_150) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse42)) .cse1) (or .cse7 (forall ((v_ArrVal_1846 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1852 (Array Int Int)) (v_arrayElimCell_141 Int) (v_arrayElimCell_144 Int) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int) (v_ArrVal_1837 (Array Int Int))) (let ((.cse60 (store (store (let ((.cse61 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse61 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse61 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1861))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select .cse60 v_arrayElimCell_141) v_arrayElimCell_144) |c_ULTIMATE.start_main_~data_init~0#1|) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse60 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1837 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54|) 0)) (forall ((v_arrayElimCell_147 Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_arrayElimCell_147) (forall ((v_arrayElimCell_146 Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_arrayElimCell_146) (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int) (v_arrayElimCell_149 Int)) (let ((.cse62 (store (store (let ((.cse63 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse63 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse63 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1861))) (or (= (select (select .cse62 v_arrayElimCell_146) v_arrayElimCell_149) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse62 v_arrayElimCell_147) v_arrayElimCell_150)) (= (select (select .cse62 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))))))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1837 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int) (v_arrayElimCell_147 Int)) (let ((.cse64 (store (store (let ((.cse65 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse65 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse65 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1861))) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_arrayElimCell_147) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse64 v_arrayElimCell_147) v_arrayElimCell_150)) (= (select (select .cse64 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (or .cse5 .cse10 .cse66) (or .cse5 (and .cse8 .cse9 (forall ((v_arrayElimCell_144 Int) (v_arrayElimCell_143 Int) (v_ArrVal_1837 (Array Int Int))) (or (= v_arrayElimCell_144 0) (forall ((v_arrayElimCell_140 Int) (v_ArrVal_1852 (Array Int Int)) (v_arrayElimCell_141 Int) (v_ArrVal_1861 (Array Int Int))) (let ((.cse67 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1861))) (or (= (select (select .cse67 v_arrayElimCell_140) v_arrayElimCell_143) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1861 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (= (select (select .cse67 v_arrayElimCell_141) v_arrayElimCell_144) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse66) .cse10) (or .cse7 (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_140 Int) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1852 (Array Int Int)) (v_arrayElimCell_141 Int) (v_arrayElimCell_144 Int) (v_arrayElimCell_143 Int) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int) (v_ArrVal_1837 (Array Int Int))) (let ((.cse68 (store (store (let ((.cse69 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse69 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse69 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1861))) (or (= v_arrayElimCell_143 0) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54|) 0)) (= (select (select .cse68 v_arrayElimCell_141) v_arrayElimCell_144) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse68 v_arrayElimCell_140) v_arrayElimCell_143)) (= v_arrayElimCell_144 0) (= (select (select .cse68 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_140 Int) (v_arrayElimCell_141 Int) (v_arrayElimCell_144 Int) (v_arrayElimCell_143 Int) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int) (v_ArrVal_1837 (Array Int Int))) (let ((.cse70 (store (let ((.cse71 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse71 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse71 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1861))) (or (= v_arrayElimCell_143 0) (= (select (select .cse70 v_arrayElimCell_140) v_arrayElimCell_143) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_144 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse70 v_arrayElimCell_141) v_arrayElimCell_144))))) .cse1) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1837 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_arrayElimCell_146 Int)) (or (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int) (v_arrayElimCell_149 Int)) (let ((.cse72 (store (store (let ((.cse73 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse73 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse73 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1861))) (or (= (select (select .cse72 v_arrayElimCell_146) v_arrayElimCell_149) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse72 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_arrayElimCell_146))))) (or (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int) (v_arrayElimCell_147 Int) (v_ArrVal_1837 (Array Int Int))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimCell_147) (= (select (select (store (let ((.cse74 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse74 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse74 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1861) v_arrayElimCell_147) v_arrayElimCell_150) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse1) (or .cse7 (forall ((v_ArrVal_1846 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int) (v_ArrVal_1837 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store (let ((.cse75 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse75 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse75 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1861) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1837 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_arrayElimCell_147 Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_arrayElimCell_147) (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1851 Int)) (let ((.cse76 (store (store (let ((.cse77 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1837))) (store .cse77 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse77 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1851))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1852) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_54| v_ArrVal_1861))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse76 v_arrayElimCell_147) v_arrayElimCell_150)) (= (select (select .cse76 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))))))))))) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) is different from true [2023-11-29 06:56:28,848 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-29 06:56:28,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1302 treesize of output 1168 [2023-11-29 06:56:28,860 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:56:28,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:28,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 134 [2023-11-29 06:56:28,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 121 [2023-11-29 06:56:28,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2023-11-29 06:56:29,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 06:56:29,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:29,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 64 [2023-11-29 06:56:29,366 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:56:29,366 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:56:29,405 INFO L349 Elim1Store]: treesize reduction 26, result has 57.4 percent of original size [2023-11-29 06:56:29,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 339 treesize of output 329 [2023-11-29 06:56:29,417 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:56:29,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:56:29,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:29,438 INFO L378 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 2 case distinctions, treesize of input 156 treesize of output 166 [2023-11-29 06:56:29,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 138 [2023-11-29 06:56:29,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 130 [2023-11-29 06:56:29,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:29,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 79 [2023-11-29 06:56:29,605 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:56:29,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:29,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1017 treesize of output 992 [2023-11-29 06:56:29,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:29,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 82 [2023-11-29 06:56:29,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2023-11-29 06:56:29,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:29,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 96 [2023-11-29 06:56:29,889 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:56:29,977 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2023-11-29 06:56:29,978 INFO L378 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2854 treesize of output 2701 [2023-11-29 06:56:30,017 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:56:30,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:30,046 INFO L378 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-29 06:56:30,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:30,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 514 treesize of output 524 [2023-11-29 06:56:30,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:30,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 591 treesize of output 567 [2023-11-29 06:56:30,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:30,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 395 treesize of output 401 [2023-11-29 06:56:31,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 06:56:36,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 06:56:36,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-11-29 06:56:36,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:36,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2023-11-29 06:56:36,523 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 06:56:46,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:46,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 2 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 2954 treesize of output 3028 [2023-11-29 06:56:50,934 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:56:50,975 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-29 06:56:50,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 593 treesize of output 571 [2023-11-29 06:56:50,993 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:56:51,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:51,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 335 treesize of output 333 [2023-11-29 06:56:51,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:51,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 327 treesize of output 327 [2023-11-29 06:56:51,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 280 [2023-11-29 06:56:51,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:51,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 289 treesize of output 287 [2023-11-29 06:56:51,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 06:56:51,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:51,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 95 [2023-11-29 06:56:51,989 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:56:51,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:51,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 36 [2023-11-29 06:56:52,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 06:56:52,006 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:56:52,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2023-11-29 06:56:52,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 06:56:52,041 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:56:52,152 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2023-11-29 06:56:52,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 11374 treesize of output 10621 [2023-11-29 06:56:52,209 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:56:52,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:52,242 INFO L378 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 407 treesize of output 415 [2023-11-29 06:56:52,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:52,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 514 treesize of output 524 [2023-11-29 06:56:52,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:52,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 486 treesize of output 492 [2023-11-29 06:56:52,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:52,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 402 treesize of output 378 [2023-11-29 06:56:52,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 06:56:53,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 06:56:54,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:54,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 90 [2023-11-29 06:57:05,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:05,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1341 treesize of output 1333 [2023-11-29 06:57:11,741 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:57:11,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:11,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 36 [2023-11-29 06:57:11,752 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:57:11,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2023-11-29 06:57:11,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 06:57:11,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 06:57:11,791 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:57:11,840 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-29 06:57:11,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 593 treesize of output 571 [2023-11-29 06:57:11,859 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:57:11,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:11,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 335 treesize of output 333 [2023-11-29 06:57:11,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:11,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 327 treesize of output 327 [2023-11-29 06:57:11,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 280 [2023-11-29 06:57:11,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:11,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 289 treesize of output 287 [2023-11-29 06:57:12,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 06:57:12,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:12,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 90 treesize of output 92 [2023-11-29 06:57:12,652 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:57:12,765 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2023-11-29 06:57:12,765 INFO L378 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2854 treesize of output 2701 [2023-11-29 06:57:12,815 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:57:12,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:12,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 520 treesize of output 528 [2023-11-29 06:57:12,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:12,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 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-29 06:57:12,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:12,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 591 treesize of output 567 [2023-11-29 06:57:13,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:13,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 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-29 06:57:14,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 06:57:16,401 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 06:57:16,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 45 treesize of output 39 [2023-11-29 06:57:16,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 73 treesize of output 69 [2023-11-29 06:57:16,762 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 06:57:16,808 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 06:57:36,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-11-29 06:57:36,268 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:57:36,311 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-29 06:57:36,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2297 treesize of output 2155 [2023-11-29 06:57:36,340 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:57:36,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:36,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 219 [2023-11-29 06:57:36,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:36,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 213 [2023-11-29 06:57:36,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 280 [2023-11-29 06:57:36,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:36,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 114 [2023-11-29 06:57:37,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 06:57:37,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:37,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 317 treesize of output 297 [2023-11-29 06:57:37,965 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:57:38,010 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-29 06:57:38,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 593 treesize of output 571 [2023-11-29 06:57:38,028 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:57:38,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:38,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 335 treesize of output 333 [2023-11-29 06:57:38,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:38,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 327 treesize of output 327 [2023-11-29 06:57:38,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 280 [2023-11-29 06:57:38,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:38,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 289 treesize of output 287 [2023-11-29 06:57:38,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 06:57:38,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:38,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 96 [2023-11-29 06:57:38,906 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:57:39,004 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2023-11-29 06:57:39,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2854 treesize of output 2701 [2023-11-29 06:57:39,045 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:57:39,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:39,081 INFO L378 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-29 06:57:39,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:39,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 514 treesize of output 524 [2023-11-29 06:57:39,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:39,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 591 treesize of output 567 [2023-11-29 06:57:39,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:39,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 395 treesize of output 401 [2023-11-29 06:57:40,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 06:57:43,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 06:57:43,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 06:57:43,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:43,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 97 [2023-11-29 06:57:48,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:48,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 346 treesize of output 356 [2023-11-29 06:57:48,776 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:57:48,782 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:57:48,834 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-29 06:57:48,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 353 treesize of output 331 [2023-11-29 06:57:48,848 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:57:48,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:48,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 213 [2023-11-29 06:57:48,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:48,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 207 [2023-11-29 06:57:48,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:48,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 183 [2023-11-29 06:57:48,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 06:57:49,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:49,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 159 [2023-11-29 06:57:49,504 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:57:49,508 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:57:49,615 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2023-11-29 06:57:49,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 3598 treesize of output 3325 [2023-11-29 06:57:49,656 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:57:49,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:49,688 INFO L378 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 347 treesize of output 355 [2023-11-29 06:57:49,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:49,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 394 treesize of output 404 [2023-11-29 06:57:49,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:57:49,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 366 treesize of output 372 [2023-11-29 06:57:49,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 98 [2023-11-29 06:57:49,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 06:57:53,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 06:57:53,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 06:57:53,750 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 06:57:53,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 47 [2023-11-29 06:57:53,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2023-11-29 06:58:02,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:58:02,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 1030 treesize of output 1830 [2023-11-29 07:01:40,355 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:01:40,403 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-29 07:01:40,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 9113 treesize of output 8491 [2023-11-29 07:01:40,438 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:01:40,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:40,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 222 treesize of output 220 [2023-11-29 07:01:40,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:40,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 327 treesize of output 327 [2023-11-29 07:01:40,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:40,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 305 treesize of output 303 [2023-11-29 07:01:40,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 288 treesize of output 272 [2023-11-29 07:01:40,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 07:01:41,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-11-29 07:01:41,166 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:01:41,215 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-29 07:01:41,215 INFO L378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2297 treesize of output 2155 [2023-11-29 07:01:41,241 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:01:41,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:41,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 219 [2023-11-29 07:01:41,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:41,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 213 treesize of output 213 [2023-11-29 07:01:41,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 280 [2023-11-29 07:01:41,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:41,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 116 treesize of output 114 [2023-11-29 07:01:41,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 07:01:42,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:42,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 119 treesize of output 119 [2023-11-29 07:01:42,555 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:01:42,559 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:01:42,601 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-29 07:01:42,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1337 treesize of output 1195 [2023-11-29 07:01:42,616 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:01:42,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:42,629 INFO L378 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 162 treesize of output 160 [2023-11-29 07:01:42,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:42,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 207 [2023-11-29 07:01:42,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:42,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 183 [2023-11-29 07:01:42,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 07:01:43,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-11-29 07:01:43,254 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:01:43,259 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:01:43,367 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2023-11-29 07:01:43,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 9430 treesize of output 8797 [2023-11-29 07:01:43,412 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:01:43,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:43,444 INFO L378 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 401 treesize of output 409 [2023-11-29 07:01:43,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:43,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 508 treesize of output 518 [2023-11-29 07:01:43,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:43,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 480 treesize of output 486 [2023-11-29 07:01:43,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 288 treesize of output 272 [2023-11-29 07:01:44,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 07:01:45,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:45,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 71 [2023-11-29 07:01:45,735 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 07:01:45,790 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 07:01:47,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:47,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 106 [2023-11-29 07:01:47,676 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:01:47,681 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:01:47,724 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-29 07:01:47,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1337 treesize of output 1195 [2023-11-29 07:01:47,741 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:01:47,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:47,755 INFO L378 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 162 treesize of output 160 [2023-11-29 07:01:47,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:47,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 207 [2023-11-29 07:01:47,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:47,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 183 [2023-11-29 07:01:48,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 07:01:48,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:48,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 94 [2023-11-29 07:01:48,895 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:01:48,942 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-29 07:01:48,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2297 treesize of output 2155 [2023-11-29 07:01:48,966 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:01:48,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:48,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 219 [2023-11-29 07:01:49,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:49,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 213 [2023-11-29 07:01:49,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:49,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 189 [2023-11-29 07:01:49,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 98 [2023-11-29 07:01:49,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 07:01:50,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-11-29 07:01:50,390 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:01:50,394 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:01:50,400 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:01:50,504 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2023-11-29 07:01:50,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1654 treesize of output 1501 [2023-11-29 07:01:50,537 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:01:50,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:50,571 INFO L378 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 341 treesize of output 349 [2023-11-29 07:01:50,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:50,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 388 treesize of output 398 [2023-11-29 07:01:50,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:50,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 360 treesize of output 366 [2023-11-29 07:01:50,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 07:01:52,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 07:01:52,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2023-11-29 07:01:53,065 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 07:01:53,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 26 [2023-11-29 07:02:03,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-11-29 07:02:03,443 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:02:03,540 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2023-11-29 07:02:03,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2854 treesize of output 2701 [2023-11-29 07:02:03,581 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:02:03,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:02:03,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 520 treesize of output 528 [2023-11-29 07:02:03,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:02:03,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 514 treesize of output 524 [2023-11-29 07:02:03,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:02:03,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 591 treesize of output 567 [2023-11-29 07:02:03,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:02:03,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 395 treesize of output 401 [2023-11-29 07:02:03,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 07:02:11,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 64 treesize of output 60 [2023-11-29 07:02:12,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 07:02:12,234 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 07:02:12,250 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 07:02:12,266 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 07:02:13,003 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 07:02:13,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 93 [2023-11-29 07:02:14,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:02:14,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 336 treesize of output 330 [2023-11-29 07:02:15,766 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:02:15,808 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-29 07:02:15,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2297 treesize of output 2155 [2023-11-29 07:02:15,834 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:02:15,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:02:15,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 219 [2023-11-29 07:02:15,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:02:15,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 213 [2023-11-29 07:02:15,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 280 [2023-11-29 07:02:15,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:02:15,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 114 [2023-11-29 07:02:16,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 07:02:17,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:02:17,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 283 treesize of output 265 [2023-11-29 07:02:17,514 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:02:17,556 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-29 07:02:17,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 593 treesize of output 571 [2023-11-29 07:02:17,576 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:02:17,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:02:17,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 335 treesize of output 333 [2023-11-29 07:02:17,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:02:17,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 327 treesize of output 327 [2023-11-29 07:02:17,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 280 [2023-11-29 07:02:17,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:02:17,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 289 treesize of output 287 [2023-11-29 07:02:18,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 07:02:18,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-11-29 07:02:19,829 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-11-29 07:02:19,829 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-29 07:02:19,830 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 07:02:19,835 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 07:02:20,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 07:02:20,031 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:915) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:579) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2023-11-29 07:02:20,034 INFO L158 Benchmark]: Toolchain (without parser) took 515169.63ms. Allocated memory was 178.3MB in the beginning and 539.0MB in the end (delta: 360.7MB). Free memory was 135.6MB in the beginning and 454.5MB in the end (delta: -319.0MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2023-11-29 07:02:20,034 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 119.5MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 07:02:20,034 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.71ms. Allocated memory is still 178.3MB. Free memory was 135.6MB in the beginning and 118.2MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 07:02:20,034 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.90ms. Allocated memory is still 178.3MB. Free memory was 118.2MB in the beginning and 116.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 07:02:20,035 INFO L158 Benchmark]: Boogie Preprocessor took 55.35ms. Allocated memory is still 178.3MB. Free memory was 116.1MB in the beginning and 113.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 07:02:20,035 INFO L158 Benchmark]: RCFGBuilder took 503.11ms. Allocated memory is still 178.3MB. Free memory was 113.3MB in the beginning and 90.9MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 07:02:20,035 INFO L158 Benchmark]: TraceAbstraction took 514150.64ms. Allocated memory was 178.3MB in the beginning and 539.0MB in the end (delta: 360.7MB). Free memory was 90.2MB in the beginning and 454.5MB in the end (delta: -364.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 07:02:20,036 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 119.5MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.71ms. Allocated memory is still 178.3MB. Free memory was 135.6MB in the beginning and 118.2MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.90ms. Allocated memory is still 178.3MB. Free memory was 118.2MB in the beginning and 116.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.35ms. Allocated memory is still 178.3MB. Free memory was 116.1MB in the beginning and 113.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 503.11ms. Allocated memory is still 178.3MB. Free memory was 113.3MB in the beginning and 90.9MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 514150.64ms. Allocated memory was 178.3MB in the beginning and 539.0MB in the end (delta: 360.7MB). Free memory was 90.2MB in the beginning and 454.5MB in the end (delta: -364.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71fe950642bac282d48da6f500677ae534e71a907f9a56d9941372cc95f40daa --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 07:02:21,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 07:02:21,824 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 07:02:21,835 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 07:02:21,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 07:02:21,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 07:02:21,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 07:02:21,866 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 07:02:21,867 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 07:02:21,868 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 07:02:21,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 07:02:21,869 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 07:02:21,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 07:02:21,871 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 07:02:21,871 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 07:02:21,872 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 07:02:21,873 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 07:02:21,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 07:02:21,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 07:02:21,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 07:02:21,875 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 07:02:21,875 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 07:02:21,876 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 07:02:21,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 07:02:21,877 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 07:02:21,877 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 07:02:21,878 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 07:02:21,878 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 07:02:21,879 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 07:02:21,879 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 07:02:21,880 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 07:02:21,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 07:02:21,881 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 07:02:21,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 07:02:21,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:02:21,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 07:02:21,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 07:02:21,882 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 07:02:21,882 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 07:02:21,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 07:02:21,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 07:02:21,883 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 07:02:21,883 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 07:02:21,883 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 07:02:21,884 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_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/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_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 71fe950642bac282d48da6f500677ae534e71a907f9a56d9941372cc95f40daa [2023-11-29 07:02:22,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 07:02:22,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 07:02:22,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 07:02:22,186 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 07:02:22,186 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 07:02:22,188 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i [2023-11-29 07:02:25,033 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 07:02:25,269 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 07:02:25,270 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i [2023-11-29 07:02:25,285 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/data/1ee0587d2/f1c13e05cb6845d7b2b5e621e88717d8/FLAG6dfeb9e74 [2023-11-29 07:02:25,301 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/data/1ee0587d2/f1c13e05cb6845d7b2b5e621e88717d8 [2023-11-29 07:02:25,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 07:02:25,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 07:02:25,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 07:02:25,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 07:02:25,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 07:02:25,313 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:02:25" (1/1) ... [2023-11-29 07:02:25,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@580d35fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:25, skipping insertion in model container [2023-11-29 07:02:25,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:02:25" (1/1) ... [2023-11-29 07:02:25,359 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 07:02:25,649 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:02:25,664 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 07:02:25,724 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:02:25,757 INFO L206 MainTranslator]: Completed translation [2023-11-29 07:02:25,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:25 WrapperNode [2023-11-29 07:02:25,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 07:02:25,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 07:02:25,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 07:02:25,759 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 07:02:25,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:25" (1/1) ... [2023-11-29 07:02:25,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:25" (1/1) ... [2023-11-29 07:02:25,808 INFO L138 Inliner]: procedures = 125, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 99 [2023-11-29 07:02:25,808 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 07:02:25,809 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 07:02:25,809 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 07:02:25,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 07:02:25,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:25" (1/1) ... [2023-11-29 07:02:25,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:25" (1/1) ... [2023-11-29 07:02:25,825 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:25" (1/1) ... [2023-11-29 07:02:25,843 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2023-11-29 07:02:25,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:25" (1/1) ... [2023-11-29 07:02:25,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:25" (1/1) ... [2023-11-29 07:02:25,853 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:25" (1/1) ... [2023-11-29 07:02:25,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:25" (1/1) ... [2023-11-29 07:02:25,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:25" (1/1) ... [2023-11-29 07:02:25,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:25" (1/1) ... [2023-11-29 07:02:25,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 07:02:25,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 07:02:25,866 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 07:02:25,866 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 07:02:25,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:25" (1/1) ... [2023-11-29 07:02:25,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:02:25,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:02:25,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 07:02:25,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 07:02:25,944 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-29 07:02:25,944 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-29 07:02:25,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 07:02:25,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 07:02:25,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 07:02:25,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 07:02:25,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 07:02:25,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 07:02:25,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 07:02:25,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 07:02:25,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 07:02:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 07:02:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 07:02:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 07:02:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 07:02:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 07:02:25,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 07:02:26,078 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 07:02:26,080 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 07:02:26,107 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-29 07:02:26,116 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 07:02:26,479 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume !false; [2023-11-29 07:02:26,480 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume false; [2023-11-29 07:02:26,480 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume !false; [2023-11-29 07:02:26,480 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume false;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2023-11-29 07:02:26,480 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false; [2023-11-29 07:02:26,482 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 07:02:26,522 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 07:02:26,522 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 07:02:26,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:02:26 BoogieIcfgContainer [2023-11-29 07:02:26,522 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 07:02:26,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 07:02:26,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 07:02:26,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 07:02:26,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:02:25" (1/3) ... [2023-11-29 07:02:26,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c54190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:02:26, skipping insertion in model container [2023-11-29 07:02:26,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:25" (2/3) ... [2023-11-29 07:02:26,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c54190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:02:26, skipping insertion in model container [2023-11-29 07:02:26,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:02:26" (3/3) ... [2023-11-29 07:02:26,529 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-1.i [2023-11-29 07:02:26,544 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 07:02:26,544 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2023-11-29 07:02:26,581 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 07:02:26,586 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;@25cacac7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 07:02:26,586 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2023-11-29 07:02:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 64 states have internal predecessors, (73), 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-29 07:02:26,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 07:02:26,596 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:26,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 07:02:26,597 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 07:02:26,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:26,602 INFO L85 PathProgramCache]: Analyzing trace with hash 172438, now seen corresponding path program 1 times [2023-11-29 07:02:26,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:02:26,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456484560] [2023-11-29 07:02:26,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:26,612 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:26,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:02:26,614 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:02:26,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 07:02:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:26,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 07:02:26,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:26,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 07:02:26,794 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-29 07:02:26,794 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:02:26,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:02:26,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456484560] [2023-11-29 07:02:26,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456484560] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:26,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:26,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 07:02:26,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318184649] [2023-11-29 07:02:26,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:26,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:02:26,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:02:26,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:02:26,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:02:26,830 INFO L87 Difference]: Start difference. First operand has 66 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 64 states have internal predecessors, (73), 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 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:27,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:27,015 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2023-11-29 07:02:27,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:02:27,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-29 07:02:27,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:27,022 INFO L225 Difference]: With dead ends: 62 [2023-11-29 07:02:27,022 INFO L226 Difference]: Without dead ends: 57 [2023-11-29 07:02:27,023 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-29 07:02:27,026 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 23 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:27,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 67 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 07:02:27,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-29 07:02:27,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-29 07:02:27,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 29 states have (on average 2.103448275862069) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 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-29 07:02:27,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2023-11-29 07:02:27,056 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 3 [2023-11-29 07:02:27,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:27,057 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2023-11-29 07:02:27,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:27,057 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2023-11-29 07:02:27,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 07:02:27,057 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:27,058 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 07:02:27,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 07:02:27,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:27,260 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 07:02:27,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:27,261 INFO L85 PathProgramCache]: Analyzing trace with hash 172439, now seen corresponding path program 1 times [2023-11-29 07:02:27,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:02:27,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969985557] [2023-11-29 07:02:27,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:27,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:27,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:02:27,263 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:02:27,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 07:02:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:27,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 07:02:27,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:27,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 07:02:27,347 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-29 07:02:27,347 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:02:27,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:02:27,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969985557] [2023-11-29 07:02:27,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969985557] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:27,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:27,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 07:02:27,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832062920] [2023-11-29 07:02:27,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:27,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:02:27,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:02:27,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:02:27,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:02:27,351 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:27,521 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2023-11-29 07:02:27,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:02:27,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-29 07:02:27,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:27,523 INFO L225 Difference]: With dead ends: 53 [2023-11-29 07:02:27,524 INFO L226 Difference]: Without dead ends: 53 [2023-11-29 07:02:27,524 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-29 07:02:27,525 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 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.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:27,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 07:02:27,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-29 07:02:27,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-11-29 07:02:27,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 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-29 07:02:27,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2023-11-29 07:02:27,533 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 3 [2023-11-29 07:02:27,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:27,533 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2023-11-29 07:02:27,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:27,534 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2023-11-29 07:02:27,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 07:02:27,534 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:27,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:27,537 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 07:02:27,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:27,736 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 07:02:27,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:27,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1828434129, now seen corresponding path program 1 times [2023-11-29 07:02:27,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:02:27,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538179078] [2023-11-29 07:02:27,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:27,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:27,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:02:27,740 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:02:27,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 07:02:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:27,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 07:02:27,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:27,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 07:02:27,859 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-29 07:02:27,859 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:02:27,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:02:27,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538179078] [2023-11-29 07:02:27,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538179078] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:27,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:27,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:02:27,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576548901] [2023-11-29 07:02:27,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:27,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:02:27,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:02:27,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:02:27,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:02:27,862 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:28,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:28,008 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2023-11-29 07:02:28,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:02:28,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 07:02:28,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:28,010 INFO L225 Difference]: With dead ends: 51 [2023-11-29 07:02:28,010 INFO L226 Difference]: Without dead ends: 51 [2023-11-29 07:02:28,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-29 07:02:28,011 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:28,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 66 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:02:28,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-29 07:02:28,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-29 07:02:28,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.896551724137931) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 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-29 07:02:28,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2023-11-29 07:02:28,019 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 8 [2023-11-29 07:02:28,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:28,019 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2023-11-29 07:02:28,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:28,019 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2023-11-29 07:02:28,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 07:02:28,020 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:28,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:28,022 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 07:02:28,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:28,221 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 07:02:28,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:28,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1828434130, now seen corresponding path program 1 times [2023-11-29 07:02:28,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:02:28,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880356423] [2023-11-29 07:02:28,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:28,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:28,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:02:28,225 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:02:28,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 07:02:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:28,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 07:02:28,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:28,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 07:02:28,340 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-29 07:02:28,341 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:02:28,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:02:28,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880356423] [2023-11-29 07:02:28,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880356423] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:28,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:28,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:02:28,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385891957] [2023-11-29 07:02:28,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:28,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:02:28,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:02:28,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:02:28,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:02:28,344 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:28,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:28,514 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2023-11-29 07:02:28,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:02:28,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 07:02:28,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:28,517 INFO L225 Difference]: With dead ends: 49 [2023-11-29 07:02:28,517 INFO L226 Difference]: Without dead ends: 49 [2023-11-29 07:02:28,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-29 07:02:28,518 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:28,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 69 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 07:02:28,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-29 07:02:28,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-29 07:02:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:28,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2023-11-29 07:02:28,524 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 8 [2023-11-29 07:02:28,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:28,525 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2023-11-29 07:02:28,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:28,525 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2023-11-29 07:02:28,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 07:02:28,526 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:28,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:28,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 07:02:28,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:28,735 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 07:02:28,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:28,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1828432688, now seen corresponding path program 1 times [2023-11-29 07:02:28,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:02:28,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234361611] [2023-11-29 07:02:28,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:28,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:28,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:02:28,737 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:02:28,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 07:02:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:28,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 07:02:28,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:28,829 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-29 07:02:28,830 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:02:28,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:02:28,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234361611] [2023-11-29 07:02:28,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234361611] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:28,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:28,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:02:28,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927129559] [2023-11-29 07:02:28,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:28,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:02:28,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:02:28,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:02:28,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:02:28,832 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:28,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:28,900 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2023-11-29 07:02:28,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:02:28,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 07:02:28,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:28,902 INFO L225 Difference]: With dead ends: 56 [2023-11-29 07:02:28,902 INFO L226 Difference]: Without dead ends: 56 [2023-11-29 07:02:28,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-29 07:02:28,903 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:28,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 86 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:02:28,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-29 07:02:28,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2023-11-29 07:02:28,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.8) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:28,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-11-29 07:02:28,909 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 8 [2023-11-29 07:02:28,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:28,910 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-11-29 07:02:28,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:28,910 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-11-29 07:02:28,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 07:02:28,911 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:28,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:28,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 07:02:29,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:29,114 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 07:02:29,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:29,114 INFO L85 PathProgramCache]: Analyzing trace with hash 483574356, now seen corresponding path program 1 times [2023-11-29 07:02:29,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:02:29,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033291760] [2023-11-29 07:02:29,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:29,115 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:29,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:02:29,115 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:02:29,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 07:02:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:29,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 07:02:29,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:29,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 07:02:29,269 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 07:02:29,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 07:02:29,294 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-29 07:02:29,294 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:02:29,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:02:29,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033291760] [2023-11-29 07:02:29,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033291760] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:29,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:29,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:02:29,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746451047] [2023-11-29 07:02:29,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:29,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 07:02:29,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:02:29,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 07:02:29,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 07:02:29,297 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 4 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-29 07:02:29,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:29,534 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2023-11-29 07:02:29,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 07:02:29,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-29 07:02:29,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:29,536 INFO L225 Difference]: With dead ends: 55 [2023-11-29 07:02:29,536 INFO L226 Difference]: Without dead ends: 55 [2023-11-29 07:02:29,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:02:29,537 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 17 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:29,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 80 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 07:02:29,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-29 07:02:29,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2023-11-29 07:02:29,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 53 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:29,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2023-11-29 07:02:29,542 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 10 [2023-11-29 07:02:29,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:29,542 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2023-11-29 07:02:29,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-29 07:02:29,543 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2023-11-29 07:02:29,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 07:02:29,543 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:29,543 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:29,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-29 07:02:29,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:29,744 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 07:02:29,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:29,744 INFO L85 PathProgramCache]: Analyzing trace with hash 483574357, now seen corresponding path program 1 times [2023-11-29 07:02:29,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:02:29,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212364434] [2023-11-29 07:02:29,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:29,745 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:29,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:02:29,746 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:02:29,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 07:02:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:29,860 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 07:02:29,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:29,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 07:02:29,942 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 07:02:29,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-29 07:02:29,998 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-29 07:02:29,999 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:02:29,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:02:29,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212364434] [2023-11-29 07:02:29,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212364434] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:29,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:29,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:02:29,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158456798] [2023-11-29 07:02:29,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:30,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 07:02:30,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:02:30,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 07:02:30,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 07:02:30,001 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 4 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-29 07:02:30,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:30,234 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2023-11-29 07:02:30,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 07:02:30,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-29 07:02:30,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:30,235 INFO L225 Difference]: With dead ends: 54 [2023-11-29 07:02:30,235 INFO L226 Difference]: Without dead ends: 54 [2023-11-29 07:02:30,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:02:30,236 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 15 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:30,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 87 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 07:02:30,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-29 07:02:30,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-29 07:02:30,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 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-29 07:02:30,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2023-11-29 07:02:30,241 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 10 [2023-11-29 07:02:30,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:30,241 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2023-11-29 07:02:30,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-29 07:02:30,242 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2023-11-29 07:02:30,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 07:02:30,242 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:30,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:30,245 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 07:02:30,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:30,443 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 07:02:30,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:30,443 INFO L85 PathProgramCache]: Analyzing trace with hash 846250062, now seen corresponding path program 1 times [2023-11-29 07:02:30,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:02:30,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [994000299] [2023-11-29 07:02:30,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:30,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:30,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:02:30,445 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:02:30,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 07:02:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:30,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 07:02:30,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:30,573 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-29 07:02:30,574 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:02:30,617 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-29 07:02:30,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:02:30,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [994000299] [2023-11-29 07:02:30,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [994000299] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:02:30,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:02:30,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-11-29 07:02:30,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389486393] [2023-11-29 07:02:30,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:02:30,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:02:30,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:02:30,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:02:30,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:02:30,618 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:30,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:30,750 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2023-11-29 07:02:30,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:02:30,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 13 [2023-11-29 07:02:30,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:30,751 INFO L225 Difference]: With dead ends: 69 [2023-11-29 07:02:30,751 INFO L226 Difference]: Without dead ends: 69 [2023-11-29 07:02:30,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-11-29 07:02:30,752 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 26 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:30,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 138 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:02:30,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-29 07:02:30,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2023-11-29 07:02:30,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 64 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-29 07:02:30,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2023-11-29 07:02:30,758 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 13 [2023-11-29 07:02:30,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:30,758 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2023-11-29 07:02:30,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:30,758 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2023-11-29 07:02:30,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 07:02:30,759 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:30,759 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:30,762 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 07:02:30,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:30,959 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 07:02:30,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:30,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1498875890, now seen corresponding path program 1 times [2023-11-29 07:02:30,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:02:30,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764442638] [2023-11-29 07:02:30,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:30,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:30,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:02:30,961 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:02:30,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 07:02:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:31,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 07:02:31,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:31,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 07:02:31,144 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 07:02:31,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 07:02:31,162 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-29 07:02:31,162 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:02:31,198 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-29 07:02:31,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:02:31,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764442638] [2023-11-29 07:02:31,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1764442638] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:02:31,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:02:31,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2023-11-29 07:02:31,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908619758] [2023-11-29 07:02:31,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:02:31,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 07:02:31,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:02:31,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 07:02:31,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 07:02:31,200 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-29 07:02:31,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:31,388 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2023-11-29 07:02:31,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 07:02:31,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2023-11-29 07:02:31,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:31,389 INFO L225 Difference]: With dead ends: 63 [2023-11-29 07:02:31,389 INFO L226 Difference]: Without dead ends: 63 [2023-11-29 07:02:31,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:02:31,390 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:31,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 82 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 07:02:31,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-29 07:02:31,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-29 07:02:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.5333333333333334) internal successors, (69), 62 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-29 07:02:31,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2023-11-29 07:02:31,394 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 15 [2023-11-29 07:02:31,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:31,394 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2023-11-29 07:02:31,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-29 07:02:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2023-11-29 07:02:31,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 07:02:31,395 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:31,395 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:31,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 07:02:31,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:31,596 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 07:02:31,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:31,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1498875891, now seen corresponding path program 1 times [2023-11-29 07:02:31,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:02:31,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091123493] [2023-11-29 07:02:31,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:31,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:31,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:02:31,597 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:02:31,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 07:02:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:31,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 07:02:31,747 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:31,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 07:02:31,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 07:02:31,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:02:31,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 07:02:31,855 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 07:02:31,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 07:02:31,889 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-29 07:02:31,890 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:02:32,359 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-29 07:02:32,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:02:32,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091123493] [2023-11-29 07:02:32,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091123493] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:02:32,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:02:32,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-11-29 07:02:32,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896596587] [2023-11-29 07:02:32,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:02:32,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 07:02:32,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:02:32,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 07:02:32,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 07:02:32,362 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 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-29 07:02:32,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:32,931 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2023-11-29 07:02:32,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 07:02:32,932 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 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 15 [2023-11-29 07:02:32,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:32,932 INFO L225 Difference]: With dead ends: 61 [2023-11-29 07:02:32,932 INFO L226 Difference]: Without dead ends: 61 [2023-11-29 07:02:32,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-29 07:02:32,933 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 7 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:32,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 96 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 07:02:32,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-29 07:02:32,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-29 07:02:32,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:32,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2023-11-29 07:02:32,937 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 15 [2023-11-29 07:02:32,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:32,938 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2023-11-29 07:02:32,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 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-29 07:02:32,938 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2023-11-29 07:02:32,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 07:02:32,939 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:32,939 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:32,942 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 07:02:33,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:33,140 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 07:02:33,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:33,140 INFO L85 PathProgramCache]: Analyzing trace with hash 311681207, now seen corresponding path program 1 times [2023-11-29 07:02:33,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:02:33,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075948343] [2023-11-29 07:02:33,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:33,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:33,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:02:33,142 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:02:33,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 07:02:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:33,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 07:02:33,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:33,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 07:02:33,391 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 07:02:33,391 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:02:33,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:02:33,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075948343] [2023-11-29 07:02:33,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075948343] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:33,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:33,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 07:02:33,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833147477] [2023-11-29 07:02:33,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:33,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:02:33,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:02:33,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:02:33,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:02:33,393 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:33,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:33,679 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2023-11-29 07:02:33,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 07:02:33,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-29 07:02:33,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:33,681 INFO L225 Difference]: With dead ends: 61 [2023-11-29 07:02:33,681 INFO L226 Difference]: Without dead ends: 61 [2023-11-29 07:02:33,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:02:33,682 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:33,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 60 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 07:02:33,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-29 07:02:33,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2023-11-29 07:02:33,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2023-11-29 07:02:33,685 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 29 [2023-11-29 07:02:33,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:33,686 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2023-11-29 07:02:33,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:33,686 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2023-11-29 07:02:33,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 07:02:33,687 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:33,687 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:33,692 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 07:02:33,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:33,887 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 07:02:33,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:33,888 INFO L85 PathProgramCache]: Analyzing trace with hash 311681208, now seen corresponding path program 1 times [2023-11-29 07:02:33,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:02:33,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313567310] [2023-11-29 07:02:33,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:33,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:33,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:02:33,889 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:02:33,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 07:02:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:34,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 07:02:34,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:34,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 07:02:34,208 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 07:02:34,209 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:02:34,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:02:34,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313567310] [2023-11-29 07:02:34,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313567310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:34,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:34,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 07:02:34,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152298853] [2023-11-29 07:02:34,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:34,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:02:34,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:02:34,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:02:34,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:02:34,211 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:34,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:34,515 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2023-11-29 07:02:34,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:02:34,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-29 07:02:34,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:34,516 INFO L225 Difference]: With dead ends: 64 [2023-11-29 07:02:34,517 INFO L226 Difference]: Without dead ends: 64 [2023-11-29 07:02:34,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:02:34,517 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:34,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 85 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 07:02:34,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-29 07:02:34,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2023-11-29 07:02:34,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.346938775510204) internal successors, (66), 60 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:34,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2023-11-29 07:02:34,520 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 29 [2023-11-29 07:02:34,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:34,520 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2023-11-29 07:02:34,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:34,520 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2023-11-29 07:02:34,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 07:02:34,521 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:34,521 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:34,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-29 07:02:34,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:34,722 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 07:02:34,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:34,722 INFO L85 PathProgramCache]: Analyzing trace with hash -424413485, now seen corresponding path program 1 times [2023-11-29 07:02:34,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:02:34,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131423102] [2023-11-29 07:02:34,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:34,723 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:34,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:02:34,723 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:02:34,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 07:02:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:35,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 07:02:35,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:35,205 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2023-11-29 07:02:35,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2023-11-29 07:02:35,328 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 07:02:35,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2023-11-29 07:02:35,516 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 07:02:35,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 07:02:35,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 07:02:35,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 07:02:35,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 07:02:35,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 07:02:35,848 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:02:35,849 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:02:36,001 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_652 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_654 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2023-11-29 07:02:36,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:02:36,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2023-11-29 07:02:36,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2023-11-29 07:02:36,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 07:02:36,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-11-29 07:02:37,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:02:37,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 121 [2023-11-29 07:02:37,404 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-29 07:02:37,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:02:37,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131423102] [2023-11-29 07:02:37,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [131423102] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:02:37,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:02:37,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2023-11-29 07:02:37,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292729625] [2023-11-29 07:02:37,405 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:02:37,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 07:02:37,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:02:37,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 07:02:37,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=596, Unknown=7, NotChecked=50, Total=756 [2023-11-29 07:02:37,407 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 28 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 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-29 07:02:38,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:38,575 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2023-11-29 07:02:38,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 07:02:38,575 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-29 07:02:38,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:38,576 INFO L225 Difference]: With dead ends: 61 [2023-11-29 07:02:38,576 INFO L226 Difference]: Without dead ends: 61 [2023-11-29 07:02:38,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=226, Invalid=893, Unknown=7, NotChecked=64, Total=1190 [2023-11-29 07:02:38,577 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 58 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:38,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 367 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 322 Invalid, 0 Unknown, 27 Unchecked, 0.8s Time] [2023-11-29 07:02:38,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-29 07:02:38,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-29 07:02:38,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:38,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2023-11-29 07:02:38,580 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 32 [2023-11-29 07:02:38,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:38,580 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2023-11-29 07:02:38,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 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-29 07:02:38,581 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2023-11-29 07:02:38,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 07:02:38,582 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:38,582 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:38,587 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 07:02:38,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:38,784 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 07:02:38,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:38,785 INFO L85 PathProgramCache]: Analyzing trace with hash 160606883, now seen corresponding path program 1 times [2023-11-29 07:02:38,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:02:38,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444856354] [2023-11-29 07:02:38,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:38,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:38,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:02:38,786 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:02:38,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 07:02:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:39,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 07:02:39,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:39,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 07:02:39,062 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 07:02:39,062 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:02:39,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:02:39,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444856354] [2023-11-29 07:02:39,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444856354] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:39,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:39,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:02:39,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428493794] [2023-11-29 07:02:39,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:39,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:02:39,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:02:39,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:02:39,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:02:39,064 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:39,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:39,349 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2023-11-29 07:02:39,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 07:02:39,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-29 07:02:39,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:39,350 INFO L225 Difference]: With dead ends: 65 [2023-11-29 07:02:39,350 INFO L226 Difference]: Without dead ends: 65 [2023-11-29 07:02:39,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 07:02:39,351 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:39,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 64 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 07:02:39,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-29 07:02:39,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2023-11-29 07:02:39,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:39,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2023-11-29 07:02:39,353 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 34 [2023-11-29 07:02:39,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:39,354 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2023-11-29 07:02:39,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:39,354 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2023-11-29 07:02:39,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 07:02:39,355 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:39,355 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:39,360 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 07:02:39,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:39,556 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 07:02:39,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:39,556 INFO L85 PathProgramCache]: Analyzing trace with hash 160606884, now seen corresponding path program 1 times [2023-11-29 07:02:39,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:02:39,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306956445] [2023-11-29 07:02:39,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:39,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:39,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:02:39,558 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:02:39,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 07:02:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:39,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 07:02:39,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:39,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 07:02:39,874 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 07:02:39,874 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:02:39,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:02:39,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306956445] [2023-11-29 07:02:39,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306956445] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:39,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:39,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:02:39,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67205506] [2023-11-29 07:02:39,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:39,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:02:39,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:02:39,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:02:39,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:02:39,876 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:40,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:40,265 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2023-11-29 07:02:40,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 07:02:40,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-29 07:02:40,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:40,266 INFO L225 Difference]: With dead ends: 62 [2023-11-29 07:02:40,266 INFO L226 Difference]: Without dead ends: 62 [2023-11-29 07:02:40,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 07:02:40,267 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:40,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 88 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 07:02:40,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-29 07:02:40,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2023-11-29 07:02:40,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:40,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2023-11-29 07:02:40,270 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 34 [2023-11-29 07:02:40,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:40,270 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2023-11-29 07:02:40,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:40,271 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2023-11-29 07:02:40,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 07:02:40,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:40,272 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:40,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 07:02:40,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:40,472 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 07:02:40,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:40,473 INFO L85 PathProgramCache]: Analyzing trace with hash 160606921, now seen corresponding path program 1 times [2023-11-29 07:02:40,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:02:40,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [698499534] [2023-11-29 07:02:40,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:40,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:40,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:02:40,474 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:02:40,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 07:02:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:40,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-29 07:02:40,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:40,939 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2023-11-29 07:02:40,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2023-11-29 07:02:40,991 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 07:02:40,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2023-11-29 07:02:41,107 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 07:02:41,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 07:02:41,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 07:02:41,186 INFO L378 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-29 07:02:41,214 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:02:41,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 07:02:41,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2023-11-29 07:02:41,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 07:02:41,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:02:41,382 INFO L378 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 43 treesize of output 30 [2023-11-29 07:02:41,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:02:41,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 07:02:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:02:41,427 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:02:45,621 INFO L349 Elim1Store]: treesize reduction 7, result has 68.2 percent of original size [2023-11-29 07:02:45,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2023-11-29 07:02:45,738 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1016 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store (select |c_#memory_$Pointer$#1.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_1016 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1016)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1017) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1018) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) is different from false [2023-11-29 07:02:45,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 140 [2023-11-29 07:02:45,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 07:02:45,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2023-11-29 07:02:46,016 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-29 07:02:46,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 07:02:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 29 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-29 07:02:46,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:02:46,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [698499534] [2023-11-29 07:02:46,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [698499534] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:02:46,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:02:46,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 19 [2023-11-29 07:02:46,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198313677] [2023-11-29 07:02:46,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:02:46,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 07:02:46,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:02:46,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 07:02:46,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=287, Unknown=7, NotChecked=34, Total=380 [2023-11-29 07:02:46,031 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 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-29 07:02:47,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:47,522 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2023-11-29 07:02:47,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 07:02:47,523 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 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 34 [2023-11-29 07:02:47,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:47,523 INFO L225 Difference]: With dead ends: 65 [2023-11-29 07:02:47,523 INFO L226 Difference]: Without dead ends: 65 [2023-11-29 07:02:47,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=131, Invalid=516, Unknown=7, NotChecked=48, Total=702 [2023-11-29 07:02:47,524 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 47 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:47,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 190 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 386 Invalid, 0 Unknown, 43 Unchecked, 1.1s Time] [2023-11-29 07:02:47,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-29 07:02:47,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2023-11-29 07:02:47,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 60 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-29 07:02:47,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2023-11-29 07:02:47,527 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 34 [2023-11-29 07:02:47,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:47,528 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2023-11-29 07:02:47,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 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-29 07:02:47,528 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2023-11-29 07:02:47,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 07:02:47,528 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:47,528 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:47,534 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-11-29 07:02:47,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:47,729 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 07:02:47,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:47,729 INFO L85 PathProgramCache]: Analyzing trace with hash 160606922, now seen corresponding path program 1 times [2023-11-29 07:02:47,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:02:47,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833493081] [2023-11-29 07:02:47,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:47,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:47,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:02:47,731 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:02:47,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 07:02:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:48,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-29 07:02:48,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:48,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 07:02:48,229 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2023-11-29 07:02:48,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2023-11-29 07:02:48,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 07:02:48,317 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 07:02:48,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2023-11-29 07:02:48,497 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 07:02:48,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 07:02:48,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 07:02:48,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 07:02:48,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 07:02:48,662 INFO L378 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-29 07:02:48,675 INFO L378 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-29 07:02:48,708 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:02:48,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 07:02:48,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 07:02:48,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-29 07:02:48,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 07:02:48,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-11-29 07:02:48,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 07:02:48,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 07:02:48,981 INFO L378 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 41 treesize of output 28 [2023-11-29 07:02:49,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-11-29 07:02:49,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 07:02:49,054 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:02:49,054 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:02:49,425 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1153 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1153) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1153 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1154 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1153) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1154) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1)))))) is different from false [2023-11-29 07:02:49,824 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (forall ((v_ArrVal_1149 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1149 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1149)) (forall ((v_ArrVal_1148 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_1148 (store (select |c_#memory_$Pointer$#1.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_1148 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_1152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1150 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1153 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1154 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1149) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1152) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1153) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (select |c_#length| (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1148) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1150) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1154) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))))))) (forall ((v_ArrVal_1149 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1153 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1149) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1152) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1153) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))) (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1149 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1149)))))) is different from false [2023-11-29 07:02:49,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 292 [2023-11-29 07:02:49,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 806 treesize of output 804 [2023-11-29 07:02:49,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2023-11-29 07:02:49,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2023-11-29 07:02:49,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2023-11-29 07:02:49,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2023-11-29 07:02:49,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 188 [2023-11-29 07:02:49,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2023-11-29 07:02:50,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2023-11-29 07:02:50,858 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-29 07:02:50,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2023-11-29 07:02:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 21 refuted. 1 times theorem prover too weak. 0 trivial. 7 not checked. [2023-11-29 07:02:50,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:02:50,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833493081] [2023-11-29 07:02:50,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833493081] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:02:50,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:02:50,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 22 [2023-11-29 07:02:50,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094985208] [2023-11-29 07:02:50,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:02:50,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 07:02:50,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:02:50,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 07:02:50,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=357, Unknown=4, NotChecked=78, Total=506 [2023-11-29 07:02:50,879 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 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-29 07:02:55,994 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1))) (let ((.cse2 (bvadd (_ bv4 32) .cse3))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1))) (= (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv12 32)) (forall ((v_ArrVal_1153 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1153) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1153 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1154 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1153) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1154) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1)))) (bvule .cse2 (select |c_#length| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (bvule .cse3 .cse2) (= (_ bv0 1) (bvadd (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (_ bv1 1))))))) is different from false [2023-11-29 07:02:58,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:58,484 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2023-11-29 07:02:58,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 07:02:58,486 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 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 34 [2023-11-29 07:02:58,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:58,486 INFO L225 Difference]: With dead ends: 69 [2023-11-29 07:02:58,486 INFO L226 Difference]: Without dead ends: 69 [2023-11-29 07:02:58,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=178, Invalid=698, Unknown=6, NotChecked=174, Total=1056 [2023-11-29 07:02:58,487 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 50 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:58,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 154 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 399 Invalid, 0 Unknown, 124 Unchecked, 4.8s Time] [2023-11-29 07:02:58,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-29 07:02:58,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2023-11-29 07:02:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 62 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-29 07:02:58,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2023-11-29 07:02:58,490 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 34 [2023-11-29 07:02:58,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:58,490 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2023-11-29 07:02:58,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 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-29 07:02:58,490 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2023-11-29 07:02:58,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 07:02:58,491 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:58,491 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:58,498 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 07:02:58,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:58,692 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 07:02:58,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:58,692 INFO L85 PathProgramCache]: Analyzing trace with hash -275547327, now seen corresponding path program 1 times [2023-11-29 07:02:58,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:02:58,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409327160] [2023-11-29 07:02:58,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:58,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:58,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:02:58,694 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:02:58,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 07:02:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:59,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 07:02:59,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:59,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 07:02:59,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 07:02:59,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 07:02:59,203 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 07:02:59,203 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:02:59,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:02:59,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409327160] [2023-11-29 07:02:59,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409327160] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:59,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:59,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 07:02:59,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778267513] [2023-11-29 07:02:59,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:59,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 07:02:59,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:02:59,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 07:02:59,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 07:02:59,205 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:59,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:59,969 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2023-11-29 07:02:59,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 07:02:59,970 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-11-29 07:02:59,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:59,970 INFO L225 Difference]: With dead ends: 72 [2023-11-29 07:02:59,970 INFO L226 Difference]: Without dead ends: 72 [2023-11-29 07:02:59,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-11-29 07:02:59,971 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 34 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:59,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 105 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 07:02:59,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-29 07:02:59,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2023-11-29 07:02:59,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.280701754385965) internal successors, (73), 65 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-29 07:02:59,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2023-11-29 07:02:59,974 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 36 [2023-11-29 07:02:59,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:59,974 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2023-11-29 07:02:59,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:59,975 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2023-11-29 07:02:59,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 07:02:59,975 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:59,975 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:59,981 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-29 07:03:00,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:03:00,176 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 07:03:00,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:03:00,176 INFO L85 PathProgramCache]: Analyzing trace with hash -275547326, now seen corresponding path program 1 times [2023-11-29 07:03:00,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:03:00,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027796730] [2023-11-29 07:03:00,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:03:00,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:03:00,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:03:00,178 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:03:00,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 07:03:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:03:00,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-29 07:03:00,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:03:00,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 07:03:00,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 07:03:00,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 07:03:00,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 07:03:00,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 07:03:00,880 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 07:03:00,881 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:03:00,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:03:00,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027796730] [2023-11-29 07:03:00,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1027796730] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:03:00,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:03:00,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 07:03:00,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313119949] [2023-11-29 07:03:00,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:03:00,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 07:03:00,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:03:00,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 07:03:00,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 07:03:00,883 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:03:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:03:01,464 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2023-11-29 07:03:01,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 07:03:01,465 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-11-29 07:03:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:03:01,465 INFO L225 Difference]: With dead ends: 79 [2023-11-29 07:03:01,465 INFO L226 Difference]: Without dead ends: 79 [2023-11-29 07:03:01,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-11-29 07:03:01,466 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 24 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 07:03:01,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 89 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 07:03:01,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-29 07:03:01,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2023-11-29 07:03:01,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 68 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:03:01,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2023-11-29 07:03:01,469 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 36 [2023-11-29 07:03:01,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:03:01,469 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2023-11-29 07:03:01,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:03:01,469 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2023-11-29 07:03:01,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-29 07:03:01,470 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:03:01,470 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:03:01,475 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-11-29 07:03:01,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:03:01,670 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-29 07:03:01,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:03:01,671 INFO L85 PathProgramCache]: Analyzing trace with hash 47258497, now seen corresponding path program 1 times [2023-11-29 07:03:01,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:03:01,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292731709] [2023-11-29 07:03:01,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:03:01,672 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:03:01,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:03:01,673 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:03:01,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e04664f-aea2-490a-9793-d0402e2d108f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-29 07:03:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:03:02,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 07:03:02,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:03:02,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 07:03:02,386 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2023-11-29 07:03:02,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2023-11-29 07:03:02,518 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 07:03:02,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 07:03:02,764 INFO L349 Elim1Store]: treesize reduction 96, result has 26.2 percent of original size [2023-11-29 07:03:02,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 59 [2023-11-29 07:03:03,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 07:03:03,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 07:03:03,366 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-11-29 07:03:03,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 34 treesize of output 40 [2023-11-29 07:03:03,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 07:03:03,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 07:03:03,530 INFO L378 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-29 07:03:03,623 INFO L378 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-29 07:03:03,643 INFO L378 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-29 07:03:03,658 INFO L378 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-29 07:03:03,713 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:03:03,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 74 [2023-11-29 07:03:03,723 INFO L378 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-29 07:03:03,744 INFO L378 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-29 07:03:03,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 07:03:03,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-11-29 07:03:03,922 INFO L378 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-29 07:03:03,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 07:03:03,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2023-11-29 07:03:03,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 07:03:04,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 07:03:04,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 07:03:04,177 INFO L378 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 55 treesize of output 34 [2023-11-29 07:03:04,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2023-11-29 07:03:04,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 07:03:04,314 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:03:04,315 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:03:04,701 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1545 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1543) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1554) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1545) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1546) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0))))) is different from false [2023-11-29 07:03:04,751 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1541 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1545 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1546 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (let ((.cse0 (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_1542 .cse0))) v_ArrVal_1542)) (= |c_ULTIMATE.start_main_~data_init~0#1| (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1542) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1543) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1554) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1539) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1545) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1541) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1546) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))))) is different from false [2023-11-29 07:03:04,820 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1541 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1545 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1537 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1546 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1536 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (let ((.cse0 (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)))) (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1538) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_1542 .cse0))) v_ArrVal_1542)) (not (= (store (select |c_#memory_$Pointer$#1.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_1537 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1537)) (= |c_ULTIMATE.start_main_~data_init~0#1| (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1542) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1543) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1554) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1537) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1539) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1545) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1536) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1541) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1546) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))) (not (= (store (select |c_#memory_$Pointer$#1.offset| |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_1536 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1536)))) is different from false [2023-11-29 07:03:04,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 366 treesize of output 364 [2023-11-29 07:03:04,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2023-11-29 07:03:04,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 534 treesize of output 532 [2023-11-29 07:03:04,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2023-11-29 07:03:04,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2023-11-29 07:03:04,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2023-11-29 07:03:05,485 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse4 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse0 (not .cse6)) (.cse1 (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)))) (and (or .cse0 (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_1542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1538 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse2 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1542) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1543) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1554))) (or (not (= (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1538) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_1542 .cse1)) v_ArrVal_1542)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse2 v_arrayElimCell_110) v_arrayElimCell_112)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse2 v_arrayElimCell_113) v_arrayElimCell_114)))))) (forall ((v_ArrVal_1542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1538 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_1543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1554 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse3 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1542) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1543) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1554))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse3 v_arrayElimCell_110) v_arrayElimCell_112)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse3 v_arrayElimCell_113) v_arrayElimCell_114)) (= |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|))))) (not (= (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1538) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_1542 .cse1)) v_ArrVal_1542)))) (or (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_1542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1538 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1538) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_1542 .cse1)) v_ArrVal_1542)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1542) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1543) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1554) v_arrayElimCell_113) v_arrayElimCell_114)))) (not .cse4)) (or .cse4 (and (forall ((v_ArrVal_1542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1538 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1538) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_1542 .cse1)) v_ArrVal_1542)) (forall ((v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_1543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1554 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse5 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1542) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1543) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1554))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse5 v_arrayElimCell_110) v_arrayElimCell_112)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) (or (forall ((v_ArrVal_1542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1538 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1538) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_1542 .cse1)) v_ArrVal_1542)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1542) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1543) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1554) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) .cse6) (or .cse0 (forall ((v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_1542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1538 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_110 (_ BitVec 32))) (or (not (= (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1538) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_1542 .cse1)) v_ArrVal_1542)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1542) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1543) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1554) v_arrayElimCell_110) v_arrayElimCell_112))))))) (or (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_1542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1538 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1542) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1543) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1554))) (or (not (= (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1538) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_1542 .cse1)) v_ArrVal_1542)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse7 v_arrayElimCell_113) v_arrayElimCell_114)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) .cse6)))) is different from false [2023-11-29 07:03:09,181 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-29 07:03:09,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15556 treesize of output 15318 [2023-11-29 07:03:09,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:03:09,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 572 treesize of output 564 [2023-11-29 07:03:09,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:03:09,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 308 treesize of output 308 [2023-11-29 07:03:09,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 309 treesize of output 301 [2023-11-29 07:03:09,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:03:09,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 478 treesize of output 466 [2023-11-29 07:03:09,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:03:09,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 127 [2023-11-29 07:03:11,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 07:03:12,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:03:12,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 369 treesize of output 351 [2023-11-29 07:03:13,312 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:03:13,440 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-29 07:03:13,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31014 treesize of output 30520 [2023-11-29 07:03:13,509 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:03:13,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:03:13,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 219 [2023-11-29 07:03:13,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:03:13,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 213 [2023-11-29 07:03:13,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 280 [2023-11-29 07:03:13,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:03:13,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 114 [2023-11-29 07:03:15,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 07:03:15,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:03:15,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 170 [2023-11-29 07:03:16,147 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-29 07:03:16,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 263 treesize of output 273 [2023-11-29 07:03:16,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 100 [2023-11-29 07:03:16,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:03:16,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 205 [2023-11-29 07:03:17,281 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2023-11-29 07:03:17,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 132 treesize of output 146 [2023-11-29 07:03:17,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:03:17,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2023-11-29 07:03:17,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-11-29 07:03:17,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 07:03:17,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:03:17,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 45 [2023-11-29 07:03:17,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2023-11-29 07:03:17,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2023-11-29 07:03:17,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:03:17,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 53 [2023-11-29 07:03:17,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:03:17,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 53 [2023-11-29 07:03:18,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:03:18,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 117 [2023-11-29 07:03:18,501 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:03:18,859 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2023-11-29 07:03:18,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46491 treesize of output 45770 [2023-11-29 07:03:18,964 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:03:19,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:03:19,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 406 treesize of output 414 [2023-11-29 07:03:19,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:03:19,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 400 treesize of output 410 [2023-11-29 07:03:19,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:03:19,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 591 treesize of output 567 [2023-11-29 07:03:19,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:03:19,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 228 [2023-11-29 07:03:19,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 07:04:06,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 07:04:06,687 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 07:04:24,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 07:04:24,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 07:04:24,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2023-11-29 07:04:27,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 07:04:27,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 07:04:28,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 07:04:28,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 07:04:29,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 07:04:29,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 07:04:36,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:04:36,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-11-29 07:04:36,667 WARN L214 Elim1Store]: Array PQE input equivalent to true