./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-data/cart.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-data/cart.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:59:28,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:59:28,312 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 06:59:28,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:59:28,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:59:28,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:59:28,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:59:28,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:59:28,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:59:28,341 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:59:28,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:59:28,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:59:28,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:59:28,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:59:28,344 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:59:28,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:59:28,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:59:28,345 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:59:28,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:59:28,346 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:59:28,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:59:28,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:59:28,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:59:28,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:59:28,348 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:59:28,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:59:28,349 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:59:28,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:59:28,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:59:28,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:59:28,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:59:28,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:59:28,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:59:28,352 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:59:28,352 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:59:28,352 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:59:28,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:59:28,352 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:59:28,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:59:28,352 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:59:28,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:59:28,353 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:59:28,353 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_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af [2023-11-29 06:59:28,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:59:28,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:59:28,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:59:28,597 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:59:28,598 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:59:28,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/heap-data/cart.i [2023-11-29 06:59:31,312 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:59:31,566 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:59:31,567 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/sv-benchmarks/c/heap-data/cart.i [2023-11-29 06:59:31,582 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/data/a85499f1e/60b854d9b8e440378deb8cc8e20fe78f/FLAG69aeadbe4 [2023-11-29 06:59:31,598 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/data/a85499f1e/60b854d9b8e440378deb8cc8e20fe78f [2023-11-29 06:59:31,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:59:31,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:59:31,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:59:31,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:59:31,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:59:31,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:59:31" (1/1) ... [2023-11-29 06:59:31,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b27d097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:31, skipping insertion in model container [2023-11-29 06:59:31,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:59:31" (1/1) ... [2023-11-29 06:59:31,664 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:59:31,963 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/sv-benchmarks/c/heap-data/cart.i[23713,23726] [2023-11-29 06:59:31,968 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:59:31,978 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:59:32,013 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/sv-benchmarks/c/heap-data/cart.i[23713,23726] [2023-11-29 06:59:32,014 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:59:32,042 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:59:32,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:32 WrapperNode [2023-11-29 06:59:32,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:59:32,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:59:32,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:59:32,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:59:32,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:32" (1/1) ... [2023-11-29 06:59:32,066 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:32" (1/1) ... [2023-11-29 06:59:32,087 INFO L138 Inliner]: procedures = 121, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2023-11-29 06:59:32,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:59:32,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:59:32,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:59:32,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:59:32,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:32" (1/1) ... [2023-11-29 06:59:32,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:32" (1/1) ... [2023-11-29 06:59:32,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:32" (1/1) ... [2023-11-29 06:59:32,116 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 7, 11]. 55 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 5 writes are split as follows [0, 0, 5]. [2023-11-29 06:59:32,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:32" (1/1) ... [2023-11-29 06:59:32,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:32" (1/1) ... [2023-11-29 06:59:32,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:32" (1/1) ... [2023-11-29 06:59:32,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:32" (1/1) ... [2023-11-29 06:59:32,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:32" (1/1) ... [2023-11-29 06:59:32,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:32" (1/1) ... [2023-11-29 06:59:32,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:59:32,134 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:59:32,134 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:59:32,134 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:59:32,135 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:32" (1/1) ... [2023-11-29 06:59:32,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:59:32,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:59:32,162 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:59:32,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:59:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 06:59:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 06:59:32,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 06:59:32,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 06:59:32,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 06:59:32,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 06:59:32,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 06:59:32,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:59:32,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 06:59:32,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 06:59:32,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 06:59:32,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 06:59:32,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 06:59:32,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 06:59:32,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:59:32,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 06:59:32,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 06:59:32,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:59:32,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:59:32,327 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:59:32,330 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:59:32,463 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:59:32,484 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:59:32,485 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 06:59:32,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:59:32 BoogieIcfgContainer [2023-11-29 06:59:32,485 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:59:32,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:59:32,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:59:32,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:59:32,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:59:31" (1/3) ... [2023-11-29 06:59:32,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3ac56f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:59:32, skipping insertion in model container [2023-11-29 06:59:32,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:32" (2/3) ... [2023-11-29 06:59:32,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3ac56f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:59:32, skipping insertion in model container [2023-11-29 06:59:32,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:59:32" (3/3) ... [2023-11-29 06:59:32,496 INFO L112 eAbstractionObserver]: Analyzing ICFG cart.i [2023-11-29 06:59:32,517 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:59:32,517 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 06:59:32,566 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:59:32,574 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@184005bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:59:32,574 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 06:59:32,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:32,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 06:59:32,586 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:59:32,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:59:32,587 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:59:32,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:59:32,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1487606993, now seen corresponding path program 1 times [2023-11-29 06:59:32,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:59:32,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673385841] [2023-11-29 06:59:32,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:32,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:59:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:32,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:59:32,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:59:32,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673385841] [2023-11-29 06:59:32,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673385841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:59:32,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:59:32,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:59:32,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111476669] [2023-11-29 06:59:32,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:59:32,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 06:59:32,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:59:32,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 06:59:32,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:59:32,791 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:32,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:59:32,814 INFO L93 Difference]: Finished difference Result 31 states and 46 transitions. [2023-11-29 06:59:32,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 06:59:32,817 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 06:59:32,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:59:32,825 INFO L225 Difference]: With dead ends: 31 [2023-11-29 06:59:32,825 INFO L226 Difference]: Without dead ends: 16 [2023-11-29 06:59:32,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:59:32,833 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:59:32,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:59:32,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-11-29 06:59:32,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-11-29 06:59:32,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:32,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2023-11-29 06:59:32,869 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 8 [2023-11-29 06:59:32,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:59:32,869 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2023-11-29 06:59:32,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:32,870 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2023-11-29 06:59:32,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 06:59:32,871 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:59:32,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:59:32,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:59:32,871 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:59:32,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:59:32,872 INFO L85 PathProgramCache]: Analyzing trace with hash -2098913187, now seen corresponding path program 1 times [2023-11-29 06:59:32,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:59:32,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257347406] [2023-11-29 06:59:32,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:32,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:59:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:33,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:59:33,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:59:33,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257347406] [2023-11-29 06:59:33,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257347406] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:59:33,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:59:33,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:59:33,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848681569] [2023-11-29 06:59:33,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:59:33,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:59:33,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:59:33,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:59:33,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:59:33,033 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:33,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:59:33,113 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2023-11-29 06:59:33,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:59:33,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 06:59:33,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:59:33,114 INFO L225 Difference]: With dead ends: 35 [2023-11-29 06:59:33,115 INFO L226 Difference]: Without dead ends: 20 [2023-11-29 06:59:33,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:59:33,117 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:59:33,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 44 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:59:33,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-29 06:59:33,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-29 06:59:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2023-11-29 06:59:33,124 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 11 [2023-11-29 06:59:33,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:59:33,124 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2023-11-29 06:59:33,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:33,125 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2023-11-29 06:59:33,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 06:59:33,125 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:59:33,126 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:59:33,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:59:33,126 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:59:33,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:59:33,127 INFO L85 PathProgramCache]: Analyzing trace with hash -2087693085, now seen corresponding path program 1 times [2023-11-29 06:59:33,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:59:33,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717736139] [2023-11-29 06:59:33,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:33,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:59:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:33,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:59:33,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:59:33,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717736139] [2023-11-29 06:59:33,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717736139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:59:33,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:59:33,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:59:33,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851692603] [2023-11-29 06:59:33,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:59:33,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:59:33,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:59:33,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:59:33,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:59:33,241 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:33,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:59:33,333 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2023-11-29 06:59:33,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:59:33,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 06:59:33,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:59:33,335 INFO L225 Difference]: With dead ends: 35 [2023-11-29 06:59:33,335 INFO L226 Difference]: Without dead ends: 29 [2023-11-29 06:59:33,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:59:33,337 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:59:33,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 36 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:59:33,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-29 06:59:33,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2023-11-29 06:59:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:33,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2023-11-29 06:59:33,343 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 15 [2023-11-29 06:59:33,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:59:33,343 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2023-11-29 06:59:33,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:33,344 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2023-11-29 06:59:33,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 06:59:33,344 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:59:33,345 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:59:33,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 06:59:33,345 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:59:33,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:59:33,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1239572016, now seen corresponding path program 1 times [2023-11-29 06:59:33,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:59:33,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261099659] [2023-11-29 06:59:33,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:33,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:59:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:33,403 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 06:59:33,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:59:33,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261099659] [2023-11-29 06:59:33,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261099659] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:59:33,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:59:33,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:59:33,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213716343] [2023-11-29 06:59:33,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:59:33,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:59:33,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:59:33,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:59:33,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:59:33,406 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:33,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:59:33,422 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2023-11-29 06:59:33,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:59:33,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-29 06:59:33,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:59:33,423 INFO L225 Difference]: With dead ends: 36 [2023-11-29 06:59:33,424 INFO L226 Difference]: Without dead ends: 26 [2023-11-29 06:59:33,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:59:33,425 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:59:33,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:59:33,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-29 06:59:33,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-29 06:59:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:33,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2023-11-29 06:59:33,431 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 19 [2023-11-29 06:59:33,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:59:33,432 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2023-11-29 06:59:33,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:33,432 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2023-11-29 06:59:33,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 06:59:33,433 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:59:33,433 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:59:33,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 06:59:33,434 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:59:33,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:59:33,434 INFO L85 PathProgramCache]: Analyzing trace with hash 430225390, now seen corresponding path program 1 times [2023-11-29 06:59:33,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:59:33,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864086638] [2023-11-29 06:59:33,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:33,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:59:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:33,881 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:59:33,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:59:33,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864086638] [2023-11-29 06:59:33,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864086638] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:59:33,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565699501] [2023-11-29 06:59:33,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:33,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:59:33,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:59:33,886 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:59:33,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 06:59:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:34,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 06:59:34,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:59:34,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 15 [2023-11-29 06:59:34,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:59:34,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2023-11-29 06:59:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:59:34,225 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:59:34,368 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-29 06:59:34,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1596 treesize of output 1405 [2023-11-29 06:59:34,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 06:59:34,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565699501] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:59:34,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:59:34,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 12 [2023-11-29 06:59:34,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781189888] [2023-11-29 06:59:34,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:59:34,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 06:59:34,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:59:34,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 06:59:34,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:59:34,553 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:34,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:59:34,861 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2023-11-29 06:59:34,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:59:34,862 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-29 06:59:34,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:59:34,863 INFO L225 Difference]: With dead ends: 47 [2023-11-29 06:59:34,863 INFO L226 Difference]: Without dead ends: 45 [2023-11-29 06:59:34,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2023-11-29 06:59:34,865 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 69 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:59:34,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 117 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:59:34,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-29 06:59:34,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2023-11-29 06:59:34,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2023-11-29 06:59:34,872 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 19 [2023-11-29 06:59:34,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:59:34,873 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2023-11-29 06:59:34,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:34,873 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2023-11-29 06:59:34,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 06:59:34,874 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:59:34,874 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:59:34,881 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 06:59:35,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:59:35,079 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:59:35,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:59:35,079 INFO L85 PathProgramCache]: Analyzing trace with hash 666078984, now seen corresponding path program 1 times [2023-11-29 06:59:35,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:59:35,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715150735] [2023-11-29 06:59:35,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:35,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:59:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:35,285 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 06:59:35,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:59:35,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715150735] [2023-11-29 06:59:35,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715150735] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:59:35,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507522366] [2023-11-29 06:59:35,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:35,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:59:35,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:59:35,288 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:59:35,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 06:59:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:35,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 06:59:35,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:59:35,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 06:59:35,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 06:59:35,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:59:35,585 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:59:35,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2023-11-29 06:59:35,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:59:35,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2023-11-29 06:59:35,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2023-11-29 06:59:35,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:59:35,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2023-11-29 06:59:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 06:59:35,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507522366] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:59:35,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:59:35,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 13 [2023-11-29 06:59:35,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314266406] [2023-11-29 06:59:35,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:59:35,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 06:59:35,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:59:35,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 06:59:35,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:59:35,734 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:35,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:59:35,967 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2023-11-29 06:59:35,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:59:35,968 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-29 06:59:35,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:59:35,969 INFO L225 Difference]: With dead ends: 58 [2023-11-29 06:59:35,969 INFO L226 Difference]: Without dead ends: 48 [2023-11-29 06:59:35,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2023-11-29 06:59:35,970 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 79 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:59:35,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 114 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:59:35,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-29 06:59:35,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2023-11-29 06:59:35,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:35,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2023-11-29 06:59:35,977 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 22 [2023-11-29 06:59:35,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:59:35,977 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2023-11-29 06:59:35,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:35,978 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2023-11-29 06:59:35,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 06:59:35,979 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:59:35,979 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:59:35,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 06:59:36,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:59:36,182 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:59:36,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:59:36,183 INFO L85 PathProgramCache]: Analyzing trace with hash -110453383, now seen corresponding path program 2 times [2023-11-29 06:59:36,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:59:36,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483538087] [2023-11-29 06:59:36,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:36,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:59:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:36,474 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:59:36,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:59:36,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483538087] [2023-11-29 06:59:36,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483538087] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:59:36,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951434806] [2023-11-29 06:59:36,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:59:36,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:59:36,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:59:36,477 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:59:36,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 06:59:36,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 06:59:36,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:59:36,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 06:59:36,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:59:36,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:59:36,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:59:36,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-11-29 06:59:36,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2023-11-29 06:59:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:59:36,722 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:59:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:59:36,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951434806] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:59:36,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:59:36,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-11-29 06:59:36,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389316861] [2023-11-29 06:59:36,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:59:36,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:59:36,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:59:36,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:59:36,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:59:36,806 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:36,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:59:36,939 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2023-11-29 06:59:36,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:59:36,940 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-29 06:59:36,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:59:36,941 INFO L225 Difference]: With dead ends: 66 [2023-11-29 06:59:36,941 INFO L226 Difference]: Without dead ends: 39 [2023-11-29 06:59:36,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:59:36,942 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:59:36,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 95 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:59:36,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-29 06:59:36,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-11-29 06:59:36,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2023-11-29 06:59:36,948 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 23 [2023-11-29 06:59:36,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:59:36,949 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2023-11-29 06:59:36,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:36,949 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2023-11-29 06:59:36,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 06:59:36,950 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:59:36,950 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:59:36,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 06:59:37,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:59:37,157 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:59:37,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:59:37,157 INFO L85 PathProgramCache]: Analyzing trace with hash -948094721, now seen corresponding path program 3 times [2023-11-29 06:59:37,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:59:37,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602352514] [2023-11-29 06:59:37,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:37,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:59:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:38,026 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:59:38,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:59:38,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602352514] [2023-11-29 06:59:38,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602352514] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:59:38,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296178559] [2023-11-29 06:59:38,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 06:59:38,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:59:38,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:59:38,030 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:59:38,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 06:59:38,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 06:59:38,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:59:38,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-29 06:59:38,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:59:38,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:59:38,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 06:59:38,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 06:59:38,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 15 [2023-11-29 06:59:38,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2023-11-29 06:59:38,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:59:38,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 27 [2023-11-29 06:59:38,521 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 06:59:38,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2023-11-29 06:59:38,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:59:38,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2023-11-29 06:59:38,591 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:59:38,592 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:59:38,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2023-11-29 06:59:38,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:59:38,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 95 [2023-11-29 06:59:39,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:59:39,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 368 treesize of output 372 [2023-11-29 06:59:39,364 INFO L349 Elim1Store]: treesize reduction 58, result has 25.6 percent of original size [2023-11-29 06:59:39,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 424 treesize of output 427 [2023-11-29 06:59:39,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:59:39,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 277 treesize of output 297 [2023-11-29 06:59:39,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 234 [2023-11-29 06:59:39,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 226 [2023-11-29 06:59:39,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:59:39,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 497 treesize of output 483 [2023-11-29 06:59:39,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 328 treesize of output 312 [2023-11-29 06:59:39,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 312 treesize of output 304 [2023-11-29 06:59:39,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:59:39,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 374 treesize of output 374 [2023-11-29 06:59:39,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 292 treesize of output 276 [2023-11-29 06:59:39,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:59:39,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 360 treesize of output 356 [2023-11-29 06:59:42,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-29 06:59:42,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-29 06:59:42,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:59:42,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 200 treesize of output 208 [2023-11-29 06:59:42,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:59:42,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 129 [2023-11-29 06:59:43,394 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:59:43,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296178559] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:59:43,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:59:43,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 25 [2023-11-29 06:59:43,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099913738] [2023-11-29 06:59:43,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:59:43,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 06:59:43,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:59:43,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 06:59:43,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=502, Unknown=1, NotChecked=0, Total=600 [2023-11-29 06:59:43,397 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 25 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:44,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:59:44,583 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2023-11-29 06:59:44,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 06:59:44,584 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-29 06:59:44,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:59:44,585 INFO L225 Difference]: With dead ends: 65 [2023-11-29 06:59:44,585 INFO L226 Difference]: Without dead ends: 60 [2023-11-29 06:59:44,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=284, Invalid=1044, Unknown=4, NotChecked=0, Total=1332 [2023-11-29 06:59:44,586 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 220 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:59:44,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 237 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 06:59:44,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-29 06:59:44,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2023-11-29 06:59:44,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:44,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2023-11-29 06:59:44,591 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 27 [2023-11-29 06:59:44,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:59:44,592 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2023-11-29 06:59:44,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:44,592 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2023-11-29 06:59:44,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 06:59:44,593 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:59:44,593 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:59:44,598 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 06:59:44,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:59:44,793 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:59:44,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:59:44,794 INFO L85 PathProgramCache]: Analyzing trace with hash -980998057, now seen corresponding path program 2 times [2023-11-29 06:59:44,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:59:44,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142861667] [2023-11-29 06:59:44,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:44,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:59:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:45,608 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:59:45,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:59:45,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142861667] [2023-11-29 06:59:45,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142861667] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:59:45,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856265749] [2023-11-29 06:59:45,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:59:45,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:59:45,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:59:45,610 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:59:45,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 06:59:45,744 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 06:59:45,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:59:45,747 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-29 06:59:45,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:59:45,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 06:59:45,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:59:45,788 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 06:59:45,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 06:59:45,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:59:45,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2023-11-29 06:59:45,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2023-11-29 06:59:46,051 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:59:46,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 98 [2023-11-29 06:59:46,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 06:59:46,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 23 [2023-11-29 06:59:46,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 06:59:46,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 06:59:46,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:59:46,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2023-11-29 06:59:46,191 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:59:46,192 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:59:46,412 INFO L349 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2023-11-29 06:59:46,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1950 treesize of output 1645 [2023-11-29 06:59:46,561 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_516 (Array Int Int))) (= |c_ULTIMATE.start_main_~i~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (forall ((v_ArrVal_514 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) |c_ULTIMATE.start_main_~i~0#1.base|))) is different from false [2023-11-29 06:59:46,639 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4)) (.cse3 (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|))) (and (forall ((v_ArrVal_514 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_508 Int)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse0 .cse1 v_ArrVal_509) .cse2 v_ArrVal_508)) .cse3 v_ArrVal_514) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse3)) (forall ((v_ArrVal_511 (Array Int Int))) (or (not (= v_ArrVal_511 (store (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|) .cse1 (select v_ArrVal_511 .cse1)) .cse2 (select v_ArrVal_511 .cse2)))) (forall ((v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_511) .cse3 v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) (select v_ArrVal_511 |c_ULTIMATE.start_main_~i~0#1.offset|)))))))) is different from false [2023-11-29 06:59:46,699 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse1 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~l~0#1.offset|))) (and (forall ((v_ArrVal_511 (Array Int Int))) (or (not (= v_ArrVal_511 (store (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base|) .cse0 (select v_ArrVal_511 .cse0)) .cse1 (select v_ArrVal_511 .cse1)))) (forall ((v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_511) .cse2 v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) (select v_ArrVal_511 |c_ULTIMATE.start_main_~l~0#1.offset|))))) (forall ((v_ArrVal_514 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_508 Int)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse3 .cse0 v_ArrVal_509) .cse1 v_ArrVal_508)) .cse2 v_ArrVal_514) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse2))))) is different from false [2023-11-29 06:59:46,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2023-11-29 06:59:46,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:59:46,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 65 [2023-11-29 06:59:46,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:59:46,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 50 [2023-11-29 06:59:46,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2023-11-29 06:59:46,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2023-11-29 06:59:46,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2023-11-29 06:59:46,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 06:59:46,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 06:59:46,853 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-11-29 06:59:46,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856265749] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:59:46,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:59:46,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2023-11-29 06:59:46,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55841063] [2023-11-29 06:59:46,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:59:46,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 06:59:46,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:59:46,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 06:59:46,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=396, Unknown=3, NotChecked=126, Total=600 [2023-11-29 06:59:46,856 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:47,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:59:47,622 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2023-11-29 06:59:47,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 06:59:47,623 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-29 06:59:47,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:59:47,623 INFO L225 Difference]: With dead ends: 59 [2023-11-29 06:59:47,623 INFO L226 Difference]: Without dead ends: 57 [2023-11-29 06:59:47,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=204, Invalid=861, Unknown=3, NotChecked=192, Total=1260 [2023-11-29 06:59:47,625 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 101 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:59:47,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 288 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 258 Invalid, 0 Unknown, 171 Unchecked, 0.4s Time] [2023-11-29 06:59:47,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-29 06:59:47,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2023-11-29 06:59:47,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.32) internal successors, (66), 50 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:47,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2023-11-29 06:59:47,631 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 30 [2023-11-29 06:59:47,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:59:47,632 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2023-11-29 06:59:47,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:47,632 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2023-11-29 06:59:47,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 06:59:47,633 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:59:47,633 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:59:47,638 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 06:59:47,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:59:47,834 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:59:47,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:59:47,834 INFO L85 PathProgramCache]: Analyzing trace with hash 369765898, now seen corresponding path program 4 times [2023-11-29 06:59:47,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:59:47,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189260072] [2023-11-29 06:59:47,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:47,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:59:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:48,548 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:59:48,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:59:48,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189260072] [2023-11-29 06:59:48,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189260072] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:59:48,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641911573] [2023-11-29 06:59:48,549 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 06:59:48,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:59:48,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:59:48,550 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:59:48,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 06:59:49,071 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 06:59:49,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:59:49,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 06:59:49,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:59:49,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 06:59:49,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:59:49,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-29 06:59:49,150 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 06:59:49,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 06:59:49,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 06:59:49,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:59:49,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 15 [2023-11-29 06:59:49,360 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 06:59:49,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2023-11-29 06:59:49,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 11 [2023-11-29 06:59:49,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 06:59:49,464 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 06:59:49,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 58 [2023-11-29 06:59:49,478 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:59:49,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 19 [2023-11-29 06:59:49,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2023-11-29 06:59:49,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2023-11-29 06:59:49,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2023-11-29 06:59:49,610 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:59:49,610 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:59:49,720 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_680 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_675) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_680) |c_ULTIMATE.start_main_~l~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (+ (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) 1)))) is different from false [2023-11-29 06:59:49,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:59:49,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 118 [2023-11-29 06:59:49,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:59:49,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 217 treesize of output 241 [2023-11-29 06:59:49,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 166 [2023-11-29 06:59:49,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 78 [2023-11-29 06:59:50,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:59:50,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2023-11-29 06:59:50,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 06:59:50,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:59:50,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2023-11-29 06:59:50,263 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:59:50,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-29 06:59:50,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2023-11-29 06:59:50,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 06:59:50,276 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2023-11-29 06:59:50,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641911573] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:59:50,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:59:50,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 25 [2023-11-29 06:59:50,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472630541] [2023-11-29 06:59:50,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:59:50,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 06:59:50,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:59:50,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 06:59:50,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=528, Unknown=5, NotChecked=46, Total=650 [2023-11-29 06:59:50,278 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 26 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 25 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:52,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:59:52,849 INFO L93 Difference]: Finished difference Result 122 states and 160 transitions. [2023-11-29 06:59:52,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 06:59:52,849 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 25 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 06:59:52,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:59:52,850 INFO L225 Difference]: With dead ends: 122 [2023-11-29 06:59:52,850 INFO L226 Difference]: Without dead ends: 79 [2023-11-29 06:59:52,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=298, Invalid=1670, Unknown=16, NotChecked=86, Total=2070 [2023-11-29 06:59:52,852 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 215 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 46 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:59:52,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 362 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 374 Invalid, 4 Unknown, 90 Unchecked, 1.2s Time] [2023-11-29 06:59:52,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-29 06:59:52,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2023-11-29 06:59:52,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 66 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:52,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2023-11-29 06:59:52,862 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 31 [2023-11-29 06:59:52,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:59:52,862 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2023-11-29 06:59:52,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 25 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:59:52,862 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2023-11-29 06:59:52,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-29 06:59:52,864 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:59:52,864 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:59:52,869 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 06:59:53,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 06:59:53,064 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:59:53,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:59:53,065 INFO L85 PathProgramCache]: Analyzing trace with hash -752007675, now seen corresponding path program 3 times [2023-11-29 06:59:53,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:59:53,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915937211] [2023-11-29 06:59:53,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:53,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:59:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:53,659 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 06:59:53,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:59:53,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915937211] [2023-11-29 06:59:53,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915937211] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:59:53,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691970237] [2023-11-29 06:59:53,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 06:59:53,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:59:53,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:59:53,661 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:59:53,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 06:59:53,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 06:59:53,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:59:53,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-29 06:59:53,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:59:53,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 06:59:53,888 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 06:59:53,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 06:59:53,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:59:53,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2023-11-29 06:59:54,004 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:59:54,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 64 [2023-11-29 06:59:54,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 32 [2023-11-29 06:59:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 06:59:54,190 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:59:54,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:59:54,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 265 treesize of output 325 [2023-11-29 06:59:54,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:59:54,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 264 treesize of output 302 [2023-11-29 06:59:54,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:59:54,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 200 [2023-11-29 07:00:06,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2023-11-29 07:00:06,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2023-11-29 07:00:07,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 07:00:07,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 07:00:08,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2023-11-29 07:00:09,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 07:00:09,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2023-11-29 07:00:19,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 07:00:19,749 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 07:00:19,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 07:00:19,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 07:00:20,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 07:00:20,131 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 07:00:20,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 07:00:22,490 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 07:00:23,812 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 07:00:24,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2023-11-29 07:00:25,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2023-11-29 07:00:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 07:00:50,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691970237] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:00:50,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:00:50,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2023-11-29 07:00:50,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726964952] [2023-11-29 07:00:50,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:00:50,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 07:00:50,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:00:50,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 07:00:50,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=341, Unknown=16, NotChecked=0, Total=420 [2023-11-29 07:00:50,556 INFO L87 Difference]: Start difference. First operand 67 states and 89 transitions. Second operand has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:00:51,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:00:51,283 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2023-11-29 07:00:51,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 07:00:51,284 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-11-29 07:00:51,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:00:51,285 INFO L225 Difference]: With dead ends: 83 [2023-11-29 07:00:51,285 INFO L226 Difference]: Without dead ends: 70 [2023-11-29 07:00:51,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=204, Invalid=893, Unknown=25, NotChecked=0, Total=1122 [2023-11-29 07:00:51,286 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 154 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 07:00:51,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 300 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 07:00:51,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-29 07:00:51,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2023-11-29 07:00:51,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:00:51,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2023-11-29 07:00:51,295 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 37 [2023-11-29 07:00:51,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:00:51,295 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2023-11-29 07:00:51,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:00:51,296 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2023-11-29 07:00:51,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 07:00:51,297 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:00:51,297 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:00:51,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 07:00:51,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 07:00:51,498 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:00:51,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:00:51,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1181486556, now seen corresponding path program 1 times [2023-11-29 07:00:51,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:00:51,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810661042] [2023-11-29 07:00:51,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:00:51,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:00:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:52,380 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 11 proven. 35 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 07:00:52,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:00:52,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810661042] [2023-11-29 07:00:52,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810661042] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:00:52,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367242426] [2023-11-29 07:00:52,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:00:52,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:00:52,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:00:52,381 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:00:52,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 07:00:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:52,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 07:00:52,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:00:52,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 07:00:52,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 07:00:52,573 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-11-29 07:00:52,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-11-29 07:00:52,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:00:52,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2023-11-29 07:00:52,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-29 07:00:52,614 INFO L349 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2023-11-29 07:00:52,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2023-11-29 07:00:52,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 07:00:52,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 15 [2023-11-29 07:00:52,764 INFO L349 Elim1Store]: treesize reduction 107, result has 9.3 percent of original size [2023-11-29 07:00:52,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 30 [2023-11-29 07:00:52,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 20 [2023-11-29 07:00:52,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2023-11-29 07:00:52,885 INFO L349 Elim1Store]: treesize reduction 89, result has 7.3 percent of original size [2023-11-29 07:00:52,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 71 [2023-11-29 07:00:52,891 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 07:00:52,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 23 [2023-11-29 07:00:52,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2023-11-29 07:00:52,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2023-11-29 07:00:52,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:00:52,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2023-11-29 07:00:52,931 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 07:00:52,931 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:00:52,999 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1035 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1035) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1039) |c_ULTIMATE.start_main_~l~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (+ (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) 1)))) is different from false [2023-11-29 07:00:53,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:00:53,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 118 [2023-11-29 07:00:53,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:00:53,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 217 treesize of output 241 [2023-11-29 07:00:53,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 166 [2023-11-29 07:00:53,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 78 [2023-11-29 07:00:53,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:00:53,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2023-11-29 07:00:53,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 07:00:53,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:00:53,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2023-11-29 07:00:53,486 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:00:53,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-29 07:00:53,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-11-29 07:00:53,534 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 17 not checked. [2023-11-29 07:00:53,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367242426] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:00:53,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:00:53,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2023-11-29 07:00:53,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89534296] [2023-11-29 07:00:53,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:00:53,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 07:00:53,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:00:53,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 07:00:53,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=387, Unknown=5, NotChecked=40, Total=506 [2023-11-29 07:00:53,536 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:00:54,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:00:54,411 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2023-11-29 07:00:54,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 07:00:54,411 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-11-29 07:00:54,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:00:54,412 INFO L225 Difference]: With dead ends: 85 [2023-11-29 07:00:54,412 INFO L226 Difference]: Without dead ends: 80 [2023-11-29 07:00:54,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=261, Invalid=922, Unknown=11, NotChecked=66, Total=1260 [2023-11-29 07:00:54,414 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 265 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 07:00:54,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 223 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 160 Invalid, 0 Unknown, 63 Unchecked, 0.4s Time] [2023-11-29 07:00:54,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-29 07:00:54,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 57. [2023-11-29 07:00:54,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:00:54,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2023-11-29 07:00:54,420 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 38 [2023-11-29 07:00:54,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:00:54,420 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2023-11-29 07:00:54,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:00:54,421 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2023-11-29 07:00:54,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 07:00:54,421 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:00:54,422 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:00:54,427 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-29 07:00:54,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 07:00:54,623 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:00:54,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:00:54,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1940531238, now seen corresponding path program 4 times [2023-11-29 07:00:54,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:00:54,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377042353] [2023-11-29 07:00:54,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:00:54,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:00:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:56,072 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:00:56,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:00:56,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377042353] [2023-11-29 07:00:56,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377042353] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:00:56,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021689292] [2023-11-29 07:00:56,073 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 07:00:56,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:00:56,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:00:56,074 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:00:56,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 07:00:56,366 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 07:00:56,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:00:56,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-29 07:00:56,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:00:56,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 07:00:56,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 07:00:56,414 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-11-29 07:00:56,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-11-29 07:00:56,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-29 07:00:56,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:00:56,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2023-11-29 07:00:56,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:00:56,480 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-11-29 07:00:56,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2023-11-29 07:00:56,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 07:00:56,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2023-11-29 07:00:56,665 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 07:00:56,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 26 [2023-11-29 07:00:56,808 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 07:00:56,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 107 [2023-11-29 07:00:56,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 23 [2023-11-29 07:00:56,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:00:56,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 07:00:56,962 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 07:00:56,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 83 [2023-11-29 07:00:56,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 17 [2023-11-29 07:00:56,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2023-11-29 07:00:57,131 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 07:00:57,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 30 [2023-11-29 07:00:57,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 07:00:57,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:00:57,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2023-11-29 07:00:57,145 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:00:57,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:00:57,243 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1239 (Array Int Int)) (v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1236 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1237) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1236) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (.cse1 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1239) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (< (select .cse0 (+ .cse1 8)) (+ (select .cse0 (+ .cse1 4)) 1)))) is different from false [2023-11-29 07:00:57,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:00:57,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 138 [2023-11-29 07:00:57,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:00:57,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 223 treesize of output 327 [2023-11-29 07:00:57,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 37 [2023-11-29 07:00:57,805 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse8 (select .cse13 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse6 (+ .cse8 8)) (.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse7 (+ .cse8 4)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (and (forall ((v_ArrVal_1225 (Array Int Int))) (or (not (= v_ArrVal_1225 (store (store .cse0 .cse1 (select v_ArrVal_1225 .cse1)) .cse2 (select v_ArrVal_1225 .cse2)))) (forall ((v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1228 Int) (v_ArrVal_1229 Int)) (let ((.cse4 (select v_ArrVal_1225 |c_ULTIMATE.start_main_~i~0#1.offset|))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1225))) (let ((.cse5 (select .cse3 .cse4))) (store (store .cse3 .cse4 (store (store .cse5 .cse6 v_ArrVal_1229) .cse7 v_ArrVal_1228)) (select .cse5 .cse8) v_ArrVal_1236))) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse4))))) (forall ((v_ArrVal_1225 (Array Int Int))) (or (forall ((v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1228 Int) (v_ArrVal_1229 Int)) (not (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1225)) (.cse10 (select v_ArrVal_1225 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse11 (select .cse9 .cse10))) (let ((.cse12 (select .cse11 .cse8))) (= (select (select (store (store .cse9 .cse10 (store (store .cse11 .cse6 v_ArrVal_1229) .cse7 v_ArrVal_1228)) .cse12 v_ArrVal_1236) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse12)))))) (not (= v_ArrVal_1225 (store (store .cse0 .cse1 (select v_ArrVal_1225 .cse1)) .cse2 (select v_ArrVal_1225 .cse2)))))) (forall ((v_ArrVal_1225 (Array Int Int))) (or (forall ((v_ArrVal_1239 (Array Int Int)) (v_ArrVal_1222 Int) (v_ArrVal_1224 Int) (v_ArrVal_1230 (Array Int Int))) (= (select (select (let ((.cse14 (select v_ArrVal_1225 |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse13 .cse1 v_ArrVal_1222) .cse2 v_ArrVal_1224)) .cse14 v_ArrVal_1230) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1225) .cse14) .cse8) v_ArrVal_1239)) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse8)) (not (= v_ArrVal_1225 (store (store .cse0 .cse1 (select v_ArrVal_1225 .cse1)) .cse2 (select v_ArrVal_1225 .cse2)))))) (forall ((v_ArrVal_1225 (Array Int Int))) (or (not (= v_ArrVal_1225 (store (store .cse0 .cse1 (select v_ArrVal_1225 .cse1)) .cse2 (select v_ArrVal_1225 .cse2)))) (forall ((v_ArrVal_1239 (Array Int Int)) (v_ArrVal_1222 Int) (v_ArrVal_1224 Int) (v_ArrVal_1230 (Array Int Int))) (let ((.cse15 (select (select (let ((.cse16 (select v_ArrVal_1225 |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse13 .cse1 v_ArrVal_1222) .cse2 v_ArrVal_1224)) .cse16 v_ArrVal_1230) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1225) .cse16) .cse8) v_ArrVal_1239)) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= .cse15 .cse7) (= .cse15 .cse8)))))))))) is different from false [2023-11-29 07:00:58,020 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse5 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) (.cse12 (+ 8 .cse1)) (.cse2 (+ .cse1 4))) (and (forall ((v_ArrVal_1225 (Array Int Int))) (or (forall ((v_ArrVal_1239 (Array Int Int)) (v_ArrVal_1222 Int) (v_ArrVal_1224 Int) (v_ArrVal_1230 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse6 (select v_ArrVal_1225 |c_ULTIMATE.start_main_~l~0#1.offset|))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse3 .cse4 v_ArrVal_1222) .cse5 v_ArrVal_1224)) .cse6 v_ArrVal_1230) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1225) .cse6) .cse1) v_ArrVal_1239)) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= .cse0 .cse1) (= .cse0 .cse2)))) (not (= (store (store .cse7 .cse4 (select v_ArrVal_1225 .cse4)) .cse5 (select v_ArrVal_1225 .cse5)) v_ArrVal_1225)))) (forall ((v_ArrVal_1225 (Array Int Int))) (or (forall ((v_ArrVal_1239 (Array Int Int)) (v_ArrVal_1222 Int) (v_ArrVal_1224 Int) (v_ArrVal_1230 (Array Int Int))) (= (select (select (let ((.cse8 (select v_ArrVal_1225 |c_ULTIMATE.start_main_~l~0#1.offset|))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse3 .cse4 v_ArrVal_1222) .cse5 v_ArrVal_1224)) .cse8 v_ArrVal_1230) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1225) .cse8) .cse1) v_ArrVal_1239)) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse1)) (not (= (store (store .cse7 .cse4 (select v_ArrVal_1225 .cse4)) .cse5 (select v_ArrVal_1225 .cse5)) v_ArrVal_1225)))) (forall ((v_ArrVal_1225 (Array Int Int))) (or (forall ((v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1228 Int) (v_ArrVal_1229 Int)) (not (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1225)) (.cse10 (select v_ArrVal_1225 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse11 (select .cse9 .cse10))) (let ((.cse13 (select .cse11 .cse1))) (= (select (select (store (store .cse9 .cse10 (store (store .cse11 .cse12 v_ArrVal_1229) .cse2 v_ArrVal_1228)) .cse13 v_ArrVal_1236) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse13)))))) (not (= (store (store .cse7 .cse4 (select v_ArrVal_1225 .cse4)) .cse5 (select v_ArrVal_1225 .cse5)) v_ArrVal_1225)))) (forall ((v_ArrVal_1225 (Array Int Int))) (or (not (= (store (store .cse7 .cse4 (select v_ArrVal_1225 .cse4)) .cse5 (select v_ArrVal_1225 .cse5)) v_ArrVal_1225)) (forall ((v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1228 Int) (v_ArrVal_1229 Int)) (let ((.cse15 (select v_ArrVal_1225 |c_ULTIMATE.start_main_~l~0#1.offset|))) (= (select (select (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1225))) (let ((.cse16 (select .cse14 .cse15))) (store (store .cse14 .cse15 (store (store .cse16 .cse12 v_ArrVal_1229) .cse2 v_ArrVal_1228)) (select .cse16 .cse1) v_ArrVal_1236))) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse15))))))))) is different from false [2023-11-29 07:00:58,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:00:58,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 289 treesize of output 305 [2023-11-29 07:00:58,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 647 treesize of output 639 [2023-11-29 07:00:58,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 07:00:58,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:00:58,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 373 treesize of output 524 [2023-11-29 07:00:58,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 321 treesize of output 317 [2023-11-29 07:00:58,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 317 treesize of output 315 [2023-11-29 07:00:58,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 315 treesize of output 311 [2023-11-29 07:00:58,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 311 treesize of output 303 [2023-11-29 07:00:58,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:00:58,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:00:58,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:00:58,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:00:58,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 45 treesize of output 24 [2023-11-29 07:00:58,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 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 64 treesize of output 62 [2023-11-29 07:00:58,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:00:58,695 INFO L378 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 26 treesize of output 4 [2023-11-29 07:00:58,720 INFO L378 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 26 treesize of output 4 [2023-11-29 07:00:58,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:00:58,752 INFO L378 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 26 treesize of output 4 [2023-11-29 07:00:58,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 07:00:58,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:00:58,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 105 [2023-11-29 07:00:58,969 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 07:00:58,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 193 treesize of output 161 [2023-11-29 07:00:58,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 84 [2023-11-29 07:00:58,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 83 [2023-11-29 07:00:58,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 79 [2023-11-29 07:00:59,107 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 22 not checked. [2023-11-29 07:00:59,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021689292] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:00:59,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:00:59,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2023-11-29 07:00:59,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031868388] [2023-11-29 07:00:59,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:00:59,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 07:00:59,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:00:59,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 07:00:59,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=656, Unknown=6, NotChecked=162, Total=930 [2023-11-29 07:00:59,110 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. Second operand has 31 states, 31 states have (on average 3.161290322580645) internal successors, (98), 31 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:01:23,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:01:23,542 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2023-11-29 07:01:23,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 07:01:23,543 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.161290322580645) internal successors, (98), 31 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-11-29 07:01:23,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:01:23,543 INFO L225 Difference]: With dead ends: 73 [2023-11-29 07:01:23,544 INFO L226 Difference]: Without dead ends: 71 [2023-11-29 07:01:23,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=303, Invalid=1337, Unknown=12, NotChecked=240, Total=1892 [2023-11-29 07:01:23,545 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 284 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 07:01:23,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 280 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 269 Invalid, 0 Unknown, 221 Unchecked, 0.8s Time] [2023-11-29 07:01:23,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-29 07:01:23,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2023-11-29 07:01:23,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 59 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:01:23,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2023-11-29 07:01:23,557 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 38 [2023-11-29 07:01:23,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:01:23,557 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2023-11-29 07:01:23,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.161290322580645) internal successors, (98), 31 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:01:23,558 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2023-11-29 07:01:23,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 07:01:23,559 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:01:23,559 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:01:23,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 07:01:23,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:01:23,760 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:01:23,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:23,760 INFO L85 PathProgramCache]: Analyzing trace with hash 742860827, now seen corresponding path program 5 times [2023-11-29 07:01:23,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:01:23,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091444046] [2023-11-29 07:01:23,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:23,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:01:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:25,318 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:01:25,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:01:25,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091444046] [2023-11-29 07:01:25,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091444046] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:01:25,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074039875] [2023-11-29 07:01:25,319 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 07:01:25,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:01:25,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:01:25,320 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:01:25,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 07:01:30,861 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-11-29 07:01:30,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:01:30,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 89 conjunts are in the unsatisfiable core [2023-11-29 07:01:30,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:01:30,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 07:01:30,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 07:01:30,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 07:01:31,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-29 07:01:31,055 INFO L349 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2023-11-29 07:01:31,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 31 [2023-11-29 07:01:31,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-29 07:01:31,095 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 07:01:31,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-29 07:01:31,139 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-11-29 07:01:31,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-11-29 07:01:31,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-29 07:01:31,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:01:31,322 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-29 07:01:31,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 51 [2023-11-29 07:01:31,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:01:31,355 INFO L349 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2023-11-29 07:01:31,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 53 [2023-11-29 07:01:31,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-29 07:01:31,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:01:31,398 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-11-29 07:01:31,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2023-11-29 07:01:31,720 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-29 07:01:31,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 53 [2023-11-29 07:01:31,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:01:31,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 43 [2023-11-29 07:01:32,000 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-29 07:01:32,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 184 treesize of output 115 [2023-11-29 07:01:32,013 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-29 07:01:32,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 100 [2023-11-29 07:01:32,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:01:32,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 43 [2023-11-29 07:01:32,287 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-29 07:01:32,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 92 [2023-11-29 07:01:32,312 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-11-29 07:01:32,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 46 [2023-11-29 07:01:32,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2023-11-29 07:01:32,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 07:01:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:01:32,339 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:01:32,444 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4)) (.cse4 (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|))) (and (forall ((v_ArrVal_1464 Int) (v_ArrVal_1468 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse0 .cse1 v_ArrVal_1464) .cse2 v_ArrVal_1468)) (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|)) .cse4) 0)) (forall ((v_ArrVal_1465 (Array Int Int))) (or (not (= (store (store .cse3 .cse1 (select v_ArrVal_1465 .cse1)) .cse2 (select v_ArrVal_1465 .cse2)) v_ArrVal_1465)) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1465) (select v_ArrVal_1465 |c_ULTIMATE.start_main_~i~0#1.offset|)) .cse4) 0)))))) is different from false [2023-11-29 07:01:32,599 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse6 (+ .cse8 8)) (.cse7 (+ .cse8 4)) (.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (and (forall ((v_ArrVal_1461 (Array Int Int))) (or (not (= v_ArrVal_1461 (store (store .cse0 .cse1 (select v_ArrVal_1461 .cse1)) .cse2 (select v_ArrVal_1461 .cse2)))) (forall ((v_ArrVal_1464 Int) (v_ArrVal_1457 Int) (v_ArrVal_1468 Int) (v_ArrVal_1459 Int)) (= (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse9 .cse1 v_ArrVal_1457) .cse2 v_ArrVal_1459))) (.cse4 (select v_ArrVal_1461 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse5 (select .cse3 .cse4))) (select (select (store .cse3 .cse4 (store (store .cse5 .cse6 v_ArrVal_1464) .cse7 v_ArrVal_1468)) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1461) .cse4) .cse8)) (select .cse5 .cse8)))) 0)))) (forall ((v_ArrVal_1461 (Array Int Int))) (or (forall ((v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1457 Int) (v_ArrVal_1459 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1461)) (.cse11 (select v_ArrVal_1461 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (not (= v_ArrVal_1465 (store (store (select .cse10 .cse11) .cse6 (select v_ArrVal_1465 .cse6)) .cse7 (select v_ArrVal_1465 .cse7)))) (= (select (select (store .cse10 .cse11 v_ArrVal_1465) (select v_ArrVal_1465 .cse8)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse9 .cse1 v_ArrVal_1457) .cse2 v_ArrVal_1459)) .cse11) .cse8)) 0)))) (not (= v_ArrVal_1461 (store (store .cse0 .cse1 (select v_ArrVal_1461 .cse1)) .cse2 (select v_ArrVal_1461 .cse2)))))))))) is different from false [2023-11-29 07:01:32,806 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse6 (+ 8 .cse2)) (.cse7 (+ .cse2 4)) (.cse4 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse5 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))) (and (forall ((v_ArrVal_1461 (Array Int Int))) (or (forall ((v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1457 Int) (v_ArrVal_1459 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1461)) (.cse1 (select v_ArrVal_1461 |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (select (select (store .cse0 .cse1 v_ArrVal_1465) (select v_ArrVal_1465 .cse2)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse3 .cse4 v_ArrVal_1457) .cse5 v_ArrVal_1459)) .cse1) .cse2)) 0) (not (= (store (store (select .cse0 .cse1) .cse6 (select v_ArrVal_1465 .cse6)) .cse7 (select v_ArrVal_1465 .cse7)) v_ArrVal_1465))))) (not (= v_ArrVal_1461 (store (store .cse8 .cse4 (select v_ArrVal_1461 .cse4)) .cse5 (select v_ArrVal_1461 .cse5)))))) (forall ((v_ArrVal_1461 (Array Int Int))) (or (not (= v_ArrVal_1461 (store (store .cse8 .cse4 (select v_ArrVal_1461 .cse4)) .cse5 (select v_ArrVal_1461 .cse5)))) (forall ((v_ArrVal_1464 Int) (v_ArrVal_1457 Int) (v_ArrVal_1468 Int) (v_ArrVal_1459 Int)) (= (let ((.cse9 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse3 .cse4 v_ArrVal_1457) .cse5 v_ArrVal_1459))) (.cse10 (select v_ArrVal_1461 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse11 (select .cse9 .cse10))) (select (select (store .cse9 .cse10 (store (store .cse11 .cse6 v_ArrVal_1464) .cse7 v_ArrVal_1468)) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1461) .cse10) .cse2)) (select .cse11 .cse2)))) 0)))))))) is different from false [2023-11-29 07:01:32,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:32,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 178 treesize of output 198 [2023-11-29 07:01:33,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:33,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 142 treesize of output 180 [2023-11-29 07:01:33,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:01:33,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:01:33,256 INFO L378 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 26 treesize of output 4 [2023-11-29 07:01:33,314 INFO L378 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 26 treesize of output 4 [2023-11-29 07:01:33,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:33,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 178 [2023-11-29 07:01:33,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:33,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 166 [2023-11-29 07:01:34,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:34,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 84 [2023-11-29 07:01:34,426 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:01:34,440 INFO L349 Elim1Store]: treesize reduction 32, result has 11.1 percent of original size [2023-11-29 07:01:34,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 272 treesize of output 238 [2023-11-29 07:01:34,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:34,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 47 [2023-11-29 07:01:34,456 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:01:34,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2023-11-29 07:01:34,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:34,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 80 [2023-11-29 07:01:34,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:01:34,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 42 [2023-11-29 07:01:34,497 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:01:34,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2023-11-29 07:01:34,508 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:01:34,521 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-29 07:01:34,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 168 [2023-11-29 07:01:34,548 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-29 07:01:34,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 26 [2023-11-29 07:01:34,584 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2023-11-29 07:01:34,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074039875] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:01:34,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:01:34,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2023-11-29 07:01:34,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90288717] [2023-11-29 07:01:34,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:01:34,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 07:01:34,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:01:34,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 07:01:34,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=267, Unknown=3, NotChecked=102, Total=420 [2023-11-29 07:01:34,587 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. Second operand has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:08,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:08,444 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2023-11-29 07:02:08,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 07:02:08,444 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-11-29 07:02:08,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:08,445 INFO L225 Difference]: With dead ends: 114 [2023-11-29 07:02:08,445 INFO L226 Difference]: Without dead ends: 93 [2023-11-29 07:02:08,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 33.9s TimeCoverageRelationStatistics Valid=71, Invalid=397, Unknown=6, NotChecked=126, Total=600 [2023-11-29 07:02:08,446 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 97 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:08,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 391 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 271 Invalid, 0 Unknown, 176 Unchecked, 1.0s Time] [2023-11-29 07:02:08,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-29 07:02:08,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2023-11-29 07:02:08,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 88 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:08,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 115 transitions. [2023-11-29 07:02:08,459 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 115 transitions. Word has length 39 [2023-11-29 07:02:08,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:08,459 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 115 transitions. [2023-11-29 07:02:08,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:02:08,459 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 115 transitions. [2023-11-29 07:02:08,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-29 07:02:08,460 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:08,460 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:08,469 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 07:02:08,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 07:02:08,661 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:08,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:08,662 INFO L85 PathProgramCache]: Analyzing trace with hash 110203856, now seen corresponding path program 5 times [2023-11-29 07:02:08,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:08,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424901891] [2023-11-29 07:02:08,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:08,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:10,667 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:02:10,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:02:10,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424901891] [2023-11-29 07:02:10,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424901891] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:02:10,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466444341] [2023-11-29 07:02:10,668 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 07:02:10,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:02:10,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:02:10,669 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:02:10,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 07:02:15,828 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-29 07:02:15,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:02:15,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 87 conjunts are in the unsatisfiable core [2023-11-29 07:02:15,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:15,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 07:02:15,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 07:02:15,907 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-11-29 07:02:15,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-11-29 07:02:15,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 07:02:16,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-29 07:02:16,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:02:16,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2023-11-29 07:02:16,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:02:16,085 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-11-29 07:02:16,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2023-11-29 07:02:16,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:02:16,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2023-11-29 07:02:16,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-29 07:02:16,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:02:16,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-29 07:02:16,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:02:16,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-29 07:02:16,469 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 07:02:16,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 33 [2023-11-29 07:02:16,663 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 07:02:16,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 96 [2023-11-29 07:02:16,672 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 07:02:16,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 81 [2023-11-29 07:02:16,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:02:16,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2023-11-29 07:02:17,048 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 07:02:17,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 196 treesize of output 125 [2023-11-29 07:02:17,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:02:17,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2023-11-29 07:02:17,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 31 [2023-11-29 07:02:17,557 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 07:02:17,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 37 [2023-11-29 07:02:17,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 07:02:17,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:02:17,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2023-11-29 07:02:17,577 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:02:17,577 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:02:18,069 INFO L349 Elim1Store]: treesize reduction 54, result has 50.5 percent of original size [2023-11-29 07:02:18,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4134 treesize of output 3409 [2023-11-29 07:02:18,280 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (and (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1672 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1677)) (.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1672))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (+ (select (select .cse0 .cse1) .cse2) 4) |c_ULTIMATE.start_main_~i~0#1.offset|) (= |c_ULTIMATE.start_main_~i~0#1.base| (select (select .cse3 .cse1) .cse2)))))) (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1672 (Array Int Int))) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1677))) (select (select .cse6 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1672) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse6 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))) (or (= .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) (= .cse5 .cse4)))) (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1672 (Array Int Int))) (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1677))) (select (select .cse8 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1672) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse8 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))) (or (= .cse7 |c_ULTIMATE.start_main_~i~0#1.offset|) (= (+ .cse7 4) |c_ULTIMATE.start_main_~i~0#1.offset|)))) (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1672 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1677)) (.cse12 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1672))) (let ((.cse10 (select (select .cse12 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse11 (select (select .cse9 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= .cse5 (select (select .cse9 .cse10) .cse11)) (= |c_ULTIMATE.start_main_~i~0#1.base| (select (select .cse12 .cse10) .cse11)))))) (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1672 (Array Int Int))) (= (let ((.cse13 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1677))) (select (select .cse13 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1672) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse13 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) |c_ULTIMATE.start_main_~i~0#1.offset|)) (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1672 (Array Int Int))) (= |c_ULTIMATE.start_main_~i~0#1.base| (select (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1672))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))) is different from false [2023-11-29 07:02:18,867 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse8 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse7 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (and (forall ((v_ArrVal_1669 (Array Int Int))) (or (forall ((v_DerPreprocessor_71 Int) (v_prenex_4513 (Array Int Int)) (v_ArrVal_1668 Int) (v_prenex_4514 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1669) .cse3 v_prenex_4513)) (.cse0 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse5 .cse6 v_DerPreprocessor_71) .cse7 v_ArrVal_1668)) .cse3 v_prenex_4514))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (select (select .cse0 .cse1) .cse2) .cse3) (= (+ (select (select .cse4 .cse1) .cse2) 4) (select v_ArrVal_1669 |c_ULTIMATE.start_main_~i~0#1.offset|)))))) (not (= v_ArrVal_1669 (store (store .cse8 .cse6 (select v_ArrVal_1669 .cse6)) .cse7 (select v_ArrVal_1669 .cse7)))))) (forall ((v_ArrVal_1669 (Array Int Int))) (or (forall ((v_DerPreprocessor_71 Int) (v_prenex_4522 (Array Int Int)) (v_prenex_4521 (Array Int Int)) (v_ArrVal_1668 Int)) (let ((.cse10 (let ((.cse11 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1669) .cse3 v_prenex_4521))) (select (select .cse11 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse5 .cse6 v_DerPreprocessor_71) .cse7 v_ArrVal_1668)) .cse3 v_prenex_4522) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse11 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))) (.cse9 (select v_ArrVal_1669 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (= (+ 4 .cse9) .cse10) (= .cse10 .cse9)))) (not (= v_ArrVal_1669 (store (store .cse8 .cse6 (select v_ArrVal_1669 .cse6)) .cse7 (select v_ArrVal_1669 .cse7)))))) (forall ((v_ArrVal_1669 (Array Int Int))) (or (forall ((v_prenex_4519 (Array Int Int)) (v_prenex_4520 (Array Int Int)) (v_DerPreprocessor_71 Int) (v_ArrVal_1668 Int)) (let ((.cse15 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1669) .cse3 v_prenex_4519)) (.cse12 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse5 .cse6 v_DerPreprocessor_71) .cse7 v_ArrVal_1668)) .cse3 v_prenex_4520))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (select (select .cse12 .cse13) .cse14) .cse3) (= (+ 4 (select v_ArrVal_1669 |c_ULTIMATE.start_main_~i~0#1.offset|)) (select (select .cse15 .cse13) .cse14)))))) (not (= v_ArrVal_1669 (store (store .cse8 .cse6 (select v_ArrVal_1669 .cse6)) .cse7 (select v_ArrVal_1669 .cse7)))))) (forall ((v_ArrVal_1669 (Array Int Int))) (or (forall ((v_ArrVal_1677 (Array Int Int)) (v_DerPreprocessor_71 Int) (v_ArrVal_1672 (Array Int Int)) (v_ArrVal_1668 Int)) (= (select (let ((.cse16 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse5 .cse6 v_DerPreprocessor_71) .cse7 v_ArrVal_1668)) .cse3 v_ArrVal_1672))) (select .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1669) .cse3 v_ArrVal_1677) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) .cse3)) (not (= v_ArrVal_1669 (store (store .cse8 .cse6 (select v_ArrVal_1669 .cse6)) .cse7 (select v_ArrVal_1669 .cse7)))))) (forall ((v_ArrVal_1669 (Array Int Int))) (or (forall ((v_DerPreprocessor_71 Int) (v_ArrVal_1668 Int) (v_prenex_4516 (Array Int Int)) (v_prenex_4515 (Array Int Int))) (= (let ((.cse17 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1669) .cse3 v_prenex_4515))) (select (select .cse17 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse5 .cse6 v_DerPreprocessor_71) .cse7 v_ArrVal_1668)) .cse3 v_prenex_4516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse17 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (select v_ArrVal_1669 |c_ULTIMATE.start_main_~i~0#1.offset|))) (not (= v_ArrVal_1669 (store (store .cse8 .cse6 (select v_ArrVal_1669 .cse6)) .cse7 (select v_ArrVal_1669 .cse7)))))) (forall ((v_ArrVal_1669 (Array Int Int))) (or (forall ((v_prenex_4518 (Array Int Int)) (v_DerPreprocessor_71 Int) (v_prenex_4517 (Array Int Int)) (v_ArrVal_1668 Int)) (let ((.cse19 (let ((.cse20 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1669) .cse3 v_prenex_4517))) (select (select .cse20 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse5 .cse6 v_DerPreprocessor_71) .cse7 v_ArrVal_1668)) .cse3 v_prenex_4518) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse20 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))) (.cse18 (select v_ArrVal_1669 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (= .cse18 .cse19) (= (+ 4 .cse19) .cse18)))) (not (= v_ArrVal_1669 (store (store .cse8 .cse6 (select v_ArrVal_1669 .cse6)) .cse7 (select v_ArrVal_1669 .cse7))))))))) is different from false [2023-11-29 07:02:23,822 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse12 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse10 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse11 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (and (forall ((v_ArrVal_1664 (Array Int Int))) (or (forall ((v_ArrVal_1665 (Array Int Int))) (or (forall ((v_ArrVal_1669 (Array Int Int))) (let ((.cse4 (select v_ArrVal_1665 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse2 (+ .cse4 8)) (.cse3 (+ .cse4 4)) (.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1665)) (.cse1 (select v_ArrVal_1664 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (not (= (store (store (select .cse0 .cse1) .cse2 (select v_ArrVal_1669 .cse2)) .cse3 (select v_ArrVal_1669 .cse3)) v_ArrVal_1669)) (forall ((v_DerPreprocessor_71 Int) (v_ArrVal_1668 Int) (v_prenex_4516 (Array Int Int)) (v_prenex_4515 (Array Int Int))) (= (select v_ArrVal_1669 .cse4) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1664))) (let ((.cse7 (select .cse6 .cse1))) (let ((.cse8 (select .cse7 .cse4))) (let ((.cse5 (store (store .cse0 .cse1 v_ArrVal_1669) .cse8 v_prenex_4515))) (select (select .cse5 (select (select (store (store .cse6 .cse1 (store (store .cse7 .cse2 v_DerPreprocessor_71) .cse3 v_ArrVal_1668)) .cse8 v_prenex_4516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse5 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))))))))) (not (= (store (store .cse9 .cse10 (select v_ArrVal_1665 .cse10)) .cse11 (select v_ArrVal_1665 .cse11)) v_ArrVal_1665)))) (not (= v_ArrVal_1664 (store (store .cse12 .cse10 (select v_ArrVal_1664 .cse10)) .cse11 (select v_ArrVal_1664 .cse11)))))) (forall ((v_ArrVal_1664 (Array Int Int))) (or (forall ((v_ArrVal_1665 (Array Int Int))) (or (not (= (store (store .cse9 .cse10 (select v_ArrVal_1665 .cse10)) .cse11 (select v_ArrVal_1665 .cse11)) v_ArrVal_1665)) (forall ((v_ArrVal_1669 (Array Int Int))) (let ((.cse20 (select v_ArrVal_1665 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse15 (+ .cse20 8)) (.cse16 (+ .cse20 4)) (.cse13 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1665)) (.cse14 (select v_ArrVal_1664 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (not (= (store (store (select .cse13 .cse14) .cse15 (select v_ArrVal_1669 .cse15)) .cse16 (select v_ArrVal_1669 .cse16)) v_ArrVal_1669)) (forall ((v_DerPreprocessor_71 Int) (v_prenex_4513 (Array Int Int)) (v_ArrVal_1668 Int) (v_prenex_4514 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1664))) (let ((.cse24 (select .cse23 .cse14))) (let ((.cse21 (select .cse24 .cse20))) (let ((.cse17 (store (store .cse13 .cse14 v_ArrVal_1669) .cse21 v_prenex_4513)) (.cse22 (store (store .cse23 .cse14 (store (store .cse24 .cse15 v_DerPreprocessor_71) .cse16 v_ArrVal_1668)) .cse21 v_prenex_4514))) (let ((.cse18 (select (select .cse22 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse19 (select (select .cse17 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (+ 4 (select (select .cse17 .cse18) .cse19)) (select v_ArrVal_1669 .cse20)) (= .cse21 (select (select .cse22 .cse18) .cse19))))))))))))))) (not (= v_ArrVal_1664 (store (store .cse12 .cse10 (select v_ArrVal_1664 .cse10)) .cse11 (select v_ArrVal_1664 .cse11)))))) (forall ((v_ArrVal_1664 (Array Int Int))) (or (forall ((v_ArrVal_1665 (Array Int Int))) (or (forall ((v_ArrVal_1669 (Array Int Int))) (let ((.cse32 (select v_ArrVal_1665 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse27 (+ .cse32 8)) (.cse28 (+ .cse32 4)) (.cse25 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1665)) (.cse26 (select v_ArrVal_1664 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (not (= (store (store (select .cse25 .cse26) .cse27 (select v_ArrVal_1669 .cse27)) .cse28 (select v_ArrVal_1669 .cse28)) v_ArrVal_1669)) (forall ((v_prenex_4519 (Array Int Int)) (v_prenex_4520 (Array Int Int)) (v_DerPreprocessor_71 Int) (v_ArrVal_1668 Int)) (let ((.cse35 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1664))) (let ((.cse36 (select .cse35 .cse26))) (let ((.cse34 (select .cse36 .cse32))) (let ((.cse29 (store (store .cse25 .cse26 v_ArrVal_1669) .cse34 v_prenex_4519)) (.cse33 (store (store .cse35 .cse26 (store (store .cse36 .cse27 v_DerPreprocessor_71) .cse28 v_ArrVal_1668)) .cse34 v_prenex_4520))) (let ((.cse30 (select (select .cse33 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse31 (select (select .cse29 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (select (select .cse29 .cse30) .cse31) (+ (select v_ArrVal_1669 .cse32) 4)) (= (select (select .cse33 .cse30) .cse31) .cse34)))))))))))) (not (= (store (store .cse9 .cse10 (select v_ArrVal_1665 .cse10)) .cse11 (select v_ArrVal_1665 .cse11)) v_ArrVal_1665)))) (not (= v_ArrVal_1664 (store (store .cse12 .cse10 (select v_ArrVal_1664 .cse10)) .cse11 (select v_ArrVal_1664 .cse11)))))) (forall ((v_ArrVal_1664 (Array Int Int))) (or (forall ((v_ArrVal_1665 (Array Int Int))) (or (forall ((v_ArrVal_1669 (Array Int Int))) (let ((.cse45 (select v_ArrVal_1665 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse39 (+ .cse45 8)) (.cse40 (+ .cse45 4)) (.cse37 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1665)) (.cse38 (select v_ArrVal_1664 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (not (= (store (store (select .cse37 .cse38) .cse39 (select v_ArrVal_1669 .cse39)) .cse40 (select v_ArrVal_1669 .cse40)) v_ArrVal_1669)) (forall ((v_ArrVal_1677 (Array Int Int)) (v_DerPreprocessor_71 Int) (v_ArrVal_1672 (Array Int Int)) (v_ArrVal_1668 Int)) (let ((.cse43 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1664))) (let ((.cse44 (select .cse43 .cse38))) (let ((.cse41 (select .cse44 .cse45))) (= .cse41 (select (let ((.cse42 (store (store .cse43 .cse38 (store (store .cse44 .cse39 v_DerPreprocessor_71) .cse40 v_ArrVal_1668)) .cse41 v_ArrVal_1672))) (select .cse42 (select (select .cse42 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (select (select (store (store .cse37 .cse38 v_ArrVal_1669) .cse41 v_ArrVal_1677) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))))))))) (not (= (store (store .cse9 .cse10 (select v_ArrVal_1665 .cse10)) .cse11 (select v_ArrVal_1665 .cse11)) v_ArrVal_1665)))) (not (= v_ArrVal_1664 (store (store .cse12 .cse10 (select v_ArrVal_1664 .cse10)) .cse11 (select v_ArrVal_1664 .cse11)))))) (forall ((v_ArrVal_1664 (Array Int Int))) (or (forall ((v_ArrVal_1665 (Array Int Int))) (or (forall ((v_ArrVal_1669 (Array Int Int))) (let ((.cse56 (select v_ArrVal_1665 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse48 (+ .cse56 8)) (.cse49 (+ .cse56 4)) (.cse46 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1665)) (.cse47 (select v_ArrVal_1664 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (not (= (store (store (select .cse46 .cse47) .cse48 (select v_ArrVal_1669 .cse48)) .cse49 (select v_ArrVal_1669 .cse49)) v_ArrVal_1669)) (forall ((v_DerPreprocessor_71 Int) (v_prenex_4522 (Array Int Int)) (v_prenex_4521 (Array Int Int)) (v_ArrVal_1668 Int)) (let ((.cse51 (select v_ArrVal_1669 .cse56)) (.cse50 (let ((.cse53 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1664))) (let ((.cse54 (select .cse53 .cse47))) (let ((.cse55 (select .cse54 .cse56))) (let ((.cse52 (store (store .cse46 .cse47 v_ArrVal_1669) .cse55 v_prenex_4521))) (select (select .cse52 (select (select (store (store .cse53 .cse47 (store (store .cse54 .cse48 v_DerPreprocessor_71) .cse49 v_ArrVal_1668)) .cse55 v_prenex_4522) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse52 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))))) (or (= .cse50 (+ .cse51 4)) (= .cse51 .cse50)))))))) (not (= (store (store .cse9 .cse10 (select v_ArrVal_1665 .cse10)) .cse11 (select v_ArrVal_1665 .cse11)) v_ArrVal_1665)))) (not (= v_ArrVal_1664 (store (store .cse12 .cse10 (select v_ArrVal_1664 .cse10)) .cse11 (select v_ArrVal_1664 .cse11)))))) (forall ((v_ArrVal_1664 (Array Int Int))) (or (forall ((v_ArrVal_1665 (Array Int Int))) (or (forall ((v_ArrVal_1669 (Array Int Int))) (let ((.cse63 (select v_ArrVal_1665 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse59 (+ .cse63 8)) (.cse60 (+ .cse63 4)) (.cse57 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1665)) (.cse58 (select v_ArrVal_1664 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (not (= (store (store (select .cse57 .cse58) .cse59 (select v_ArrVal_1669 .cse59)) .cse60 (select v_ArrVal_1669 .cse60)) v_ArrVal_1669)) (forall ((v_prenex_4518 (Array Int Int)) (v_DerPreprocessor_71 Int) (v_prenex_4517 (Array Int Int)) (v_ArrVal_1668 Int)) (let ((.cse61 (let ((.cse65 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1664))) (let ((.cse66 (select .cse65 .cse58))) (let ((.cse67 (select .cse66 .cse63))) (let ((.cse64 (store (store .cse57 .cse58 v_ArrVal_1669) .cse67 v_prenex_4517))) (select (select .cse64 (select (select (store (store .cse65 .cse58 (store (store .cse66 .cse59 v_DerPreprocessor_71) .cse60 v_ArrVal_1668)) .cse67 v_prenex_4518) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse64 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))))) (.cse62 (select v_ArrVal_1669 .cse63))) (or (= .cse61 .cse62) (= (+ .cse61 4) .cse62)))))))) (not (= (store (store .cse9 .cse10 (select v_ArrVal_1665 .cse10)) .cse11 (select v_ArrVal_1665 .cse11)) v_ArrVal_1665)))) (not (= v_ArrVal_1664 (store (store .cse12 .cse10 (select v_ArrVal_1664 .cse10)) .cse11 (select v_ArrVal_1664 .cse11)))))))) is different from false [2023-11-29 07:02:30,516 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse2 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))) (and (forall ((v_ArrVal_1664 (Array Int Int))) (or (not (= v_ArrVal_1664 (store (store .cse0 .cse1 (select v_ArrVal_1664 .cse1)) .cse2 (select v_ArrVal_1664 .cse2)))) (forall ((v_ArrVal_1665 (Array Int Int))) (or (not (= v_ArrVal_1665 (store (store .cse3 .cse1 (select v_ArrVal_1665 .cse1)) .cse2 (select v_ArrVal_1665 .cse2)))) (forall ((v_ArrVal_1669 (Array Int Int))) (let ((.cse14 (select v_ArrVal_1665 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse13 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1665)) (.cse8 (select v_ArrVal_1664 |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse10 (+ .cse14 8)) (.cse11 (+ .cse14 4))) (or (forall ((v_prenex_4518 (Array Int Int)) (v_DerPreprocessor_71 Int) (v_prenex_4517 (Array Int Int)) (v_ArrVal_1668 Int)) (let ((.cse4 (select v_ArrVal_1669 .cse14)) (.cse5 (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1664))) (let ((.cse9 (select .cse7 .cse8))) (let ((.cse12 (select .cse9 .cse14))) (let ((.cse6 (store (store .cse13 .cse8 v_ArrVal_1669) .cse12 v_prenex_4517))) (select (select .cse6 (select (select (store (store .cse7 .cse8 (store (store .cse9 .cse10 v_DerPreprocessor_71) .cse11 v_ArrVal_1668)) .cse12 v_prenex_4518) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse6 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))))) (or (= .cse4 (+ .cse5 4)) (= .cse4 .cse5)))) (not (= v_ArrVal_1669 (store (store (select .cse13 .cse8) .cse10 (select v_ArrVal_1669 .cse10)) .cse11 (select v_ArrVal_1669 .cse11)))))))))))) (forall ((v_ArrVal_1664 (Array Int Int))) (or (not (= v_ArrVal_1664 (store (store .cse0 .cse1 (select v_ArrVal_1664 .cse1)) .cse2 (select v_ArrVal_1664 .cse2)))) (forall ((v_ArrVal_1665 (Array Int Int))) (or (not (= v_ArrVal_1665 (store (store .cse3 .cse1 (select v_ArrVal_1665 .cse1)) .cse2 (select v_ArrVal_1665 .cse2)))) (forall ((v_ArrVal_1669 (Array Int Int))) (let ((.cse15 (select v_ArrVal_1665 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse23 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1665)) (.cse18 (select v_ArrVal_1664 |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse20 (+ .cse15 8)) (.cse21 (+ .cse15 4))) (or (forall ((v_DerPreprocessor_71 Int) (v_ArrVal_1668 Int) (v_prenex_4516 (Array Int Int)) (v_prenex_4515 (Array Int Int))) (= (select v_ArrVal_1669 .cse15) (let ((.cse17 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1664))) (let ((.cse19 (select .cse17 .cse18))) (let ((.cse22 (select .cse19 .cse15))) (let ((.cse16 (store (store .cse23 .cse18 v_ArrVal_1669) .cse22 v_prenex_4515))) (select (select .cse16 (select (select (store (store .cse17 .cse18 (store (store .cse19 .cse20 v_DerPreprocessor_71) .cse21 v_ArrVal_1668)) .cse22 v_prenex_4516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse16 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))))) (not (= v_ArrVal_1669 (store (store (select .cse23 .cse18) .cse20 (select v_ArrVal_1669 .cse20)) .cse21 (select v_ArrVal_1669 .cse21)))))))))))) (forall ((v_ArrVal_1664 (Array Int Int))) (or (forall ((v_ArrVal_1665 (Array Int Int))) (or (not (= v_ArrVal_1665 (store (store .cse3 .cse1 (select v_ArrVal_1665 .cse1)) .cse2 (select v_ArrVal_1665 .cse2)))) (forall ((v_ArrVal_1669 (Array Int Int))) (let ((.cse26 (select v_ArrVal_1665 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse34 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1665)) (.cse29 (select v_ArrVal_1664 |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse31 (+ .cse26 8)) (.cse32 (+ .cse26 4))) (or (forall ((v_DerPreprocessor_71 Int) (v_prenex_4522 (Array Int Int)) (v_prenex_4521 (Array Int Int)) (v_ArrVal_1668 Int)) (let ((.cse25 (let ((.cse28 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1664))) (let ((.cse30 (select .cse28 .cse29))) (let ((.cse33 (select .cse30 .cse26))) (let ((.cse27 (store (store .cse34 .cse29 v_ArrVal_1669) .cse33 v_prenex_4521))) (select (select .cse27 (select (select (store (store .cse28 .cse29 (store (store .cse30 .cse31 v_DerPreprocessor_71) .cse32 v_ArrVal_1668)) .cse33 v_prenex_4522) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse27 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))))) (.cse24 (select v_ArrVal_1669 .cse26))) (or (= .cse24 .cse25) (= .cse25 (+ .cse24 4))))) (not (= v_ArrVal_1669 (store (store (select .cse34 .cse29) .cse31 (select v_ArrVal_1669 .cse31)) .cse32 (select v_ArrVal_1669 .cse32)))))))))) (not (= v_ArrVal_1664 (store (store .cse0 .cse1 (select v_ArrVal_1664 .cse1)) .cse2 (select v_ArrVal_1664 .cse2)))))) (forall ((v_ArrVal_1664 (Array Int Int))) (or (not (= v_ArrVal_1664 (store (store .cse0 .cse1 (select v_ArrVal_1664 .cse1)) .cse2 (select v_ArrVal_1664 .cse2)))) (forall ((v_ArrVal_1665 (Array Int Int))) (or (not (= v_ArrVal_1665 (store (store .cse3 .cse1 (select v_ArrVal_1665 .cse1)) .cse2 (select v_ArrVal_1665 .cse2)))) (forall ((v_ArrVal_1669 (Array Int Int))) (let ((.cse39 (select v_ArrVal_1665 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse37 (+ .cse39 8)) (.cse38 (+ .cse39 4)) (.cse35 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1665)) (.cse36 (select v_ArrVal_1664 |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (not (= v_ArrVal_1669 (store (store (select .cse35 .cse36) .cse37 (select v_ArrVal_1669 .cse37)) .cse38 (select v_ArrVal_1669 .cse38)))) (forall ((v_DerPreprocessor_71 Int) (v_prenex_4513 (Array Int Int)) (v_ArrVal_1668 Int) (v_prenex_4514 (Array Int Int))) (let ((.cse45 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1664))) (let ((.cse46 (select .cse45 .cse36))) (let ((.cse44 (select .cse46 .cse39))) (let ((.cse40 (store (store .cse35 .cse36 v_ArrVal_1669) .cse44 v_prenex_4513)) (.cse43 (store (store .cse45 .cse36 (store (store .cse46 .cse37 v_DerPreprocessor_71) .cse38 v_ArrVal_1668)) .cse44 v_prenex_4514))) (let ((.cse41 (select (select .cse43 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse42 (select (select .cse40 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (select v_ArrVal_1669 .cse39) (+ 4 (select (select .cse40 .cse41) .cse42))) (= (select (select .cse43 .cse41) .cse42) .cse44)))))))))))))))) (forall ((v_ArrVal_1664 (Array Int Int))) (or (forall ((v_ArrVal_1665 (Array Int Int))) (or (not (= v_ArrVal_1665 (store (store .cse3 .cse1 (select v_ArrVal_1665 .cse1)) .cse2 (select v_ArrVal_1665 .cse2)))) (forall ((v_ArrVal_1669 (Array Int Int))) (let ((.cse55 (select v_ArrVal_1665 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse49 (+ .cse55 8)) (.cse50 (+ .cse55 4)) (.cse47 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1665)) (.cse48 (select v_ArrVal_1664 |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (not (= v_ArrVal_1669 (store (store (select .cse47 .cse48) .cse49 (select v_ArrVal_1669 .cse49)) .cse50 (select v_ArrVal_1669 .cse50)))) (forall ((v_ArrVal_1677 (Array Int Int)) (v_DerPreprocessor_71 Int) (v_ArrVal_1672 (Array Int Int)) (v_ArrVal_1668 Int)) (let ((.cse52 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1664))) (let ((.cse53 (select .cse52 .cse48))) (let ((.cse54 (select .cse53 .cse55))) (= (select (let ((.cse51 (store (store .cse52 .cse48 (store (store .cse53 .cse49 v_DerPreprocessor_71) .cse50 v_ArrVal_1668)) .cse54 v_ArrVal_1672))) (select .cse51 (select (select .cse51 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (select (select (store (store .cse47 .cse48 v_ArrVal_1669) .cse54 v_ArrVal_1677) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) .cse54))))))))))) (not (= v_ArrVal_1664 (store (store .cse0 .cse1 (select v_ArrVal_1664 .cse1)) .cse2 (select v_ArrVal_1664 .cse2)))))) (forall ((v_ArrVal_1664 (Array Int Int))) (or (not (= v_ArrVal_1664 (store (store .cse0 .cse1 (select v_ArrVal_1664 .cse1)) .cse2 (select v_ArrVal_1664 .cse2)))) (forall ((v_ArrVal_1665 (Array Int Int))) (or (not (= v_ArrVal_1665 (store (store .cse3 .cse1 (select v_ArrVal_1665 .cse1)) .cse2 (select v_ArrVal_1665 .cse2)))) (forall ((v_ArrVal_1669 (Array Int Int))) (let ((.cse65 (select v_ArrVal_1665 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse58 (+ .cse65 8)) (.cse59 (+ .cse65 4)) (.cse56 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1665)) (.cse57 (select v_ArrVal_1664 |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (not (= v_ArrVal_1669 (store (store (select .cse56 .cse57) .cse58 (select v_ArrVal_1669 .cse58)) .cse59 (select v_ArrVal_1669 .cse59)))) (forall ((v_prenex_4519 (Array Int Int)) (v_prenex_4520 (Array Int Int)) (v_DerPreprocessor_71 Int) (v_ArrVal_1668 Int)) (let ((.cse66 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1664))) (let ((.cse67 (select .cse66 .cse57))) (let ((.cse63 (select .cse67 .cse65))) (let ((.cse64 (store (store .cse56 .cse57 v_ArrVal_1669) .cse63 v_prenex_4519)) (.cse60 (store (store .cse66 .cse57 (store (store .cse67 .cse58 v_DerPreprocessor_71) .cse59 v_ArrVal_1668)) .cse63 v_prenex_4520))) (let ((.cse61 (select (select .cse60 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse62 (select (select .cse64 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (select (select .cse60 .cse61) .cse62) .cse63) (= (select (select .cse64 .cse61) .cse62) (+ (select v_ArrVal_1669 .cse65) 4))))))))))))))))))) is different from false [2023-11-29 07:03:28,597 WARN L293 SmtUtils]: Spent 53.86s on a formula simplification that was a NOOP. DAG size: 83 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 07:03:28,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:03:28,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 1585 treesize of output 1925 [2023-11-29 07:04:07,908 WARN L293 SmtUtils]: Spent 39.27s on a formula simplification that was a NOOP. DAG size: 83 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 07:04:07,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:04:07,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 1507 treesize of output 1847 [2023-11-29 07:04:09,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:09,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:09,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:09,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:09,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:11,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:11,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:11,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:11,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:12,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:12,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:12,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:12,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:12,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:13,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:14,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:14,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:14,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:14,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:15,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:16,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:16,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:16,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:17,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:17,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:17,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:17,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:18,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:18,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:18,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:18,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 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 64 treesize of output 62 [2023-11-29 07:04:18,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 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 64 treesize of output 62 [2023-11-29 07:04:19,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 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 64 treesize of output 62 [2023-11-29 07:04:19,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 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 64 treesize of output 62 [2023-11-29 07:04:19,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 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 64 treesize of output 62 [2023-11-29 07:04:19,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:19,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:20,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:20,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:20,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:20,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:20,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:20,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:21,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:21,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:21,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:21,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:21,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:22,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:22,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:23,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:23,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:23,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:23,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:23,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:24,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:24,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:25,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:25,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:25,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:25,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:25,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:25,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:25,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:26,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:04:27,838 INFO L378 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 26 treesize of output 4 [2023-11-29 07:04:27,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 45 treesize of output 24 [2023-11-29 07:04:28,034 INFO L378 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 26 treesize of output 4 [2023-11-29 07:04:28,142 INFO L378 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 26 treesize of output 4 [2023-11-29 07:04:28,296 INFO L378 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 26 treesize of output 4 [2023-11-29 07:04:29,029 INFO L378 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 26 treesize of output 4 [2023-11-29 07:04:29,157 INFO L378 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 26 treesize of output 4 [2023-11-29 07:04:29,385 INFO L378 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 26 treesize of output 4 [2023-11-29 07:04:29,575 INFO L378 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 26 treesize of output 4 [2023-11-29 07:04:29,738 INFO L378 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 26 treesize of output 4 [2023-11-29 07:04:50,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:04:50,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1883 treesize of output 1708 [2023-11-29 07:05:01,645 WARN L293 SmtUtils]: Spent 11.11s on a formula simplification. DAG size of input: 363 DAG size of output: 343 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 07:05:01,646 INFO L349 Elim1Store]: treesize reduction 345, result has 91.4 percent of original size [2023-11-29 07:05:01,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 115066 treesize of output 113166 [2023-11-29 07:05:02,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:05:02,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36135 treesize of output 23743 [2023-11-29 07:05:06,117 INFO L349 Elim1Store]: treesize reduction 38, result has 93.9 percent of original size [2023-11-29 07:05:06,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 132167 treesize of output 107625 [2023-11-29 07:05:09,264 INFO L349 Elim1Store]: treesize reduction 48, result has 47.8 percent of original size [2023-11-29 07:05:09,265 INFO L378 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 4085 treesize of output 4109 [2023-11-29 07:05:10,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:05:10,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5502 treesize of output 5284 [2023-11-29 07:05:11,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:05:11,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 4005 treesize of output 3951 [2023-11-29 07:05:12,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:05:12,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4974 treesize of output 4796 [2023-11-29 07:05:13,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:05:13,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 3819 treesize of output 3756 [2023-11-29 07:05:15,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:05:15,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 3743 treesize of output 3680 [2023-11-29 07:05:17,096 INFO L349 Elim1Store]: treesize reduction 36, result has 51.4 percent of original size [2023-11-29 07:05:17,097 INFO L378 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 3667 treesize of output 3685 [2023-11-29 07:05:18,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:05:18,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 3649 treesize of output 3624 [2023-11-29 07:05:20,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4614 treesize of output 4462 [2023-11-29 07:05:20,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4850 treesize of output 4658 [2023-11-29 07:05:21,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:05:21,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 3497 treesize of output 3444 [2023-11-29 07:05:23,690 INFO L349 Elim1Store]: treesize reduction 36, result has 51.4 percent of original size [2023-11-29 07:05:23,691 INFO L378 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 3431 treesize of output 3453 [2023-11-29 07:05:25,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3417 treesize of output 3393 [2023-11-29 07:05:26,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:05:26,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3822 treesize of output 3724 [2023-11-29 07:05:26,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:05:26,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3450 treesize of output 3386 [2023-11-29 07:05:28,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:05:28,085 INFO L378 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 3295 treesize of output 3306 [2023-11-29 07:05:29,861 INFO L349 Elim1Store]: treesize reduction 36, result has 51.4 percent of original size [2023-11-29 07:05:29,862 INFO L378 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 3285 treesize of output 3303 [2023-11-29 07:05:31,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:05:31,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4326 treesize of output 4148 [2023-11-29 07:05:32,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:05:32,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4426 treesize of output 4206 [2023-11-29 07:05:33,729 INFO L349 Elim1Store]: treesize reduction 36, result has 51.4 percent of original size [2023-11-29 07:05:33,731 INFO L378 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 3089 treesize of output 3111 [2023-11-29 07:05:35,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4008 treesize of output 3896 [2023-11-29 07:05:37,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4248 treesize of output 4070 [2023-11-29 07:05:38,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3908 treesize of output 3756 [2023-11-29 07:05:39,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4094 treesize of output 3894 [2023-11-29 07:10:14,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-11-29 07:10:14,080 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-29 07:10:14,082 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 07:10:14,091 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 07:10:14,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 07:10:14,283 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.pushInner(QuantifierPusher.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:194) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 75 more [2023-11-29 07:10:14,287 INFO L158 Benchmark]: Toolchain (without parser) took 642684.37ms. Allocated memory was 186.6MB in the beginning and 677.4MB in the end (delta: 490.7MB). Free memory was 150.9MB in the beginning and 445.6MB in the end (delta: -294.7MB). Peak memory consumption was 422.7MB. Max. memory is 16.1GB. [2023-11-29 07:10:14,287 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 127.9MB. Free memory is still 98.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 07:10:14,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.77ms. Allocated memory is still 186.6MB. Free memory was 150.9MB in the beginning and 149.5MB in the end (delta: 1.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 07:10:14,287 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.07ms. Allocated memory is still 186.6MB. Free memory was 149.5MB in the beginning and 147.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 07:10:14,287 INFO L158 Benchmark]: Boogie Preprocessor took 44.96ms. Allocated memory is still 186.6MB. Free memory was 147.4MB in the beginning and 145.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 07:10:14,287 INFO L158 Benchmark]: RCFGBuilder took 351.97ms. Allocated memory is still 186.6MB. Free memory was 145.3MB in the beginning and 131.1MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 07:10:14,288 INFO L158 Benchmark]: TraceAbstraction took 641797.39ms. Allocated memory was 186.6MB in the beginning and 677.4MB in the end (delta: 490.7MB). Free memory was 130.6MB in the beginning and 445.6MB in the end (delta: -315.0MB). Peak memory consumption was 404.6MB. Max. memory is 16.1GB. [2023-11-29 07:10:14,289 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 127.9MB. Free memory is still 98.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 438.77ms. Allocated memory is still 186.6MB. Free memory was 150.9MB in the beginning and 149.5MB in the end (delta: 1.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.07ms. Allocated memory is still 186.6MB. Free memory was 149.5MB in the beginning and 147.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.96ms. Allocated memory is still 186.6MB. Free memory was 147.4MB in the beginning and 145.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 351.97ms. Allocated memory is still 186.6MB. Free memory was 145.3MB in the beginning and 131.1MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 641797.39ms. Allocated memory was 186.6MB in the beginning and 677.4MB in the end (delta: 490.7MB). Free memory was 130.6MB in the beginning and 445.6MB in the end (delta: -315.0MB). Peak memory consumption was 404.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-data/cart.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 07:10:16,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 07:10:16,221 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 07:10:16,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 07:10:16,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 07:10:16,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 07:10:16,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 07:10:16,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 07:10:16,251 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 07:10:16,252 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 07:10:16,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 07:10:16,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 07:10:16,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 07:10:16,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 07:10:16,255 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 07:10:16,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 07:10:16,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 07:10:16,256 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 07:10:16,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 07:10:16,258 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 07:10:16,258 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 07:10:16,260 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 07:10:16,261 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 07:10:16,261 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 07:10:16,262 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 07:10:16,262 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 07:10:16,262 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 07:10:16,263 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 07:10:16,263 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 07:10:16,263 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 07:10:16,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 07:10:16,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 07:10:16,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 07:10:16,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:10:16,265 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 07:10:16,265 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 07:10:16,265 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 07:10:16,265 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 07:10:16,266 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 07:10:16,266 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 07:10:16,266 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 07:10:16,266 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 07:10:16,266 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 07:10:16,267 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 07:10:16,267 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 07:10:16,267 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_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af [2023-11-29 07:10:16,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 07:10:16,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 07:10:16,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 07:10:16,582 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 07:10:16,583 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 07:10:16,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/heap-data/cart.i [2023-11-29 07:10:19,420 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 07:10:19,681 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 07:10:19,682 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/sv-benchmarks/c/heap-data/cart.i [2023-11-29 07:10:19,698 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/data/bcfc9f1ed/1aa440439c4e4d55aab1a734c06710d6/FLAG6e497dab8 [2023-11-29 07:10:19,715 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/data/bcfc9f1ed/1aa440439c4e4d55aab1a734c06710d6 [2023-11-29 07:10:19,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 07:10:19,720 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 07:10:19,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 07:10:19,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 07:10:19,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 07:10:19,728 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:10:19" (1/1) ... [2023-11-29 07:10:19,729 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b0e2468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:19, skipping insertion in model container [2023-11-29 07:10:19,729 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:10:19" (1/1) ... [2023-11-29 07:10:19,784 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 07:10:20,105 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/sv-benchmarks/c/heap-data/cart.i[23713,23726] [2023-11-29 07:10:20,110 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:10:20,142 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 07:10:20,186 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/sv-benchmarks/c/heap-data/cart.i[23713,23726] [2023-11-29 07:10:20,187 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:10:20,224 INFO L206 MainTranslator]: Completed translation [2023-11-29 07:10:20,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:20 WrapperNode [2023-11-29 07:10:20,225 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 07:10:20,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 07:10:20,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 07:10:20,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 07:10:20,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:20" (1/1) ... [2023-11-29 07:10:20,251 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:20" (1/1) ... [2023-11-29 07:10:20,273 INFO L138 Inliner]: procedures = 124, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 79 [2023-11-29 07:10:20,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 07:10:20,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 07:10:20,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 07:10:20,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 07:10:20,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:20" (1/1) ... [2023-11-29 07:10:20,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:20" (1/1) ... [2023-11-29 07:10:20,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:20" (1/1) ... [2023-11-29 07:10:20,306 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 7, 11]. 55 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 5 writes are split as follows [0, 0, 5]. [2023-11-29 07:10:20,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:20" (1/1) ... [2023-11-29 07:10:20,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:20" (1/1) ... [2023-11-29 07:10:20,318 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:20" (1/1) ... [2023-11-29 07:10:20,322 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:20" (1/1) ... [2023-11-29 07:10:20,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:20" (1/1) ... [2023-11-29 07:10:20,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:20" (1/1) ... [2023-11-29 07:10:20,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 07:10:20,334 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 07:10:20,334 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 07:10:20,334 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 07:10:20,335 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:20" (1/1) ... [2023-11-29 07:10:20,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:10:20,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:10:20,368 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 07:10:20,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 07:10:20,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 07:10:20,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 07:10:20,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 07:10:20,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 07:10:20,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 07:10:20,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 07:10:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 07:10:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 07:10:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 07:10:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 07:10:20,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 07:10:20,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 07:10:20,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 07:10:20,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 07:10:20,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 07:10:20,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 07:10:20,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 07:10:20,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 07:10:20,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 07:10:20,548 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 07:10:20,550 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 07:10:20,809 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 07:10:20,836 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 07:10:20,836 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 07:10:20,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:10:20 BoogieIcfgContainer [2023-11-29 07:10:20,837 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 07:10:20,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 07:10:20,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 07:10:20,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 07:10:20,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:10:19" (1/3) ... [2023-11-29 07:10:20,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f77792e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:10:20, skipping insertion in model container [2023-11-29 07:10:20,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:10:20" (2/3) ... [2023-11-29 07:10:20,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f77792e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:10:20, skipping insertion in model container [2023-11-29 07:10:20,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:10:20" (3/3) ... [2023-11-29 07:10:20,861 INFO L112 eAbstractionObserver]: Analyzing ICFG cart.i [2023-11-29 07:10:20,883 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 07:10:20,883 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 07:10:20,936 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 07:10:20,944 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@31c851d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 07:10:20,944 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 07:10:20,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:10:20,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 07:10:20,956 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:10:20,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:10:20,957 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:10:20,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:10:20,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1487606993, now seen corresponding path program 1 times [2023-11-29 07:10:20,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:10:20,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778003920] [2023-11-29 07:10:20,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:10:20,979 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:10:20,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:10:20,980 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:10:20,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 07:10:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:21,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 07:10:21,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:10:21,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:10:21,120 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:10:21,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:10:21,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778003920] [2023-11-29 07:10:21,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778003920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:10:21,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:10:21,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:10:21,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589514906] [2023-11-29 07:10:21,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:10:21,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 07:10:21,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:10:21,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 07:10:21,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 07:10:21,168 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:10:21,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:10:21,192 INFO L93 Difference]: Finished difference Result 31 states and 46 transitions. [2023-11-29 07:10:21,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 07:10:21,195 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 07:10:21,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:10:21,203 INFO L225 Difference]: With dead ends: 31 [2023-11-29 07:10:21,203 INFO L226 Difference]: Without dead ends: 16 [2023-11-29 07:10:21,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 07:10:21,210 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:10:21,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:10:21,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-11-29 07:10:21,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-11-29 07:10:21,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:10:21,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2023-11-29 07:10:21,245 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 8 [2023-11-29 07:10:21,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:10:21,245 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2023-11-29 07:10:21,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:10:21,246 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2023-11-29 07:10:21,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 07:10:21,247 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:10:21,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:10:21,252 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 07:10:21,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:10:21,448 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:10:21,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:10:21,449 INFO L85 PathProgramCache]: Analyzing trace with hash -2098913187, now seen corresponding path program 1 times [2023-11-29 07:10:21,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:10:21,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318826978] [2023-11-29 07:10:21,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:10:21,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:10:21,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:10:21,452 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:10:21,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 07:10:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:21,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 07:10:21,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:10:21,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:10:21,664 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:10:21,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:10:21,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318826978] [2023-11-29 07:10:21,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318826978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:10:21,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:10:21,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:10:21,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609625817] [2023-11-29 07:10:21,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:10:21,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 07:10:21,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:10:21,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 07:10:21,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 07:10:21,668 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:10:21,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:10:21,878 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2023-11-29 07:10:21,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 07:10:21,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 07:10:21,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:10:21,880 INFO L225 Difference]: With dead ends: 35 [2023-11-29 07:10:21,880 INFO L226 Difference]: Without dead ends: 20 [2023-11-29 07:10:21,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:10:21,882 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:10:21,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 44 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 07:10:21,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-29 07:10:21,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-29 07:10:21,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:10:21,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2023-11-29 07:10:21,888 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 11 [2023-11-29 07:10:21,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:10:21,889 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2023-11-29 07:10:21,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:10:21,889 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2023-11-29 07:10:21,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 07:10:21,890 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:10:21,890 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:10:21,893 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 07:10:22,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:10:22,094 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:10:22,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:10:22,095 INFO L85 PathProgramCache]: Analyzing trace with hash -2087693085, now seen corresponding path program 1 times [2023-11-29 07:10:22,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:10:22,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [708152145] [2023-11-29 07:10:22,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:10:22,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:10:22,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:10:22,098 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:10:22,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 07:10:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:22,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 07:10:22,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:10:22,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:10:22,250 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:10:22,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:10:22,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [708152145] [2023-11-29 07:10:22,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [708152145] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:10:22,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:10:22,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 07:10:22,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000835633] [2023-11-29 07:10:22,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:10:22,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 07:10:22,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:10:22,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 07:10:22,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 07:10:22,254 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:10:22,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:10:22,477 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2023-11-29 07:10:22,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 07:10:22,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 07:10:22,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:10:22,478 INFO L225 Difference]: With dead ends: 35 [2023-11-29 07:10:22,479 INFO L226 Difference]: Without dead ends: 29 [2023-11-29 07:10:22,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:10:22,480 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 35 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:10:22,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 37 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 07:10:22,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-29 07:10:22,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2023-11-29 07:10:22,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:10:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2023-11-29 07:10:22,486 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 15 [2023-11-29 07:10:22,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:10:22,486 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2023-11-29 07:10:22,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:10:22,486 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2023-11-29 07:10:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 07:10:22,487 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:10:22,488 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:10:22,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 07:10:22,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:10:22,688 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:10:22,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:10:22,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1239572016, now seen corresponding path program 1 times [2023-11-29 07:10:22,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:10:22,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810364209] [2023-11-29 07:10:22,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:10:22,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:10:22,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:10:22,692 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:10:22,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 07:10:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:22,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 07:10:22,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:10:22,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 07:10:22,797 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:10:22,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:10:22,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810364209] [2023-11-29 07:10:22,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810364209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:10:22,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:10:22,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:10:22,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103649009] [2023-11-29 07:10:22,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:10:22,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:10:22,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:10:22,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:10:22,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:10:22,801 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:10:22,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:10:22,851 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2023-11-29 07:10:22,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:10:22,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-29 07:10:22,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:10:22,856 INFO L225 Difference]: With dead ends: 36 [2023-11-29 07:10:22,856 INFO L226 Difference]: Without dead ends: 26 [2023-11-29 07:10:22,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:10:22,857 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:10:22,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:10:22,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-29 07:10:22,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-29 07:10:22,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:10:22,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2023-11-29 07:10:22,864 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 19 [2023-11-29 07:10:22,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:10:22,864 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2023-11-29 07:10:22,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:10:22,865 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2023-11-29 07:10:22,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 07:10:22,866 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:10:22,866 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:10:22,869 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 07:10:23,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:10:23,070 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:10:23,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:10:23,071 INFO L85 PathProgramCache]: Analyzing trace with hash 430225390, now seen corresponding path program 1 times [2023-11-29 07:10:23,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:10:23,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195547511] [2023-11-29 07:10:23,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:10:23,072 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:10:23,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:10:23,073 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:10:23,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 07:10:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:23,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 07:10:23,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:10:23,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 20 [2023-11-29 07:10:23,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:10:23,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 15 [2023-11-29 07:10:23,628 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 07:10:23,629 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:10:23,972 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-29 07:10:23,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1036 treesize of output 755 [2023-11-29 07:10:24,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 07:10:24,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:10:24,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195547511] [2023-11-29 07:10:24,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195547511] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:10:24,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:10:24,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-11-29 07:10:24,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699116598] [2023-11-29 07:10:24,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:10:24,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 07:10:24,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:10:24,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 07:10:24,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-11-29 07:10:24,410 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:10:44,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:10:44,062 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2023-11-29 07:10:44,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 07:10:44,063 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-29 07:10:44,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:10:44,064 INFO L225 Difference]: With dead ends: 48 [2023-11-29 07:10:44,064 INFO L226 Difference]: Without dead ends: 46 [2023-11-29 07:10:44,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=110, Invalid=306, Unknown=4, NotChecked=0, Total=420 [2023-11-29 07:10:44,066 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 67 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 07:10:44,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 144 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 07:10:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-29 07:10:44,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2023-11-29 07:10:44,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:10:44,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2023-11-29 07:10:44,075 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 19 [2023-11-29 07:10:44,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:10:44,075 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2023-11-29 07:10:44,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:10:44,075 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2023-11-29 07:10:44,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 07:10:44,076 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:10:44,076 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:10:44,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 07:10:44,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:10:44,278 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:10:44,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:10:44,279 INFO L85 PathProgramCache]: Analyzing trace with hash 666078984, now seen corresponding path program 1 times [2023-11-29 07:10:44,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:10:44,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979800908] [2023-11-29 07:10:44,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:10:44,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:10:44,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:10:44,281 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:10:44,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 07:10:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:44,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 07:10:44,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:10:44,532 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 07:10:44,532 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:10:44,656 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 07:10:44,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2023-11-29 07:10:44,676 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-29 07:10:44,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 07:10:44,705 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 07:10:44,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:10:44,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979800908] [2023-11-29 07:10:44,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [979800908] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:10:44,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:10:44,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2023-11-29 07:10:44,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005243104] [2023-11-29 07:10:44,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:10:44,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 07:10:44,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:10:44,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 07:10:44,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 07:10:44,707 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:10:45,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:10:45,293 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2023-11-29 07:10:45,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 07:10:45,293 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-29 07:10:45,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:10:45,294 INFO L225 Difference]: With dead ends: 58 [2023-11-29 07:10:45,295 INFO L226 Difference]: Without dead ends: 48 [2023-11-29 07:10:45,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-29 07:10:45,296 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 47 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 07:10:45,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 93 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 07:10:45,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-29 07:10:45,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2023-11-29 07:10:45,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:10:45,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2023-11-29 07:10:45,305 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 22 [2023-11-29 07:10:45,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:10:45,306 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2023-11-29 07:10:45,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:10:45,306 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2023-11-29 07:10:45,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 07:10:45,307 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:10:45,307 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:10:45,310 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 07:10:45,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:10:45,508 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:10:45,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:10:45,508 INFO L85 PathProgramCache]: Analyzing trace with hash -110453383, now seen corresponding path program 2 times [2023-11-29 07:10:45,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:10:45,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508718463] [2023-11-29 07:10:45,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 07:10:45,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:10:45,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:10:45,510 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:10:45,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 07:10:45,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 07:10:45,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:10:45,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 07:10:45,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:10:45,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 07:10:45,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 07:10:45,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-11-29 07:10:45,872 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:10:45,872 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:10:45,984 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:10:45,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:10:45,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508718463] [2023-11-29 07:10:45,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508718463] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:10:45,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:10:45,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2023-11-29 07:10:45,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690816730] [2023-11-29 07:10:45,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:10:45,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:10:45,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:10:45,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:10:45,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:10:45,993 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:10:46,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:10:46,635 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2023-11-29 07:10:46,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:10:46,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-29 07:10:46,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:10:46,636 INFO L225 Difference]: With dead ends: 66 [2023-11-29 07:10:46,636 INFO L226 Difference]: Without dead ends: 39 [2023-11-29 07:10:46,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 07:10:46,638 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 07:10:46,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 80 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 07:10:46,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-29 07:10:46,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-11-29 07:10:46,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:10:46,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2023-11-29 07:10:46,644 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 23 [2023-11-29 07:10:46,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:10:46,644 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2023-11-29 07:10:46,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:10:46,645 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2023-11-29 07:10:46,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 07:10:46,645 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:10:46,645 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:10:46,650 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 07:10:46,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:10:46,846 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:10:46,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:10:46,847 INFO L85 PathProgramCache]: Analyzing trace with hash -948094721, now seen corresponding path program 3 times [2023-11-29 07:10:46,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:10:46,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629657073] [2023-11-29 07:10:46,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 07:10:46,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:10:46,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:10:46,848 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:10:46,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 07:10:47,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 07:10:47,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:10:47,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 07:10:47,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:10:47,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 07:10:47,186 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 07:10:47,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2023-11-29 07:10:47,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 07:10:47,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2023-11-29 07:10:47,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-11-29 07:10:47,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 20 [2023-11-29 07:10:47,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-11-29 07:10:47,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:10:47,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 15 [2023-11-29 07:10:47,672 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:10:47,673 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:10:47,842 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_220 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_220) |c_ULTIMATE.start_main_~l~0#1.base|))) (bvsgt (select .cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~l~0#1.offset|)))))) is different from false [2023-11-29 07:10:48,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:10:48,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 54 [2023-11-29 07:10:48,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:10:48,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 90 [2023-11-29 07:10:48,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2023-11-29 07:10:48,778 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-29 07:10:48,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:10:48,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629657073] [2023-11-29 07:10:48,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629657073] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:10:48,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:10:48,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2023-11-29 07:10:48,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915281274] [2023-11-29 07:10:48,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:10:48,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 07:10:48,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:10:48,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 07:10:48,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=194, Unknown=5, NotChecked=28, Total=272 [2023-11-29 07:10:48,781 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:11:02,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:11:02,255 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2023-11-29 07:11:02,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 07:11:02,256 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-29 07:11:02,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:11:02,257 INFO L225 Difference]: With dead ends: 65 [2023-11-29 07:11:02,257 INFO L226 Difference]: Without dead ends: 60 [2023-11-29 07:11:02,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=188, Invalid=565, Unknown=7, NotChecked=52, Total=812 [2023-11-29 07:11:02,258 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 127 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-11-29 07:11:02,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 245 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 220 Invalid, 0 Unknown, 61 Unchecked, 4.4s Time] [2023-11-29 07:11:02,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-29 07:11:02,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2023-11-29 07:11:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:11:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2023-11-29 07:11:02,266 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 27 [2023-11-29 07:11:02,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:11:02,266 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2023-11-29 07:11:02,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:11:02,266 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2023-11-29 07:11:02,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 07:11:02,267 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:11:02,267 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:11:02,274 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 07:11:02,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:11:02,468 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:11:02,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:02,468 INFO L85 PathProgramCache]: Analyzing trace with hash -980998057, now seen corresponding path program 2 times [2023-11-29 07:11:02,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:11:02,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328551467] [2023-11-29 07:11:02,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 07:11:02,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:11:02,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:11:02,470 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:11:02,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 07:11:02,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 07:11:02,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:11:02,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-29 07:11:02,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:11:02,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 07:11:02,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 07:11:02,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 07:11:02,779 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 07:11:02,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2023-11-29 07:11:02,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2023-11-29 07:11:02,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2023-11-29 07:11:03,308 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:11:03,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 94 [2023-11-29 07:11:03,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 07:11:03,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 24 [2023-11-29 07:11:03,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2023-11-29 07:11:03,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 07:11:03,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:11:03,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2023-11-29 07:11:03,656 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:11:03,656 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:11:04,202 INFO L349 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2023-11-29 07:11:04,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1056 treesize of output 821 [2023-11-29 07:11:04,739 WARN L854 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_main_#t~short8#1| (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse2 (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~i~0#1.base| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))) (and (forall ((v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_288) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (bvadd .cse0 (_ bv4 32)) |c_ULTIMATE.start_main_~i~0#1.offset|) (= .cse0 .cse1) (= .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|)))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~i~0#1.base| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (forall ((v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_288) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse1))) .cse2 (= (_ bv2147483647 32) |c_ULTIMATE.start_main_~order~0#1|)) (or (forall ((v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_288) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) (_ bv4 32)) |c_ULTIMATE.start_main_~i~0#1.offset|))) .cse2)))) is different from false [2023-11-29 07:11:04,835 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse1 (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~i~0#1.base| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))) (and (or (forall ((v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_288) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse0))) .cse1) (forall ((v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_288) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (bvadd .cse2 (_ bv4 32)) |c_ULTIMATE.start_main_~i~0#1.offset|) (= .cse2 .cse0) (= .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|)))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~i~0#1.base| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (forall ((v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_288) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) (_ bv4 32)) |c_ULTIMATE.start_main_~i~0#1.offset|))) .cse1))) is different from false [2023-11-29 07:11:05,460 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1.offset|))) (and (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_286 (store (store .cse0 .cse1 (select v_ArrVal_286 .cse1)) .cse2 (select v_ArrVal_286 .cse2)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select v_ArrVal_284 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (not (= v_ArrVal_284 (store (store .cse3 .cse1 (select v_ArrVal_284 .cse1)) .cse2 (select v_ArrVal_284 .cse2)))) (forall ((v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_286) .cse4 v_ArrVal_288) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) (bvadd (_ bv4 32) (select v_ArrVal_286 |c_ULTIMATE.start_main_~i~0#1.offset|))))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= .cse4 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_284) .cse4 v_ArrVal_287) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))))))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_286 (store (store .cse0 .cse1 (select v_ArrVal_286 .cse1)) .cse2 (select v_ArrVal_286 .cse2)))) (forall ((v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_286) (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_288) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse6 (select v_ArrVal_286 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (= (bvadd (_ bv4 32) .cse5) .cse6) (= .cse5 (bvadd (_ bv4 32) .cse6)) (= .cse5 .cse6)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse7 (select v_ArrVal_284 |c_ULTIMATE.start_main_~i~0#1.offset|))) (= .cse7 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_284) .cse7 v_ArrVal_287) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (not (= v_ArrVal_284 (store (store .cse3 .cse1 (select v_ArrVal_284 .cse1)) .cse2 (select v_ArrVal_284 .cse2)))))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_286 (store (store .cse0 .cse1 (select v_ArrVal_286 .cse1)) .cse2 (select v_ArrVal_286 .cse2)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select v_ArrVal_284 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (forall ((v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select v_ArrVal_286 |c_ULTIMATE.start_main_~i~0#1.offset|) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_286) .cse8 v_ArrVal_288) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))) (not (= v_ArrVal_284 (store (store .cse3 .cse1 (select v_ArrVal_284 .cse1)) .cse2 (select v_ArrVal_284 .cse2)))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= .cse8 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_284) .cse8 v_ArrVal_287) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))))))))) is different from false [2023-11-29 07:11:06,248 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~l~0#1.offset|))) (and (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_ArrVal_284 |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (forall ((v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select v_ArrVal_286 |c_ULTIMATE.start_main_~l~0#1.offset|) (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_286) .cse0 v_ArrVal_288) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) (_ bv4 32))))) (not (= v_ArrVal_284 (store (store .cse1 .cse2 (select v_ArrVal_284 .cse2)) .cse3 (select v_ArrVal_284 .cse3)))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= .cse0 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_284) .cse0 v_ArrVal_287) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))))) (not (= (store (store .cse4 .cse2 (select v_ArrVal_286 .cse2)) .cse3 (select v_ArrVal_286 .cse3)) v_ArrVal_286)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store (store .cse4 .cse2 (select v_ArrVal_286 .cse2)) .cse3 (select v_ArrVal_286 .cse3)) v_ArrVal_286)) (forall ((v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select v_ArrVal_286 |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse6 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_286) (select .cse1 |c_ULTIMATE.start_main_~l~0#1.offset|) v_ArrVal_288) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= .cse5 (bvadd (_ bv4 32) .cse6)) (= .cse6 (bvadd .cse5 (_ bv4 32))) (= .cse5 .cse6)))))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select v_ArrVal_284 |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (forall ((v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_286) .cse7 v_ArrVal_288) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) (bvadd (select v_ArrVal_286 |c_ULTIMATE.start_main_~l~0#1.offset|) (_ bv4 32))))) (not (= v_ArrVal_284 (store (store .cse1 .cse2 (select v_ArrVal_284 .cse2)) .cse3 (select v_ArrVal_284 .cse3)))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= .cse7 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_284) .cse7 v_ArrVal_287) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))))) (not (= (store (store .cse4 .cse2 (select v_ArrVal_286 .cse2)) .cse3 (select v_ArrVal_286 .cse3)) v_ArrVal_286)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_284 (store (store .cse1 .cse2 (select v_ArrVal_284 .cse2)) .cse3 (select v_ArrVal_284 .cse3)))) (let ((.cse8 (select v_ArrVal_284 |c_ULTIMATE.start_main_~l~0#1.offset|))) (= .cse8 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_284) .cse8 v_ArrVal_287) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))))) is different from false [2023-11-29 07:11:06,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 239 [2023-11-29 07:11:06,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 229 [2023-11-29 07:11:06,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:11:06,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 197 treesize of output 282 [2023-11-29 07:11:07,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:11:07,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 158 treesize of output 243 [2023-11-29 07:11:07,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 117 [2023-11-29 07:11:07,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 115 [2023-11-29 07:11:07,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 113 [2023-11-29 07:11:07,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 107 [2023-11-29 07:11:07,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 105 [2023-11-29 07:11:07,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 103 [2023-11-29 07:11:08,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:11:08,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:11:08,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:11:08,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:11:08,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 07:11:08,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 17 [2023-11-29 07:11:08,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 07:11:08,673 INFO L378 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 34 treesize of output 11 [2023-11-29 07:11:08,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 07:11:08,745 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-11-29 07:11:08,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:11:08,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328551467] [2023-11-29 07:11:08,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328551467] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:11:08,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:11:08,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2023-11-29 07:11:08,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558452871] [2023-11-29 07:11:08,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:11:08,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 07:11:08,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:11:08,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 07:11:08,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=263, Unknown=5, NotChecked=140, Total=462 [2023-11-29 07:11:08,749 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand has 22 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:11:25,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:11:25,147 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2023-11-29 07:11:25,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 07:11:25,148 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-29 07:11:25,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:11:25,149 INFO L225 Difference]: With dead ends: 59 [2023-11-29 07:11:25,149 INFO L226 Difference]: Without dead ends: 57 [2023-11-29 07:11:25,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=181, Invalid=740, Unknown=25, NotChecked=244, Total=1190 [2023-11-29 07:11:25,151 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 125 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 236 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:11:25,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 308 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 303 Invalid, 0 Unknown, 236 Unchecked, 5.1s Time] [2023-11-29 07:11:25,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-29 07:11:25,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2023-11-29 07:11:25,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.32) internal successors, (66), 50 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:11:25,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2023-11-29 07:11:25,164 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 30 [2023-11-29 07:11:25,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:11:25,164 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2023-11-29 07:11:25,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:11:25,164 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2023-11-29 07:11:25,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 07:11:25,165 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:11:25,165 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:11:25,170 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 07:11:25,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:11:25,366 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:11:25,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:25,366 INFO L85 PathProgramCache]: Analyzing trace with hash 369765898, now seen corresponding path program 4 times [2023-11-29 07:11:25,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:11:25,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724863408] [2023-11-29 07:11:25,367 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 07:11:25,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:11:25,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:11:25,368 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:11:25,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 07:11:25,629 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 07:11:25,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:11:25,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-29 07:11:25,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:11:25,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 07:11:25,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 07:11:25,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 07:11:25,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-29 07:11:25,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-29 07:11:25,841 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 07:11:25,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2023-11-29 07:11:25,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 07:11:25,913 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 07:11:25,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2023-11-29 07:11:25,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 07:11:25,957 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 07:11:25,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2023-11-29 07:11:26,313 INFO L349 Elim1Store]: treesize reduction 121, result has 8.3 percent of original size [2023-11-29 07:11:26,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 40 [2023-11-29 07:11:26,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 36 [2023-11-29 07:11:26,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 36 [2023-11-29 07:11:26,602 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2023-11-29 07:11:26,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 190 treesize of output 165 [2023-11-29 07:11:26,620 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 07:11:26,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 121 [2023-11-29 07:11:26,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 73 [2023-11-29 07:11:26,701 INFO L349 Elim1Store]: treesize reduction 82, result has 7.9 percent of original size [2023-11-29 07:11:26,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 85 [2023-11-29 07:11:26,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 41 [2023-11-29 07:11:26,784 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:11:26,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:11:27,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:11:27,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 57 [2023-11-29 07:11:27,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:11:27,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 44 [2023-11-29 07:11:27,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 07:11:27,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 07:11:28,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:11:28,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2023-11-29 07:11:28,282 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:11:28,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2023-11-29 07:11:28,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:11:28,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-11-29 07:11:28,307 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:11:28,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2023-11-29 07:11:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:11:28,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:11:28,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724863408] [2023-11-29 07:11:28,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724863408] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:11:28,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:11:28,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-11-29 07:11:28,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291590227] [2023-11-29 07:11:28,339 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:11:28,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 07:11:28,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:11:28,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 07:11:28,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=106, Unknown=1, NotChecked=0, Total=132 [2023-11-29 07:11:28,341 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:11:32,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:11:32,917 INFO L93 Difference]: Finished difference Result 87 states and 115 transitions. [2023-11-29 07:11:32,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 07:11:32,918 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 07:11:32,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:11:32,918 INFO L225 Difference]: With dead ends: 87 [2023-11-29 07:11:32,918 INFO L226 Difference]: Without dead ends: 68 [2023-11-29 07:11:32,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=31, Invalid=124, Unknown=1, NotChecked=0, Total=156 [2023-11-29 07:11:32,920 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 23 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-11-29 07:11:32,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 206 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-11-29 07:11:32,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-29 07:11:32,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-29 07:11:32,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.328358208955224) internal successors, (89), 67 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:11:32,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 89 transitions. [2023-11-29 07:11:32,930 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 89 transitions. Word has length 31 [2023-11-29 07:11:32,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:11:32,930 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 89 transitions. [2023-11-29 07:11:32,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:11:32,931 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 89 transitions. [2023-11-29 07:11:32,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 07:11:32,932 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:11:32,932 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:11:32,937 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 07:11:33,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:11:33,133 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:11:33,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:33,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1951737345, now seen corresponding path program 3 times [2023-11-29 07:11:33,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:11:33,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600250460] [2023-11-29 07:11:33,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 07:11:33,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:11:33,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:11:33,135 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:11:33,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcdd2d92-83e5-4671-9d10-da69caed20de/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 07:11:33,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 07:11:33,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:11:33,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 07:11:33,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:11:33,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 07:11:33,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 07:11:33,444 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 07:11:33,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2023-11-29 07:11:33,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 12 [2023-11-29 07:11:33,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 07:11:33,708 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:11:33,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 64 [2023-11-29 07:11:33,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 32 [2023-11-29 07:11:34,154 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:11:34,154 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:11:35,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:11:35,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1579 treesize of output 1513 [2023-11-29 07:11:36,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:11:36,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 785 treesize of output 843 [2023-11-29 07:11:36,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:11:36,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 795 treesize of output 839 [2023-11-29 07:11:36,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:11:36,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 683 treesize of output 686