./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bbb47797d2c6a4d5e961c4dfd7a8e6f4ff79c632e04c289068b1b9e8cca736fa --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:22:17,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:22:17,532 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:22:17,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:22:17,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:22:17,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:22:17,583 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:22:17,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:22:17,586 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:22:17,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:22:17,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:22:17,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:22:17,595 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:22:17,597 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:22:17,598 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:22:17,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:22:17,599 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:22:17,599 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:22:17,600 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:22:17,601 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:22:17,601 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:22:17,602 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:22:17,603 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:22:17,603 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:22:17,604 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:22:17,604 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:22:17,606 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:22:17,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:22:17,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:22:17,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:22:17,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:22:17,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:22:17,610 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:22:17,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:22:17,610 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:22:17,611 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:22:17,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:22:17,612 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:22:17,612 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_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bbb47797d2c6a4d5e961c4dfd7a8e6f4ff79c632e04c289068b1b9e8cca736fa [2023-11-06 22:22:17,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:22:18,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:22:18,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:22:18,014 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:22:18,015 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:22:18,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.i [2023-11-06 22:22:21,196 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:22:21,533 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:22:21,535 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.i [2023-11-06 22:22:21,567 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/data/24e53e34e/1d18182c6c304192ab6ae0d12f4f55b9/FLAG6711348d2 [2023-11-06 22:22:21,583 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/data/24e53e34e/1d18182c6c304192ab6ae0d12f4f55b9 [2023-11-06 22:22:21,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:22:21,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:22:21,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:22:21,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:22:21,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:22:21,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:22:21" (1/1) ... [2023-11-06 22:22:21,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45822f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:21, skipping insertion in model container [2023-11-06 22:22:21,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:22:21" (1/1) ... [2023-11-06 22:22:21,682 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:22:22,264 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:22:22,278 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:22:22,333 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:22:22,508 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:22:22,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:22 WrapperNode [2023-11-06 22:22:22,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:22:22,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:22:22,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:22:22,510 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:22:22,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:22" (1/1) ... [2023-11-06 22:22:22,572 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:22" (1/1) ... [2023-11-06 22:22:22,616 INFO L138 Inliner]: procedures = 371, calls = 35, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 121 [2023-11-06 22:22:22,616 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:22:22,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:22:22,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:22:22,617 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:22:22,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:22" (1/1) ... [2023-11-06 22:22:22,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:22" (1/1) ... [2023-11-06 22:22:22,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:22" (1/1) ... [2023-11-06 22:22:22,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:22" (1/1) ... [2023-11-06 22:22:22,656 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:22" (1/1) ... [2023-11-06 22:22:22,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:22" (1/1) ... [2023-11-06 22:22:22,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:22" (1/1) ... [2023-11-06 22:22:22,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:22" (1/1) ... [2023-11-06 22:22:22,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:22:22,685 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:22:22,686 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:22:22,686 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:22:22,687 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:22" (1/1) ... [2023-11-06 22:22:22,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:22:22,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:22:22,741 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:22:22,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:22:22,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:22:22,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:22:22,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:22:22,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:22:22,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:22:22,793 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-06 22:22:22,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:22:22,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:22:22,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:22:22,794 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-06 22:22:22,794 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-06 22:22:22,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:22:22,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:22:22,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:22:22,797 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:22:22,971 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:22:22,977 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:22:23,462 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:22:23,473 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:22:23,473 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:22:23,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:23 BoogieIcfgContainer [2023-11-06 22:22:23,476 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:22:23,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:22:23,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:22:23,483 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:22:23,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:22:21" (1/3) ... [2023-11-06 22:22:23,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2543a7cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:22:23, skipping insertion in model container [2023-11-06 22:22:23,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:22" (2/3) ... [2023-11-06 22:22:23,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2543a7cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:22:23, skipping insertion in model container [2023-11-06 22:22:23,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:23" (3/3) ... [2023-11-06 22:22:23,487 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_09-arraylist.i [2023-11-06 22:22:23,514 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:22:23,514 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2023-11-06 22:22:23,516 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:22:23,671 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:22:23,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 189 transitions, 382 flow [2023-11-06 22:22:23,801 INFO L124 PetriNetUnfolderBase]: 4/188 cut-off events. [2023-11-06 22:22:23,801 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:22:23,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 188 events. 4/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 405 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2023-11-06 22:22:23,808 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 189 transitions, 382 flow [2023-11-06 22:22:23,816 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 188 places, 188 transitions, 379 flow [2023-11-06 22:22:23,821 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:22:23,832 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 188 transitions, 379 flow [2023-11-06 22:22:23,836 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 188 transitions, 379 flow [2023-11-06 22:22:23,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 188 places, 188 transitions, 379 flow [2023-11-06 22:22:23,940 INFO L124 PetriNetUnfolderBase]: 4/188 cut-off events. [2023-11-06 22:22:23,941 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:22:23,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 188 events. 4/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 405 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2023-11-06 22:22:23,947 INFO L119 LiptonReduction]: Number of co-enabled transitions 3192 [2023-11-06 22:22:48,515 WARN L293 SmtUtils]: Spent 7.03s on a formula simplification. DAG size of input: 186 DAG size of output: 174 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-06 22:22:56,698 WARN L293 SmtUtils]: Spent 6.43s on a formula simplification. DAG size of input: 190 DAG size of output: 178 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-06 22:22:58,792 INFO L134 LiptonReduction]: Checked pairs total: 12197 [2023-11-06 22:22:58,792 INFO L136 LiptonReduction]: Total number of compositions: 230 [2023-11-06 22:22:58,809 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:22:58,814 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;@1a9d2b73, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:22:58,815 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2023-11-06 22:22:58,818 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:22:58,819 INFO L124 PetriNetUnfolderBase]: 1/2 cut-off events. [2023-11-06 22:22:58,819 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:22:58,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:22:58,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:22:58,820 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-06 22:22:58,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:58,826 INFO L85 PathProgramCache]: Analyzing trace with hash 22664, now seen corresponding path program 1 times [2023-11-06 22:22:58,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:58,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410851085] [2023-11-06 22:22:58,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:58,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:59,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:22:59,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:59,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410851085] [2023-11-06 22:22:59,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410851085] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:59,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:59,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:22:59,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337248806] [2023-11-06 22:22:59,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:59,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:22:59,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:59,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:22:59,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:22:59,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 419 [2023-11-06 22:22:59,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:59,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:22:59,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 419 [2023-11-06 22:22:59,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:22:59,478 INFO L124 PetriNetUnfolderBase]: 209/488 cut-off events. [2023-11-06 22:22:59,478 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:22:59,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 488 events. 209/488 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2313 event pairs, 208 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 922. Up to 454 conditions per place. [2023-11-06 22:22:59,486 INFO L140 encePairwiseOnDemand]: 396/419 looper letters, 38 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-11-06 22:22:59,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 173 flow [2023-11-06 22:22:59,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:22:59,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:22:59,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 614 transitions. [2023-11-06 22:22:59,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4884645982498011 [2023-11-06 22:22:59,522 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 614 transitions. [2023-11-06 22:22:59,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 614 transitions. [2023-11-06 22:22:59,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:22:59,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 614 transitions. [2023-11-06 22:22:59,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:59,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:59,551 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:59,553 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 123 flow. Second operand 3 states and 614 transitions. [2023-11-06 22:22:59,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 173 flow [2023-11-06 22:22:59,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:22:59,560 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 102 flow [2023-11-06 22:22:59,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2023-11-06 22:22:59,568 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -16 predicate places. [2023-11-06 22:22:59,568 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 102 flow [2023-11-06 22:22:59,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:22:59,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:22:59,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:22:59,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:22:59,571 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-06 22:22:59,572 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:59,573 INFO L85 PathProgramCache]: Analyzing trace with hash 22711, now seen corresponding path program 1 times [2023-11-06 22:22:59,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:59,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156860137] [2023-11-06 22:22:59,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:59,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:59,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:22:59,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:59,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156860137] [2023-11-06 22:22:59,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156860137] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:59,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:59,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:22:59,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300818764] [2023-11-06 22:22:59,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:59,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:22:59,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:59,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:22:59,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:23:00,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 419 [2023-11-06 22:23:00,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:00,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:00,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 419 [2023-11-06 22:23:00,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:00,304 INFO L124 PetriNetUnfolderBase]: 196/446 cut-off events. [2023-11-06 22:23:00,305 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:23:00,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 446 events. 196/446 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2078 event pairs, 131 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 874. Up to 289 conditions per place. [2023-11-06 22:23:00,309 INFO L140 encePairwiseOnDemand]: 414/419 looper letters, 51 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-11-06 22:23:00,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 236 flow [2023-11-06 22:23:00,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:23:00,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:23:00,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 595 transitions. [2023-11-06 22:23:00,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4733492442322991 [2023-11-06 22:23:00,313 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 595 transitions. [2023-11-06 22:23:00,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 595 transitions. [2023-11-06 22:23:00,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:00,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 595 transitions. [2023-11-06 22:23:00,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:00,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:00,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:00,324 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 102 flow. Second operand 3 states and 595 transitions. [2023-11-06 22:23:00,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 236 flow [2023-11-06 22:23:00,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:23:00,326 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 104 flow [2023-11-06 22:23:00,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2023-11-06 22:23:00,328 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -16 predicate places. [2023-11-06 22:23:00,328 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 104 flow [2023-11-06 22:23:00,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:00,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:00,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:23:00,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:23:00,329 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-06 22:23:00,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:00,330 INFO L85 PathProgramCache]: Analyzing trace with hash 22712, now seen corresponding path program 1 times [2023-11-06 22:23:00,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:00,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691801535] [2023-11-06 22:23:00,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:00,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:00,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:00,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:00,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691801535] [2023-11-06 22:23:00,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691801535] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:00,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:00,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:23:00,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349307872] [2023-11-06 22:23:00,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:00,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:23:00,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:00,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:23:00,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:23:00,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 419 [2023-11-06 22:23:00,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:00,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:00,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 419 [2023-11-06 22:23:00,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:00,864 INFO L124 PetriNetUnfolderBase]: 193/442 cut-off events. [2023-11-06 22:23:00,864 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-06 22:23:00,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 442 events. 193/442 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2030 event pairs, 192 based on Foata normal form. 1/279 useless extension candidates. Maximal degree in co-relation 885. Up to 420 conditions per place. [2023-11-06 22:23:00,869 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 34 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-06 22:23:00,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 41 transitions, 176 flow [2023-11-06 22:23:00,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:23:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:23:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions. [2023-11-06 22:23:00,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4447096260938743 [2023-11-06 22:23:00,872 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 559 transitions. [2023-11-06 22:23:00,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 559 transitions. [2023-11-06 22:23:00,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:00,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 559 transitions. [2023-11-06 22:23:00,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:00,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:00,881 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:00,881 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 104 flow. Second operand 3 states and 559 transitions. [2023-11-06 22:23:00,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 41 transitions, 176 flow [2023-11-06 22:23:00,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 41 transitions, 170 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:23:00,884 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 106 flow [2023-11-06 22:23:00,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2023-11-06 22:23:00,886 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -15 predicate places. [2023-11-06 22:23:00,886 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 106 flow [2023-11-06 22:23:00,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:00,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:00,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:23:00,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:23:00,888 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-06 22:23:00,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:00,888 INFO L85 PathProgramCache]: Analyzing trace with hash 705270, now seen corresponding path program 1 times [2023-11-06 22:23:00,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:00,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804395626] [2023-11-06 22:23:00,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:00,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:01,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:01,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:01,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804395626] [2023-11-06 22:23:01,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804395626] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:23:01,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894521639] [2023-11-06 22:23:01,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:01,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:23:01,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:23:01,644 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:23:01,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:23:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:01,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-06 22:23:01,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:23:01,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:23:01,904 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 22:23:01,930 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:23:01,930 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-06 22:23:02,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:23:02,032 INFO L322 Elim1Store]: treesize reduction 42, result has 25.0 percent of original size [2023-11-06 22:23:02,033 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 41 [2023-11-06 22:23:02,042 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 9 [2023-11-06 22:23:02,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:23:02,064 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 22:23:02,080 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:23:02,080 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 16 [2023-11-06 22:23:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:02,103 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:23:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:02,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894521639] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:23:02,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:23:02,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2023-11-06 22:23:02,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267668415] [2023-11-06 22:23:02,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:23:02,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:23:02,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:02,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:23:02,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:23:04,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 419 [2023-11-06 22:23:04,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 106 flow. Second operand has 8 states, 8 states have (on average 163.125) internal successors, (1305), 8 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:04,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:04,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 419 [2023-11-06 22:23:04,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:06,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:23:08,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:23:10,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:23:10,664 INFO L124 PetriNetUnfolderBase]: 202/457 cut-off events. [2023-11-06 22:23:10,664 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 22:23:10,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 457 events. 202/457 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2078 event pairs, 195 based on Foata normal form. 3/289 useless extension candidates. Maximal degree in co-relation 926. Up to 433 conditions per place. [2023-11-06 22:23:10,669 INFO L140 encePairwiseOnDemand]: 413/419 looper letters, 35 selfloop transitions, 11 changer transitions 0/50 dead transitions. [2023-11-06 22:23:10,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 234 flow [2023-11-06 22:23:10,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:23:10,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:23:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1024 transitions. [2023-11-06 22:23:10,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40731901352426414 [2023-11-06 22:23:10,674 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1024 transitions. [2023-11-06 22:23:10,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1024 transitions. [2023-11-06 22:23:10,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:10,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1024 transitions. [2023-11-06 22:23:10,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 170.66666666666666) internal successors, (1024), 6 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:10,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 419.0) internal successors, (2933), 7 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:10,689 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 419.0) internal successors, (2933), 7 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:10,689 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 106 flow. Second operand 6 states and 1024 transitions. [2023-11-06 22:23:10,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 234 flow [2023-11-06 22:23:10,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:23:10,692 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 186 flow [2023-11-06 22:23:10,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2023-11-06 22:23:10,693 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -9 predicate places. [2023-11-06 22:23:10,693 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 186 flow [2023-11-06 22:23:10,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 163.125) internal successors, (1305), 8 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:10,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:10,695 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1] [2023-11-06 22:23:10,707 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:23:10,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:23:10,903 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-06 22:23:10,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:10,903 INFO L85 PathProgramCache]: Analyzing trace with hash 677802760, now seen corresponding path program 1 times [2023-11-06 22:23:10,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:10,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541254334] [2023-11-06 22:23:10,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:10,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:11,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:11,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541254334] [2023-11-06 22:23:11,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541254334] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:23:11,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005751128] [2023-11-06 22:23:11,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:11,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:23:11,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:23:11,161 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:23:11,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:23:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:23:11,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:23:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:11,460 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:23:11,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:11,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005751128] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:23:11,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:23:11,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2023-11-06 22:23:11,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734752747] [2023-11-06 22:23:11,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:23:11,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:23:11,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:11,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:23:11,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:23:11,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 419 [2023-11-06 22:23:11,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 186 flow. Second operand has 11 states, 11 states have (on average 179.0909090909091) internal successors, (1970), 11 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:11,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:11,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 419 [2023-11-06 22:23:11,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:12,239 INFO L124 PetriNetUnfolderBase]: 194/453 cut-off events. [2023-11-06 22:23:12,239 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-11-06 22:23:12,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 453 events. 194/453 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2038 event pairs, 192 based on Foata normal form. 1/290 useless extension candidates. Maximal degree in co-relation 915. Up to 419 conditions per place. [2023-11-06 22:23:12,245 INFO L140 encePairwiseOnDemand]: 413/419 looper letters, 37 selfloop transitions, 10 changer transitions 0/52 dead transitions. [2023-11-06 22:23:12,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 52 transitions, 302 flow [2023-11-06 22:23:12,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:23:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 22:23:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1845 transitions. [2023-11-06 22:23:12,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4403341288782816 [2023-11-06 22:23:12,255 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1845 transitions. [2023-11-06 22:23:12,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1845 transitions. [2023-11-06 22:23:12,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:12,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1845 transitions. [2023-11-06 22:23:12,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 184.5) internal successors, (1845), 10 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:12,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 419.0) internal successors, (4609), 11 states have internal predecessors, (4609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:12,278 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 419.0) internal successors, (4609), 11 states have internal predecessors, (4609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:12,278 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 186 flow. Second operand 10 states and 1845 transitions. [2023-11-06 22:23:12,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 52 transitions, 302 flow [2023-11-06 22:23:12,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 52 transitions, 270 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-11-06 22:23:12,285 INFO L231 Difference]: Finished difference. Result has 66 places, 49 transitions, 206 flow [2023-11-06 22:23:12,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=206, PETRI_PLACES=66, PETRI_TRANSITIONS=49} [2023-11-06 22:23:12,289 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 3 predicate places. [2023-11-06 22:23:12,289 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 49 transitions, 206 flow [2023-11-06 22:23:12,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 179.0909090909091) internal successors, (1970), 11 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:12,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:12,291 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1] [2023-11-06 22:23:12,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:23:12,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:23:12,497 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-06 22:23:12,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:12,498 INFO L85 PathProgramCache]: Analyzing trace with hash -462948296, now seen corresponding path program 2 times [2023-11-06 22:23:12,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:12,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419151654] [2023-11-06 22:23:12,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:12,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:14,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:14,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419151654] [2023-11-06 22:23:14,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419151654] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:23:14,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557650229] [2023-11-06 22:23:14,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:23:14,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:23:14,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:23:14,335 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:23:14,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:23:14,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:23:14,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:23:14,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-06 22:23:14,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:23:14,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:23:14,710 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 22:23:14,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:23:14,789 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:23:14,792 INFO L351 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 1 case distinctions, treesize of input 19 treesize of output 13 [2023-11-06 22:23:14,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:23:14,812 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:23:14,813 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2023-11-06 22:23:14,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:23:14,850 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 22:23:14,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:23:14,907 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2023-11-06 22:23:14,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:23:14,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:23:14,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:23:14,938 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 22:23:14,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:23:15,001 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2023-11-06 22:23:15,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:23:15,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:23:15,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:23:15,025 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 22:23:15,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:23:15,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:23:15,106 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2023-11-06 22:23:15,123 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 22:23:15,125 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:23:15,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:23:15,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:23:15,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:23:15,157 INFO L322 Elim1Store]: treesize reduction 29, result has 3.3 percent of original size [2023-11-06 22:23:15,158 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 1 [2023-11-06 22:23:15,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:15,183 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:23:15,371 INFO L322 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2023-11-06 22:23:15,371 INFO L351 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 225 treesize of output 258 [2023-11-06 22:23:18,743 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-06 22:23:18,744 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2023-11-06 22:23:22,897 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-06 22:23:22,898 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2023-11-06 22:23:26,070 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse9 (* 4 |c_ULTIMATE.start_main_~k~0#1|))) (let ((.cse1 (< 0 (+ |c_~#slot~0.offset| 13 .cse9))) (.cse3 (+ |c_~#slot~0.offset| 15 .cse9)) (.cse0 (+ |c_~#slot~0.offset| 12 .cse9))) (and (or (forall ((v_ArrVal_863 Int) (v_ArrVal_862 Int) (|v_ULTIMATE.start_new_#res#1.base_131| Int) (v_ArrVal_871 Int) (|v_ULTIMATE.start_new_#res#1.base_130| Int) (|v_ULTIMATE.start_new_~p~0#1.base_274| Int) (|v_ULTIMATE.start_new_~p~0#1.base_273| Int) (|v_ULTIMATE.start_new_~p~0#1.base_272| Int) (v_ArrVal_866 Int) (v_ArrVal_865 Int)) (or (< 8 v_ArrVal_871) (< 8 v_ArrVal_862) (< 8 v_ArrVal_865) (= |v_ULTIMATE.start_new_#res#1.base_130| |c_~#slot~0.base|) (= |v_ULTIMATE.start_new_#res#1.base_131| |c_~#slot~0.base|) (< (select (store (store (store (store (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_272| v_ArrVal_862) |v_ULTIMATE.start_new_#res#1.base_131| v_ArrVal_863) |v_ULTIMATE.start_new_~p~0#1.base_273| v_ArrVal_865) |v_ULTIMATE.start_new_#res#1.base_130| v_ArrVal_866) |v_ULTIMATE.start_new_~p~0#1.base_274| v_ArrVal_871) |c_~#slot~0.base|) .cse0))) .cse1) (forall ((|v_ULTIMATE.start_new_#res#1.base_131| Int)) (or (forall ((v_ArrVal_862 Int)) (or (forall ((v_ArrVal_863 Int) (|v_ULTIMATE.start_new_~p~0#1.base_272| Int) (v_ArrVal_865 Int)) (or (forall ((|v_ULTIMATE.start_new_#res#1.base_130| Int)) (or (forall ((v_ArrVal_871 Int) (|v_ULTIMATE.start_new_~p~0#1.base_273| Int) (v_ArrVal_866 Int)) (or (forall ((|v_ULTIMATE.start_new_#res#1.base_129| Int)) (let ((.cse2 (store (store (store (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_272| v_ArrVal_862) |v_ULTIMATE.start_new_#res#1.base_131| v_ArrVal_863) |v_ULTIMATE.start_new_~p~0#1.base_273| v_ArrVal_865) |v_ULTIMATE.start_new_#res#1.base_130| v_ArrVal_866))) (or (< (select (store .cse2 |v_ULTIMATE.start_new_#res#1.base_129| v_ArrVal_871) |c_~#slot~0.base|) .cse0) (= |v_ULTIMATE.start_new_#res#1.base_129| |c_~#slot~0.base|) (forall ((v_ArrVal_872 Int)) (< .cse3 (select (store .cse2 |v_ULTIMATE.start_new_#res#1.base_129| v_ArrVal_872) |c_~#slot~0.base|)))))) (< 8 v_ArrVal_871))) (= |v_ULTIMATE.start_new_#res#1.base_130| |c_~#slot~0.base|))) (< 8 v_ArrVal_865))) (< 8 v_ArrVal_862))) (= |v_ULTIMATE.start_new_#res#1.base_131| |c_~#slot~0.base|))) (forall ((|v_ULTIMATE.start_new_#res#1.base_131| Int)) (or (forall ((v_ArrVal_862 Int)) (or (< 8 v_ArrVal_862) (forall ((v_ArrVal_863 Int) (|v_ULTIMATE.start_new_~p~0#1.base_272| Int) (v_ArrVal_865 Int)) (or (forall ((|v_ULTIMATE.start_new_#res#1.base_130| Int)) (or (forall ((v_ArrVal_871 Int) (|v_ULTIMATE.start_new_~p~0#1.base_273| Int) (v_ArrVal_866 Int)) (or (< 8 v_ArrVal_871) (forall ((|v_ULTIMATE.start_new_#res#1.base_129| Int)) (let ((.cse4 (store (store (store (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_272| v_ArrVal_862) |v_ULTIMATE.start_new_#res#1.base_131| v_ArrVal_863) |v_ULTIMATE.start_new_~p~0#1.base_273| v_ArrVal_865) |v_ULTIMATE.start_new_#res#1.base_130| v_ArrVal_866))) (or (forall ((v_prenex_1 Int)) (or (= |c_~#slot~0.base| v_prenex_1) (forall ((v_ArrVal_872 Int) (v_ArrVal_870 Int)) (< .cse3 (select (store (store .cse4 |v_ULTIMATE.start_new_#res#1.base_129| v_ArrVal_870) v_prenex_1 v_ArrVal_872) |c_~#slot~0.base|))))) (< (select (store .cse4 |v_ULTIMATE.start_new_#res#1.base_129| v_ArrVal_871) |c_~#slot~0.base|) .cse0) (= |v_ULTIMATE.start_new_#res#1.base_129| |c_~#slot~0.base|)))))) (= |v_ULTIMATE.start_new_#res#1.base_130| |c_~#slot~0.base|))) (< 8 v_ArrVal_865))))) (= |v_ULTIMATE.start_new_#res#1.base_131| |c_~#slot~0.base|))) (forall ((|v_ULTIMATE.start_new_#res#1.base_131| Int)) (or (forall ((v_ArrVal_862 Int)) (or (< 8 v_ArrVal_862) (forall ((v_ArrVal_863 Int) (|v_ULTIMATE.start_new_~p~0#1.base_272| Int) (v_ArrVal_865 Int)) (or (forall ((|v_ULTIMATE.start_new_#res#1.base_130| Int)) (or (forall ((|v_ULTIMATE.start_new_#res#1.base_129| Int) (|v_ULTIMATE.start_new_~p~0#1.base_273| Int) (v_ArrVal_866 Int)) (or (= |v_ULTIMATE.start_new_#res#1.base_129| |c_~#slot~0.base|) (forall ((v_ArrVal_871 Int)) (or (< v_ArrVal_871 .cse0) (< 8 v_ArrVal_871) (forall ((v_ArrVal_872 Int) (v_ArrVal_870 Int) (v_prenex_1 Int)) (or (= |c_~#slot~0.base| v_prenex_1) (< .cse3 (select (store (store (store (store (store (store (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_272| v_ArrVal_862) |v_ULTIMATE.start_new_#res#1.base_131| v_ArrVal_863) |v_ULTIMATE.start_new_~p~0#1.base_273| v_ArrVal_865) |v_ULTIMATE.start_new_#res#1.base_130| v_ArrVal_866) |c_~#slot~0.base| v_ArrVal_871) |v_ULTIMATE.start_new_#res#1.base_129| v_ArrVal_870) v_prenex_1 v_ArrVal_872) |c_~#slot~0.base|)))))))) (= |v_ULTIMATE.start_new_#res#1.base_130| |c_~#slot~0.base|))) (< 8 v_ArrVal_865))))) (= |v_ULTIMATE.start_new_#res#1.base_131| |c_~#slot~0.base|))) (forall ((|v_ULTIMATE.start_new_#res#1.base_131| Int)) (or (forall ((v_ArrVal_862 Int)) (or (forall ((v_ArrVal_863 Int) (|v_ULTIMATE.start_new_~p~0#1.base_272| Int) (v_ArrVal_865 Int)) (or (forall ((|v_ULTIMATE.start_new_#res#1.base_130| Int)) (or (forall ((|v_ULTIMATE.start_new_#res#1.base_129| Int) (|v_ULTIMATE.start_new_~p~0#1.base_273| Int) (v_ArrVal_866 Int)) (or (= |v_ULTIMATE.start_new_#res#1.base_129| |c_~#slot~0.base|) (forall ((v_ArrVal_871 Int)) (or (< 8 v_ArrVal_871) (forall ((|v_ULTIMATE.start_new_~p~0#1.base_274| Int)) (let ((.cse5 (store (store (store (store (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_272| v_ArrVal_862) |v_ULTIMATE.start_new_#res#1.base_131| v_ArrVal_863) |v_ULTIMATE.start_new_~p~0#1.base_273| v_ArrVal_865) |v_ULTIMATE.start_new_#res#1.base_130| v_ArrVal_866) |v_ULTIMATE.start_new_~p~0#1.base_274| v_ArrVal_871))) (or (= |v_ULTIMATE.start_new_#res#1.base_129| |v_ULTIMATE.start_new_~p~0#1.base_274|) (forall ((v_ArrVal_872 Int) (v_ArrVal_870 Int) (v_prenex_1 Int)) (or (= |c_~#slot~0.base| v_prenex_1) (< .cse3 (select (store (store .cse5 |v_ULTIMATE.start_new_#res#1.base_129| v_ArrVal_870) v_prenex_1 v_ArrVal_872) |c_~#slot~0.base|)) (= |v_ULTIMATE.start_new_~p~0#1.base_274| v_prenex_1))) (< (select .cse5 |c_~#slot~0.base|) .cse0)))))))) (= |v_ULTIMATE.start_new_#res#1.base_130| |c_~#slot~0.base|))) (< 8 v_ArrVal_865))) (< 8 v_ArrVal_862))) (= |v_ULTIMATE.start_new_#res#1.base_131| |c_~#slot~0.base|))) (or .cse1 (forall ((v_ArrVal_863 Int) (v_ArrVal_862 Int) (v_ArrVal_871 Int) (|v_ULTIMATE.start_new_#res#1.base_131| Int) (|v_ULTIMATE.start_new_#res#1.base_130| Int) (|v_ULTIMATE.start_new_#res#1.base_129| Int) (|v_ULTIMATE.start_new_~p~0#1.base_273| Int) (|v_ULTIMATE.start_new_~p~0#1.base_272| Int) (v_ArrVal_866 Int) (v_ArrVal_865 Int)) (or (< 8 v_ArrVal_871) (< (select (store (store (store (store (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_272| v_ArrVal_862) |v_ULTIMATE.start_new_#res#1.base_131| v_ArrVal_863) |v_ULTIMATE.start_new_~p~0#1.base_273| v_ArrVal_865) |v_ULTIMATE.start_new_#res#1.base_130| v_ArrVal_866) |v_ULTIMATE.start_new_#res#1.base_129| v_ArrVal_871) |c_~#slot~0.base|) .cse0) (= |v_ULTIMATE.start_new_#res#1.base_129| |c_~#slot~0.base|) (< 8 v_ArrVal_862) (< 8 v_ArrVal_865) (= |v_ULTIMATE.start_new_#res#1.base_130| |c_~#slot~0.base|) (= |v_ULTIMATE.start_new_#res#1.base_131| |c_~#slot~0.base|)))) (forall ((|v_ULTIMATE.start_new_#res#1.base_131| Int)) (or (forall ((v_ArrVal_862 Int)) (or (< 8 v_ArrVal_862) (forall ((v_ArrVal_863 Int) (|v_ULTIMATE.start_new_~p~0#1.base_272| Int) (v_ArrVal_865 Int)) (or (< 8 v_ArrVal_865) (forall ((|v_ULTIMATE.start_new_#res#1.base_130| Int)) (or (forall ((v_ArrVal_871 Int) (|v_ULTIMATE.start_new_~p~0#1.base_273| Int) (v_ArrVal_866 Int)) (or (< 8 v_ArrVal_871) (forall ((|v_ULTIMATE.start_new_#res#1.base_129| Int)) (let ((.cse6 (store (store (store (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_272| v_ArrVal_862) |v_ULTIMATE.start_new_#res#1.base_131| v_ArrVal_863) |v_ULTIMATE.start_new_~p~0#1.base_273| v_ArrVal_865) |v_ULTIMATE.start_new_#res#1.base_130| v_ArrVal_866))) (or (< (select (store .cse6 |v_ULTIMATE.start_new_#res#1.base_129| v_ArrVal_871) |c_~#slot~0.base|) .cse0) (= |v_ULTIMATE.start_new_#res#1.base_129| |c_~#slot~0.base|) (forall ((v_ArrVal_872 Int) (v_ArrVal_870 Int) (v_prenex_1 Int)) (or (= |c_~#slot~0.base| v_prenex_1) (< .cse3 (select (store (store .cse6 |v_ULTIMATE.start_new_#res#1.base_129| v_ArrVal_870) v_prenex_1 v_ArrVal_872) |c_~#slot~0.base|))))))))) (= |v_ULTIMATE.start_new_#res#1.base_130| |c_~#slot~0.base|))))))) (= |v_ULTIMATE.start_new_#res#1.base_131| |c_~#slot~0.base|))) (forall ((|v_ULTIMATE.start_new_#res#1.base_131| Int)) (or (forall ((v_ArrVal_862 Int)) (or (< 8 v_ArrVal_862) (forall ((v_ArrVal_863 Int) (|v_ULTIMATE.start_new_~p~0#1.base_272| Int) (v_ArrVal_865 Int)) (or (forall ((|v_ULTIMATE.start_new_#res#1.base_130| Int)) (or (= |v_ULTIMATE.start_new_#res#1.base_130| |c_~#slot~0.base|) (forall ((|v_ULTIMATE.start_new_#res#1.base_129| Int) (|v_ULTIMATE.start_new_~p~0#1.base_273| Int) (v_ArrVal_866 Int)) (or (forall ((v_ArrVal_871 Int)) (or (< 8 v_ArrVal_871) (forall ((|v_ULTIMATE.start_new_~p~0#1.base_274| Int)) (let ((.cse7 (store (store (store (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_272| v_ArrVal_862) |v_ULTIMATE.start_new_#res#1.base_131| v_ArrVal_863) |v_ULTIMATE.start_new_~p~0#1.base_273| v_ArrVal_865) |v_ULTIMATE.start_new_#res#1.base_130| v_ArrVal_866))) (or (= |v_ULTIMATE.start_new_#res#1.base_129| |v_ULTIMATE.start_new_~p~0#1.base_274|) (= |c_~#slot~0.base| |v_ULTIMATE.start_new_~p~0#1.base_274|) (forall ((v_ArrVal_872 Int) (v_ArrVal_870 Int)) (< .cse3 (select (store (store .cse7 |v_ULTIMATE.start_new_#res#1.base_129| v_ArrVal_870) |v_ULTIMATE.start_new_~p~0#1.base_274| v_ArrVal_872) |c_~#slot~0.base|))) (< (select (store .cse7 |v_ULTIMATE.start_new_~p~0#1.base_274| v_ArrVal_871) |c_~#slot~0.base|) .cse0)))))) (= |v_ULTIMATE.start_new_#res#1.base_129| |c_~#slot~0.base|))))) (< 8 v_ArrVal_865))))) (= |v_ULTIMATE.start_new_#res#1.base_131| |c_~#slot~0.base|))) (forall ((|v_ULTIMATE.start_new_#res#1.base_131| Int)) (or (forall ((v_ArrVal_862 Int)) (or (forall ((v_ArrVal_863 Int) (|v_ULTIMATE.start_new_~p~0#1.base_272| Int) (v_ArrVal_865 Int)) (or (forall ((|v_ULTIMATE.start_new_#res#1.base_130| Int)) (or (= |v_ULTIMATE.start_new_#res#1.base_130| |c_~#slot~0.base|) (forall ((|v_ULTIMATE.start_new_#res#1.base_129| Int) (|v_ULTIMATE.start_new_~p~0#1.base_273| Int) (v_ArrVal_866 Int)) (or (forall ((v_ArrVal_871 Int)) (or (< 8 v_ArrVal_871) (forall ((|v_ULTIMATE.start_new_~p~0#1.base_274| Int)) (let ((.cse8 (store (store (store (store (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_272| v_ArrVal_862) |v_ULTIMATE.start_new_#res#1.base_131| v_ArrVal_863) |v_ULTIMATE.start_new_~p~0#1.base_273| v_ArrVal_865) |v_ULTIMATE.start_new_#res#1.base_130| v_ArrVal_866) |v_ULTIMATE.start_new_~p~0#1.base_274| v_ArrVal_871))) (or (= |v_ULTIMATE.start_new_#res#1.base_129| |v_ULTIMATE.start_new_~p~0#1.base_274|) (forall ((v_ArrVal_872 Int) (v_ArrVal_870 Int) (v_prenex_1 Int)) (or (= |c_~#slot~0.base| v_prenex_1) (< .cse3 (select (store (store .cse8 |v_ULTIMATE.start_new_#res#1.base_129| v_ArrVal_870) v_prenex_1 v_ArrVal_872) |c_~#slot~0.base|)))) (< (select .cse8 |c_~#slot~0.base|) .cse0)))))) (= |v_ULTIMATE.start_new_#res#1.base_129| |c_~#slot~0.base|))))) (< 8 v_ArrVal_865))) (< 8 v_ArrVal_862))) (= |v_ULTIMATE.start_new_#res#1.base_131| |c_~#slot~0.base|)))))) is different from false [2023-11-06 22:23:26,838 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-06 22:23:26,838 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2023-11-06 22:23:30,480 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse9 (* 4 |c_ULTIMATE.start_main_~k~0#1|))) (let ((.cse3 (< 0 (+ |c_~#slot~0.offset| 17 .cse9))) (.cse1 (+ |c_~#slot~0.offset| 16 .cse9)) (.cse2 (+ 19 |c_~#slot~0.offset| .cse9))) (and (forall ((v_ArrVal_860 Int)) (or (< 8 v_ArrVal_860) (forall ((|v_ULTIMATE.start_new_#res#1.base_132| Int)) (or (= |v_ULTIMATE.start_new_#res#1.base_132| |c_~#slot~0.base|) (forall ((|v_ULTIMATE.start_new_#res#1.base_131| Int) (v_ArrVal_859 Int) (|v_ULTIMATE.start_new_~p~0#1.base_271| Int)) (or (forall ((v_ArrVal_862 Int)) (or (< 8 v_ArrVal_862) (forall ((v_ArrVal_863 Int) (|v_ULTIMATE.start_new_~p~0#1.base_272| Int) (v_ArrVal_865 Int)) (or (forall ((|v_ULTIMATE.start_new_#res#1.base_130| Int)) (or (forall ((v_ArrVal_871 Int) (|v_ULTIMATE.start_new_~p~0#1.base_273| Int) (v_ArrVal_866 Int)) (or (< 8 v_ArrVal_871) (forall ((|v_ULTIMATE.start_new_#res#1.base_129| Int)) (let ((.cse0 (store (store (store (store (store (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_271| v_ArrVal_860) |v_ULTIMATE.start_new_#res#1.base_132| v_ArrVal_859) |v_ULTIMATE.start_new_~p~0#1.base_272| v_ArrVal_862) |v_ULTIMATE.start_new_#res#1.base_131| v_ArrVal_863) |v_ULTIMATE.start_new_~p~0#1.base_273| v_ArrVal_865) |v_ULTIMATE.start_new_#res#1.base_130| v_ArrVal_866))) (or (= |v_ULTIMATE.start_new_#res#1.base_129| |c_~#slot~0.base|) (< (select (store .cse0 |v_ULTIMATE.start_new_#res#1.base_129| v_ArrVal_871) |c_~#slot~0.base|) .cse1) (forall ((v_ArrVal_872 Int) (v_ArrVal_870 Int) (v_prenex_1 Int)) (or (= |c_~#slot~0.base| v_prenex_1) (< .cse2 (select (store (store .cse0 |v_ULTIMATE.start_new_#res#1.base_129| v_ArrVal_870) v_prenex_1 v_ArrVal_872) |c_~#slot~0.base|))))))))) (= |v_ULTIMATE.start_new_#res#1.base_130| |c_~#slot~0.base|))) (< 8 v_ArrVal_865))))) (= |v_ULTIMATE.start_new_#res#1.base_131| |c_~#slot~0.base|))))))) (or (forall ((|v_ULTIMATE.start_new_#res#1.base_132| Int) (|v_ULTIMATE.start_new_#res#1.base_131| Int) (|v_ULTIMATE.start_new_#res#1.base_130| Int) (v_ArrVal_859 Int) (|v_ULTIMATE.start_new_~p~0#1.base_274| Int) (|v_ULTIMATE.start_new_~p~0#1.base_273| Int) (|v_ULTIMATE.start_new_~p~0#1.base_272| Int) (|v_ULTIMATE.start_new_~p~0#1.base_271| Int) (v_ArrVal_866 Int) (v_ArrVal_865 Int) (v_ArrVal_863 Int) (v_ArrVal_862 Int) (v_ArrVal_860 Int) (v_ArrVal_871 Int)) (or (< 8 v_ArrVal_871) (< 8 v_ArrVal_860) (< (select (store (store (store (store (store (store (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_271| v_ArrVal_860) |v_ULTIMATE.start_new_#res#1.base_132| v_ArrVal_859) |v_ULTIMATE.start_new_~p~0#1.base_272| v_ArrVal_862) |v_ULTIMATE.start_new_#res#1.base_131| v_ArrVal_863) |v_ULTIMATE.start_new_~p~0#1.base_273| v_ArrVal_865) |v_ULTIMATE.start_new_#res#1.base_130| v_ArrVal_866) |v_ULTIMATE.start_new_~p~0#1.base_274| v_ArrVal_871) |c_~#slot~0.base|) .cse1) (= |v_ULTIMATE.start_new_#res#1.base_132| |c_~#slot~0.base|) (< 8 v_ArrVal_862) (< 8 v_ArrVal_865) (= |v_ULTIMATE.start_new_#res#1.base_130| |c_~#slot~0.base|) (= |v_ULTIMATE.start_new_#res#1.base_131| |c_~#slot~0.base|))) .cse3) (forall ((v_ArrVal_860 Int)) (or (forall ((|v_ULTIMATE.start_new_#res#1.base_132| Int)) (or (forall ((|v_ULTIMATE.start_new_#res#1.base_131| Int) (v_ArrVal_859 Int) (|v_ULTIMATE.start_new_~p~0#1.base_271| Int)) (or (forall ((v_ArrVal_862 Int)) (or (< 8 v_ArrVal_862) (forall ((v_ArrVal_863 Int) (|v_ULTIMATE.start_new_~p~0#1.base_272| Int) (v_ArrVal_865 Int)) (or (< 8 v_ArrVal_865) (forall ((|v_ULTIMATE.start_new_#res#1.base_130| Int)) (or (forall ((v_ArrVal_871 Int) (|v_ULTIMATE.start_new_~p~0#1.base_273| Int) (v_ArrVal_866 Int)) (or (< 8 v_ArrVal_871) (forall ((|v_ULTIMATE.start_new_#res#1.base_129| Int)) (let ((.cse4 (store (store (store (store (store (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_271| v_ArrVal_860) |v_ULTIMATE.start_new_#res#1.base_132| v_ArrVal_859) |v_ULTIMATE.start_new_~p~0#1.base_272| v_ArrVal_862) |v_ULTIMATE.start_new_#res#1.base_131| v_ArrVal_863) |v_ULTIMATE.start_new_~p~0#1.base_273| v_ArrVal_865) |v_ULTIMATE.start_new_#res#1.base_130| v_ArrVal_866))) (or (forall ((v_prenex_1 Int)) (or (= |c_~#slot~0.base| v_prenex_1) (forall ((v_ArrVal_872 Int) (v_ArrVal_870 Int)) (< .cse2 (select (store (store .cse4 |v_ULTIMATE.start_new_#res#1.base_129| v_ArrVal_870) v_prenex_1 v_ArrVal_872) |c_~#slot~0.base|))))) (= |v_ULTIMATE.start_new_#res#1.base_129| |c_~#slot~0.base|) (< (select (store .cse4 |v_ULTIMATE.start_new_#res#1.base_129| v_ArrVal_871) |c_~#slot~0.base|) .cse1)))))) (= |v_ULTIMATE.start_new_#res#1.base_130| |c_~#slot~0.base|))))))) (= |v_ULTIMATE.start_new_#res#1.base_131| |c_~#slot~0.base|))) (= |v_ULTIMATE.start_new_#res#1.base_132| |c_~#slot~0.base|))) (< 8 v_ArrVal_860))) (forall ((v_ArrVal_860 Int)) (or (< 8 v_ArrVal_860) (forall ((|v_ULTIMATE.start_new_#res#1.base_132| Int)) (or (= |v_ULTIMATE.start_new_#res#1.base_132| |c_~#slot~0.base|) (forall ((|v_ULTIMATE.start_new_#res#1.base_131| Int) (v_ArrVal_859 Int) (|v_ULTIMATE.start_new_~p~0#1.base_271| Int)) (or (forall ((v_ArrVal_862 Int)) (or (< 8 v_ArrVal_862) (forall ((v_ArrVal_863 Int) (|v_ULTIMATE.start_new_~p~0#1.base_272| Int) (v_ArrVal_865 Int)) (or (forall ((|v_ULTIMATE.start_new_#res#1.base_130| Int)) (or (= |v_ULTIMATE.start_new_#res#1.base_130| |c_~#slot~0.base|) (forall ((|v_ULTIMATE.start_new_#res#1.base_129| Int) (|v_ULTIMATE.start_new_~p~0#1.base_273| Int) (v_ArrVal_866 Int)) (or (= |v_ULTIMATE.start_new_#res#1.base_129| |c_~#slot~0.base|) (forall ((v_ArrVal_871 Int)) (or (< 8 v_ArrVal_871) (forall ((|v_ULTIMATE.start_new_~p~0#1.base_274| Int)) (let ((.cse5 (store (store (store (store (store (store (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_271| v_ArrVal_860) |v_ULTIMATE.start_new_#res#1.base_132| v_ArrVal_859) |v_ULTIMATE.start_new_~p~0#1.base_272| v_ArrVal_862) |v_ULTIMATE.start_new_#res#1.base_131| v_ArrVal_863) |v_ULTIMATE.start_new_~p~0#1.base_273| v_ArrVal_865) |v_ULTIMATE.start_new_#res#1.base_130| v_ArrVal_866) |v_ULTIMATE.start_new_~p~0#1.base_274| v_ArrVal_871))) (or (= |v_ULTIMATE.start_new_#res#1.base_129| |v_ULTIMATE.start_new_~p~0#1.base_274|) (< (select .cse5 |c_~#slot~0.base|) .cse1) (forall ((v_ArrVal_872 Int) (v_ArrVal_870 Int) (v_prenex_1 Int)) (or (= |c_~#slot~0.base| v_prenex_1) (< .cse2 (select (store (store .cse5 |v_ULTIMATE.start_new_#res#1.base_129| v_ArrVal_870) v_prenex_1 v_ArrVal_872) |c_~#slot~0.base|)) (= |v_ULTIMATE.start_new_~p~0#1.base_274| v_prenex_1)))))))))))) (< 8 v_ArrVal_865))))) (= |v_ULTIMATE.start_new_#res#1.base_131| |c_~#slot~0.base|))))))) (forall ((v_ArrVal_860 Int)) (or (< 8 v_ArrVal_860) (forall ((|v_ULTIMATE.start_new_#res#1.base_132| Int)) (or (= |v_ULTIMATE.start_new_#res#1.base_132| |c_~#slot~0.base|) (forall ((|v_ULTIMATE.start_new_#res#1.base_131| Int) (v_ArrVal_859 Int) (|v_ULTIMATE.start_new_~p~0#1.base_271| Int)) (or (forall ((v_ArrVal_862 Int)) (or (forall ((v_ArrVal_863 Int) (|v_ULTIMATE.start_new_~p~0#1.base_272| Int) (v_ArrVal_865 Int)) (or (< 8 v_ArrVal_865) (forall ((|v_ULTIMATE.start_new_#res#1.base_130| Int)) (or (forall ((|v_ULTIMATE.start_new_#res#1.base_129| Int) (|v_ULTIMATE.start_new_~p~0#1.base_273| Int) (v_ArrVal_866 Int)) (or (= |v_ULTIMATE.start_new_#res#1.base_129| |c_~#slot~0.base|) (forall ((v_ArrVal_871 Int)) (or (< 8 v_ArrVal_871) (forall ((|v_ULTIMATE.start_new_~p~0#1.base_274| Int)) (let ((.cse6 (store (store (store (store (store (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_271| v_ArrVal_860) |v_ULTIMATE.start_new_#res#1.base_132| v_ArrVal_859) |v_ULTIMATE.start_new_~p~0#1.base_272| v_ArrVal_862) |v_ULTIMATE.start_new_#res#1.base_131| v_ArrVal_863) |v_ULTIMATE.start_new_~p~0#1.base_273| v_ArrVal_865) |v_ULTIMATE.start_new_#res#1.base_130| v_ArrVal_866))) (or (= |v_ULTIMATE.start_new_#res#1.base_129| |v_ULTIMATE.start_new_~p~0#1.base_274|) (< (select (store .cse6 |v_ULTIMATE.start_new_~p~0#1.base_274| v_ArrVal_871) |c_~#slot~0.base|) .cse1) (= |c_~#slot~0.base| |v_ULTIMATE.start_new_~p~0#1.base_274|) (forall ((v_ArrVal_872 Int) (v_ArrVal_870 Int)) (< .cse2 (select (store (store .cse6 |v_ULTIMATE.start_new_#res#1.base_129| v_ArrVal_870) |v_ULTIMATE.start_new_~p~0#1.base_274| v_ArrVal_872) |c_~#slot~0.base|)))))))))) (= |v_ULTIMATE.start_new_#res#1.base_130| |c_~#slot~0.base|))))) (< 8 v_ArrVal_862))) (= |v_ULTIMATE.start_new_#res#1.base_131| |c_~#slot~0.base|))))))) (or (forall ((|v_ULTIMATE.start_new_#res#1.base_132| Int) (|v_ULTIMATE.start_new_#res#1.base_131| Int) (|v_ULTIMATE.start_new_#res#1.base_130| Int) (v_ArrVal_859 Int) (|v_ULTIMATE.start_new_#res#1.base_129| Int) (|v_ULTIMATE.start_new_~p~0#1.base_273| Int) (|v_ULTIMATE.start_new_~p~0#1.base_272| Int) (|v_ULTIMATE.start_new_~p~0#1.base_271| Int) (v_ArrVal_866 Int) (v_ArrVal_865 Int) (v_ArrVal_863 Int) (v_ArrVal_862 Int) (v_ArrVal_860 Int) (v_ArrVal_871 Int)) (or (< 8 v_ArrVal_871) (< 8 v_ArrVal_860) (= |v_ULTIMATE.start_new_#res#1.base_132| |c_~#slot~0.base|) (= |v_ULTIMATE.start_new_#res#1.base_129| |c_~#slot~0.base|) (< (select (store (store (store (store (store (store (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_271| v_ArrVal_860) |v_ULTIMATE.start_new_#res#1.base_132| v_ArrVal_859) |v_ULTIMATE.start_new_~p~0#1.base_272| v_ArrVal_862) |v_ULTIMATE.start_new_#res#1.base_131| v_ArrVal_863) |v_ULTIMATE.start_new_~p~0#1.base_273| v_ArrVal_865) |v_ULTIMATE.start_new_#res#1.base_130| v_ArrVal_866) |v_ULTIMATE.start_new_#res#1.base_129| v_ArrVal_871) |c_~#slot~0.base|) .cse1) (< 8 v_ArrVal_862) (< 8 v_ArrVal_865) (= |v_ULTIMATE.start_new_#res#1.base_130| |c_~#slot~0.base|) (= |v_ULTIMATE.start_new_#res#1.base_131| |c_~#slot~0.base|))) .cse3) (forall ((v_ArrVal_860 Int)) (or (forall ((|v_ULTIMATE.start_new_#res#1.base_132| Int)) (or (= |v_ULTIMATE.start_new_#res#1.base_132| |c_~#slot~0.base|) (forall ((|v_ULTIMATE.start_new_#res#1.base_131| Int) (v_ArrVal_859 Int) (|v_ULTIMATE.start_new_~p~0#1.base_271| Int)) (or (forall ((v_ArrVal_862 Int)) (or (< 8 v_ArrVal_862) (forall ((v_ArrVal_863 Int) (|v_ULTIMATE.start_new_~p~0#1.base_272| Int) (v_ArrVal_865 Int)) (or (forall ((|v_ULTIMATE.start_new_#res#1.base_130| Int)) (or (forall ((|v_ULTIMATE.start_new_#res#1.base_129| Int) (|v_ULTIMATE.start_new_~p~0#1.base_273| Int) (v_ArrVal_866 Int)) (or (forall ((v_ArrVal_871 Int)) (or (< 8 v_ArrVal_871) (< v_ArrVal_871 .cse1) (forall ((v_ArrVal_872 Int) (v_ArrVal_870 Int) (v_prenex_1 Int)) (or (= |c_~#slot~0.base| v_prenex_1) (< .cse2 (select (store (store (store (store (store (store (store (store (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_271| v_ArrVal_860) |v_ULTIMATE.start_new_#res#1.base_132| v_ArrVal_859) |v_ULTIMATE.start_new_~p~0#1.base_272| v_ArrVal_862) |v_ULTIMATE.start_new_#res#1.base_131| v_ArrVal_863) |v_ULTIMATE.start_new_~p~0#1.base_273| v_ArrVal_865) |v_ULTIMATE.start_new_#res#1.base_130| v_ArrVal_866) |c_~#slot~0.base| v_ArrVal_871) |v_ULTIMATE.start_new_#res#1.base_129| v_ArrVal_870) v_prenex_1 v_ArrVal_872) |c_~#slot~0.base|)))))) (= |v_ULTIMATE.start_new_#res#1.base_129| |c_~#slot~0.base|))) (= |v_ULTIMATE.start_new_#res#1.base_130| |c_~#slot~0.base|))) (< 8 v_ArrVal_865))))) (= |v_ULTIMATE.start_new_#res#1.base_131| |c_~#slot~0.base|))))) (< 8 v_ArrVal_860))) (forall ((v_ArrVal_860 Int)) (or (< 8 v_ArrVal_860) (forall ((|v_ULTIMATE.start_new_#res#1.base_132| Int)) (or (= |v_ULTIMATE.start_new_#res#1.base_132| |c_~#slot~0.base|) (forall ((|v_ULTIMATE.start_new_#res#1.base_131| Int) (v_ArrVal_859 Int) (|v_ULTIMATE.start_new_~p~0#1.base_271| Int)) (or (forall ((v_ArrVal_862 Int)) (or (forall ((v_ArrVal_863 Int) (|v_ULTIMATE.start_new_~p~0#1.base_272| Int) (v_ArrVal_865 Int)) (or (< 8 v_ArrVal_865) (forall ((|v_ULTIMATE.start_new_#res#1.base_130| Int)) (or (forall ((v_ArrVal_871 Int) (|v_ULTIMATE.start_new_~p~0#1.base_273| Int) (v_ArrVal_866 Int)) (or (< 8 v_ArrVal_871) (forall ((|v_ULTIMATE.start_new_#res#1.base_129| Int)) (let ((.cse7 (store (store (store (store (store (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_271| v_ArrVal_860) |v_ULTIMATE.start_new_#res#1.base_132| v_ArrVal_859) |v_ULTIMATE.start_new_~p~0#1.base_272| v_ArrVal_862) |v_ULTIMATE.start_new_#res#1.base_131| v_ArrVal_863) |v_ULTIMATE.start_new_~p~0#1.base_273| v_ArrVal_865) |v_ULTIMATE.start_new_#res#1.base_130| v_ArrVal_866))) (or (= |v_ULTIMATE.start_new_#res#1.base_129| |c_~#slot~0.base|) (forall ((v_ArrVal_872 Int)) (< .cse2 (select (store .cse7 |v_ULTIMATE.start_new_#res#1.base_129| v_ArrVal_872) |c_~#slot~0.base|))) (< (select (store .cse7 |v_ULTIMATE.start_new_#res#1.base_129| v_ArrVal_871) |c_~#slot~0.base|) .cse1)))))) (= |v_ULTIMATE.start_new_#res#1.base_130| |c_~#slot~0.base|))))) (< 8 v_ArrVal_862))) (= |v_ULTIMATE.start_new_#res#1.base_131| |c_~#slot~0.base|))))))) (forall ((v_ArrVal_860 Int)) (or (< 8 v_ArrVal_860) (forall ((|v_ULTIMATE.start_new_#res#1.base_132| Int)) (or (= |v_ULTIMATE.start_new_#res#1.base_132| |c_~#slot~0.base|) (forall ((|v_ULTIMATE.start_new_#res#1.base_131| Int) (v_ArrVal_859 Int) (|v_ULTIMATE.start_new_~p~0#1.base_271| Int)) (or (forall ((v_ArrVal_862 Int)) (or (< 8 v_ArrVal_862) (forall ((v_ArrVal_863 Int) (|v_ULTIMATE.start_new_~p~0#1.base_272| Int) (v_ArrVal_865 Int)) (or (< 8 v_ArrVal_865) (forall ((|v_ULTIMATE.start_new_#res#1.base_130| Int)) (or (forall ((|v_ULTIMATE.start_new_#res#1.base_129| Int) (|v_ULTIMATE.start_new_~p~0#1.base_273| Int) (v_ArrVal_866 Int)) (or (forall ((v_ArrVal_871 Int)) (or (< 8 v_ArrVal_871) (forall ((|v_ULTIMATE.start_new_~p~0#1.base_274| Int)) (let ((.cse8 (store (store (store (store (store (store (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_271| v_ArrVal_860) |v_ULTIMATE.start_new_#res#1.base_132| v_ArrVal_859) |v_ULTIMATE.start_new_~p~0#1.base_272| v_ArrVal_862) |v_ULTIMATE.start_new_#res#1.base_131| v_ArrVal_863) |v_ULTIMATE.start_new_~p~0#1.base_273| v_ArrVal_865) |v_ULTIMATE.start_new_#res#1.base_130| v_ArrVal_866) |v_ULTIMATE.start_new_~p~0#1.base_274| v_ArrVal_871))) (or (= |v_ULTIMATE.start_new_#res#1.base_129| |v_ULTIMATE.start_new_~p~0#1.base_274|) (< (select .cse8 |c_~#slot~0.base|) .cse1) (forall ((v_ArrVal_872 Int) (v_ArrVal_870 Int) (v_prenex_1 Int)) (or (= |c_~#slot~0.base| v_prenex_1) (< .cse2 (select (store (store .cse8 |v_ULTIMATE.start_new_#res#1.base_129| v_ArrVal_870) v_prenex_1 v_ArrVal_872) |c_~#slot~0.base|))))))))) (= |v_ULTIMATE.start_new_#res#1.base_129| |c_~#slot~0.base|))) (= |v_ULTIMATE.start_new_#res#1.base_130| |c_~#slot~0.base|))))))) (= |v_ULTIMATE.start_new_#res#1.base_131| |c_~#slot~0.base|)))))))))) is different from false [2023-11-06 22:23:30,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-11-06 22:23:30,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557650229] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:23:30,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:23:30,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2023-11-06 22:23:30,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157329904] [2023-11-06 22:23:30,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:23:30,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-06 22:23:30,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:30,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 22:23:30,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=163, Unknown=2, NotChecked=54, Total=272 [2023-11-06 22:23:31,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 419 [2023-11-06 22:23:31,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 49 transitions, 206 flow. Second operand has 17 states, 17 states have (on average 107.05882352941177) internal successors, (1820), 17 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:31,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:31,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 419 [2023-11-06 22:23:31,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:42,028 INFO L124 PetriNetUnfolderBase]: 256/558 cut-off events. [2023-11-06 22:23:42,028 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2023-11-06 22:23:42,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 558 events. 256/558 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2567 event pairs, 255 based on Foata normal form. 4/310 useless extension candidates. Maximal degree in co-relation 1170. Up to 551 conditions per place. [2023-11-06 22:23:42,034 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 39 selfloop transitions, 9 changer transitions 0/48 dead transitions. [2023-11-06 22:23:42,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 48 transitions, 290 flow [2023-11-06 22:23:42,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:23:42,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 22:23:42,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1112 transitions. [2023-11-06 22:23:42,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26539379474940333 [2023-11-06 22:23:42,042 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1112 transitions. [2023-11-06 22:23:42,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1112 transitions. [2023-11-06 22:23:42,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:42,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1112 transitions. [2023-11-06 22:23:42,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 111.2) internal successors, (1112), 10 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:42,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 419.0) internal successors, (4609), 11 states have internal predecessors, (4609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:42,058 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 419.0) internal successors, (4609), 11 states have internal predecessors, (4609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:42,058 INFO L175 Difference]: Start difference. First operand has 66 places, 49 transitions, 206 flow. Second operand 10 states and 1112 transitions. [2023-11-06 22:23:42,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 48 transitions, 290 flow [2023-11-06 22:23:42,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 48 transitions, 249 flow, removed 11 selfloop flow, removed 9 redundant places. [2023-11-06 22:23:42,062 INFO L231 Difference]: Finished difference. Result has 66 places, 48 transitions, 171 flow [2023-11-06 22:23:42,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=171, PETRI_PLACES=66, PETRI_TRANSITIONS=48} [2023-11-06 22:23:42,064 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 3 predicate places. [2023-11-06 22:23:42,064 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 48 transitions, 171 flow [2023-11-06 22:23:42,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 107.05882352941177) internal successors, (1820), 17 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:42,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:42,065 INFO L208 CegarLoopForPetriNet]: trace histogram [8, 1, 1] [2023-11-06 22:23:42,078 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:23:42,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:23:42,273 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-06 22:23:42,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:42,274 INFO L85 PathProgramCache]: Analyzing trace with hash 83089336, now seen corresponding path program 3 times [2023-11-06 22:23:42,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:42,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753637706] [2023-11-06 22:23:42,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:42,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:47,673 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:47,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:47,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753637706] [2023-11-06 22:23:47,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753637706] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:23:47,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531877957] [2023-11-06 22:23:47,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:23:47,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:23:47,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:23:47,677 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:23:47,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_923cd6df-109b-4bb4-ad1c-617d0ac4bfc9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:24:18,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-06 22:24:18,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:24:18,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 126 conjunts are in the unsatisfiable core [2023-11-06 22:24:18,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:24:18,335 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:24:18,336 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-06 22:24:18,341 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 22:24:18,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:24:18,444 INFO L322 Elim1Store]: treesize reduction 42, result has 25.0 percent of original size [2023-11-06 22:24:18,445 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 41 [2023-11-06 22:24:18,457 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 19 [2023-11-06 22:24:18,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:24:18,484 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-11-06 22:24:18,505 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:24:18,505 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 16 [2023-11-06 22:24:18,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:24:18,688 INFO L322 Elim1Store]: treesize reduction 42, result has 25.0 percent of original size [2023-11-06 22:24:18,689 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 76 [2023-11-06 22:24:18,808 INFO L322 Elim1Store]: treesize reduction 99, result has 38.1 percent of original size [2023-11-06 22:24:18,808 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 44 treesize of output 93 [2023-11-06 22:24:19,288 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:24:19,289 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 54 [2023-11-06 22:24:19,383 INFO L322 Elim1Store]: treesize reduction 54, result has 49.1 percent of original size [2023-11-06 22:24:19,383 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 39 treesize of output 84 [2023-11-06 22:24:19,775 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:24:19,776 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 16 [2023-11-06 22:24:19,794 INFO L322 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-06 22:24:19,794 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 21 [2023-11-06 22:24:19,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:24:19,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:24:19,822 INFO L322 Elim1Store]: treesize reduction 47, result has 2.1 percent of original size [2023-11-06 22:24:19,822 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 24 treesize of output 12 [2023-11-06 22:24:19,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:24:19,872 INFO L322 Elim1Store]: treesize reduction 55, result has 1.8 percent of original size [2023-11-06 22:24:19,875 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 1 [2023-11-06 22:24:19,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:24:19,973 INFO L322 Elim1Store]: treesize reduction 42, result has 25.0 percent of original size [2023-11-06 22:24:19,974 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 41 [2023-11-06 22:24:19,983 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 9 [2023-11-06 22:24:20,002 INFO L322 Elim1Store]: treesize reduction 29, result has 3.3 percent of original size [2023-11-06 22:24:20,003 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 1 [2023-11-06 22:24:20,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:24:20,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:24:20,068 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 9 [2023-11-06 22:24:20,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:24:20,081 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 22:24:20,150 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:24:20,150 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2023-11-06 22:24:20,181 INFO L322 Elim1Store]: treesize reduction 22, result has 46.3 percent of original size [2023-11-06 22:24:20,181 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2023-11-06 22:24:20,335 INFO L322 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-11-06 22:24:20,336 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 43 [2023-11-06 22:24:20,358 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-11-06 22:24:20,360 INFO L351 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 1 case distinctions, treesize of input 23 treesize of output 22 [2023-11-06 22:24:20,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:24:20,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:24:20,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:24:20,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:24:20,594 INFO L322 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2023-11-06 22:24:20,595 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 64 treesize of output 60 [2023-11-06 22:24:20,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:24:20,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:24:20,758 INFO L322 Elim1Store]: treesize reduction 187, result has 27.0 percent of original size [2023-11-06 22:24:20,759 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 74 treesize of output 126 [2023-11-06 22:24:21,007 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:21,007 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:24:21,362 INFO L322 Elim1Store]: treesize reduction 68, result has 16.0 percent of original size [2023-11-06 22:24:21,362 INFO L351 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 107 treesize of output 107 [2023-11-06 22:24:21,660 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-06 22:24:21,661 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2023-11-06 22:24:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:38,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531877957] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:24:38,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:24:38,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2023-11-06 22:24:38,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813799995] [2023-11-06 22:24:38,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:24:38,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-06 22:24:38,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:38,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-06 22:24:38,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=651, Unknown=6, NotChecked=0, Total=812 [2023-11-06 22:24:40,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:24:42,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:24:44,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:24:46,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:24:48,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:24:50,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:24:52,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:24:54,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:24:56,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:24:59,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:00,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:02,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:04,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:07,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:09,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:11,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:13,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:15,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:17,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:19,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:21,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:23,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:25,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:28,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:31,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:33,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:35,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:37,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:39,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:42,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:44,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:45,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:47,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:49,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:51,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:54,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:56,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:25:58,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:26:00,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:26:02,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:26:05,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:26:07,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:26:09,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:26:11,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:26:13,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:26:15,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:26:17,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:26:20,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:26:23,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:26:25,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]