./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-data/process_queue.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff 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_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-data/process_queue.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu --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 1ad9f94c1d10f7bc5f4235ca7c5dc51413b43a0e6c48b9e48da5d2e3e751252c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:40:29,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:40:29,105 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:40:29,110 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:40:29,111 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:40:29,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:40:29,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:40:29,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:40:29,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:40:29,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:40:29,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:40:29,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:40:29,139 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:40:29,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:40:29,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:40:29,141 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:40:29,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:40:29,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:40:29,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:40:29,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:40:29,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:40:29,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:40:29,145 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:40:29,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:40:29,148 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:40:29,149 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:40:29,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:40:29,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:40:29,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:40:29,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:40:29,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:40:29,156 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:40:29,157 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:40:29,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:40:29,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:40:29,159 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:40:29,159 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:40:29,159 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:40:29,159 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:40:29,160 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_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/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_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu 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 -> 1ad9f94c1d10f7bc5f4235ca7c5dc51413b43a0e6c48b9e48da5d2e3e751252c [2023-11-19 07:40:29,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:40:29,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:40:29,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:40:29,540 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:40:29,541 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:40:29,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/heap-data/process_queue.i [2023-11-19 07:40:32,864 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:40:33,219 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:40:33,220 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/sv-benchmarks/c/heap-data/process_queue.i [2023-11-19 07:40:33,236 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/data/06f2e5c6b/067ed27dbaf34e4c81d1d3b22e209e13/FLAGac2ff230c [2023-11-19 07:40:33,251 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/data/06f2e5c6b/067ed27dbaf34e4c81d1d3b22e209e13 [2023-11-19 07:40:33,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:40:33,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:40:33,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:40:33,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:40:33,263 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:40:33,264 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:40:33" (1/1) ... [2023-11-19 07:40:33,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60ad1159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:33, skipping insertion in model container [2023-11-19 07:40:33,266 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:40:33" (1/1) ... [2023-11-19 07:40:33,306 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:40:33,691 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_e8341aec-ec5d-4957-a870-90bf63604ed0/sv-benchmarks/c/heap-data/process_queue.i[23979,23992] [2023-11-19 07:40:33,713 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:40:33,725 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:40:33,792 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_e8341aec-ec5d-4957-a870-90bf63604ed0/sv-benchmarks/c/heap-data/process_queue.i[23979,23992] [2023-11-19 07:40:33,796 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:40:33,838 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:40:33,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:33 WrapperNode [2023-11-19 07:40:33,839 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:40:33,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:40:33,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:40:33,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:40:33,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:33" (1/1) ... [2023-11-19 07:40:33,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:33" (1/1) ... [2023-11-19 07:40:33,922 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 117 [2023-11-19 07:40:33,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:40:33,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:40:33,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:40:33,924 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:40:33,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:33" (1/1) ... [2023-11-19 07:40:33,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:33" (1/1) ... [2023-11-19 07:40:33,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:33" (1/1) ... [2023-11-19 07:40:33,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:33" (1/1) ... [2023-11-19 07:40:33,952 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:33" (1/1) ... [2023-11-19 07:40:33,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:33" (1/1) ... [2023-11-19 07:40:33,966 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:33" (1/1) ... [2023-11-19 07:40:33,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:33" (1/1) ... [2023-11-19 07:40:33,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:40:33,973 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:40:33,974 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:40:33,974 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:40:33,980 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:33" (1/1) ... [2023-11-19 07:40:33,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:40:34,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:40:34,020 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:40:34,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:40:34,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:40:34,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:40:34,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 07:40:34,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:40:34,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:40:34,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 07:40:34,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 07:40:34,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:40:34,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 07:40:34,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:40:34,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:40:34,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:40:34,246 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:40:34,248 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:40:34,571 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:40:34,579 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:40:34,579 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-19 07:40:34,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:40:34 BoogieIcfgContainer [2023-11-19 07:40:34,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:40:34,586 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:40:34,586 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:40:34,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:40:34,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:40:33" (1/3) ... [2023-11-19 07:40:34,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c2227b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:40:34, skipping insertion in model container [2023-11-19 07:40:34,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:33" (2/3) ... [2023-11-19 07:40:34,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c2227b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:40:34, skipping insertion in model container [2023-11-19 07:40:34,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:40:34" (3/3) ... [2023-11-19 07:40:34,596 INFO L112 eAbstractionObserver]: Analyzing ICFG process_queue.i [2023-11-19 07:40:34,618 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:40:34,619 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:40:34,684 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:40:34,692 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;@3f1df64d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:40:34,693 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:40:34,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.52) internal successors, (38), 26 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-19 07:40:34,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 07:40:34,707 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:34,708 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:34,708 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:34,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:34,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2060272908, now seen corresponding path program 1 times [2023-11-19 07:40:34,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:34,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871134596] [2023-11-19 07:40:34,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:34,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:35,116 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-19 07:40:35,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:35,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871134596] [2023-11-19 07:40:35,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871134596] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:35,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:35,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:40:35,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682172318] [2023-11-19 07:40:35,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:35,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:40:35,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:35,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:40:35,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:40:35,163 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.52) internal successors, (38), 26 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) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:35,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:35,206 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2023-11-19 07:40:35,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:40:35,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-19 07:40:35,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:35,218 INFO L225 Difference]: With dead ends: 53 [2023-11-19 07:40:35,218 INFO L226 Difference]: Without dead ends: 24 [2023-11-19 07:40:35,221 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-19 07:40:35,226 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 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-19 07:40:35,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:40:35,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-19 07:40:35,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-19 07:40:35,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:35,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-11-19 07:40:35,265 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 11 [2023-11-19 07:40:35,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:35,266 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-11-19 07:40:35,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:35,266 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-11-19 07:40:35,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 07:40:35,267 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:35,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:35,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:40:35,268 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:35,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:35,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1911586027, now seen corresponding path program 1 times [2023-11-19 07:40:35,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:35,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005165891] [2023-11-19 07:40:35,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:35,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:35,464 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-19 07:40:35,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:35,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005165891] [2023-11-19 07:40:35,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005165891] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:35,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:35,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:40:35,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885979506] [2023-11-19 07:40:35,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:35,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:40:35,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:35,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:40:35,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:40:35,473 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-19 07:40:35,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:35,555 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2023-11-19 07:40:35,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:40:35,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-19 07:40:35,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:35,557 INFO L225 Difference]: With dead ends: 59 [2023-11-19 07:40:35,558 INFO L226 Difference]: Without dead ends: 37 [2023-11-19 07:40:35,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-19 07:40:35,561 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:40:35,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 91 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:40:35,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-19 07:40:35,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2023-11-19 07:40:35,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 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-19 07:40:35,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2023-11-19 07:40:35,574 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 11 [2023-11-19 07:40:35,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:35,574 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2023-11-19 07:40:35,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-19 07:40:35,575 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2023-11-19 07:40:35,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 07:40:35,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:35,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:35,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:40:35,577 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:35,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:35,580 INFO L85 PathProgramCache]: Analyzing trace with hash 459687026, now seen corresponding path program 1 times [2023-11-19 07:40:35,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:35,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285468870] [2023-11-19 07:40:35,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:35,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:36,619 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-19 07:40:36,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:36,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285468870] [2023-11-19 07:40:36,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285468870] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:36,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:36,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:40:36,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300399557] [2023-11-19 07:40:36,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:36,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:40:36,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:36,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:40:36,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:40:36,623 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-19 07:40:36,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:36,863 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2023-11-19 07:40:36,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:40:36,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-19 07:40:36,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:36,867 INFO L225 Difference]: With dead ends: 64 [2023-11-19 07:40:36,867 INFO L226 Difference]: Without dead ends: 62 [2023-11-19 07:40:36,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:40:36,870 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 41 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:40:36,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 103 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:40:36,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-19 07:40:36,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2023-11-19 07:40:36,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 71 transitions. [2023-11-19 07:40:36,889 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 71 transitions. Word has length 11 [2023-11-19 07:40:36,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:36,889 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 71 transitions. [2023-11-19 07:40:36,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-19 07:40:36,890 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2023-11-19 07:40:36,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 07:40:36,890 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:36,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:36,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:40:36,891 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:36,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:36,892 INFO L85 PathProgramCache]: Analyzing trace with hash 608373907, now seen corresponding path program 1 times [2023-11-19 07:40:36,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:36,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323715452] [2023-11-19 07:40:36,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:36,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:36,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:40:36,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:37,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323715452] [2023-11-19 07:40:37,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323715452] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:37,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:37,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:40:37,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985421398] [2023-11-19 07:40:37,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:37,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:40:37,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:37,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:40:37,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:40:37,005 INFO L87 Difference]: Start difference. First operand 54 states and 71 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-19 07:40:37,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:37,108 INFO L93 Difference]: Finished difference Result 104 states and 137 transitions. [2023-11-19 07:40:37,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:40:37,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-19 07:40:37,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:37,110 INFO L225 Difference]: With dead ends: 104 [2023-11-19 07:40:37,111 INFO L226 Difference]: Without dead ends: 52 [2023-11-19 07:40:37,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:40:37,113 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 75 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-19 07:40:37,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 75 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:40:37,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-19 07:40:37,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-11-19 07:40:37,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:37,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2023-11-19 07:40:37,137 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 11 [2023-11-19 07:40:37,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:37,137 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2023-11-19 07:40:37,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-19 07:40:37,138 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2023-11-19 07:40:37,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 07:40:37,139 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:37,139 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:37,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:40:37,140 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:37,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:37,142 INFO L85 PathProgramCache]: Analyzing trace with hash -2110602732, now seen corresponding path program 1 times [2023-11-19 07:40:37,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:37,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679803598] [2023-11-19 07:40:37,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:37,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:37,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:40:37,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:37,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679803598] [2023-11-19 07:40:37,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679803598] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:40:37,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472029422] [2023-11-19 07:40:37,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:37,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:40:37,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:40:37,904 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:40:37,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:40:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:38,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-19 07:40:38,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:40:38,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:40:38,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:40:38,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2023-11-19 07:40:38,334 INFO L349 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2023-11-19 07:40:38,335 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 28 treesize of output 38 [2023-11-19 07:40:38,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:40:38,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:40:38,364 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 37 treesize of output 32 [2023-11-19 07:40:38,407 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2023-11-19 07:40:38,407 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 32 treesize of output 35 [2023-11-19 07:40:38,426 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 20 treesize of output 1 [2023-11-19 07:40:38,437 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 20 treesize of output 1 [2023-11-19 07:40:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:40:39,330 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:40:39,725 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_122 Int)) (or (forall ((v_ArrVal_119 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~q#1.offset_5| Int) (v_ArrVal_114 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| v_ArrVal_122 (store v_ArrVal_114 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_122 v_ArrVal_114) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5|))))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5| v_ArrVal_122))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse1) .cse2) (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_122 (store v_ArrVal_119 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_122 v_ArrVal_119) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5|))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5| 0) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) 0) (= .cse2 0)))))) (< |c_#StackHeapBarrier| (+ v_ArrVal_122 1)))) (forall ((v_ArrVal_122 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_122 1)) (forall ((v_ArrVal_119 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~q#1.offset_5| Int) (v_ArrVal_114 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| v_ArrVal_122 (store v_ArrVal_119 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_122 v_ArrVal_119) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5|))))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5| 0))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (or (= 0 .cse3) (= (select (select (store .cse4 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse5) (select (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_122 (store v_ArrVal_114 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_122 v_ArrVal_114) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5|))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5| v_ArrVal_122) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ 8 .cse3)) 0)))))))) (forall ((v_ArrVal_122 Int)) (or (forall ((v_ArrVal_119 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~q#1.offset_5| Int) (v_ArrVal_114 (Array Int Int))) (let ((.cse8 (select (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_122 (store v_ArrVal_114 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_122 v_ArrVal_114) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5|))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5| v_ArrVal_122) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (or (= (let ((.cse6 (store |c_#memory_$Pointer$.offset| v_ArrVal_122 (store v_ArrVal_119 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_122 v_ArrVal_119) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5|))))) (let ((.cse7 (store (select .cse6 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5| 0))) (select (select (store .cse6 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse7) .cse8) (+ 8 (select .cse7 |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) 0) (= .cse8 0)))) (< |c_#StackHeapBarrier| (+ v_ArrVal_122 1)))) (forall ((v_ArrVal_122 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_122 1)) (forall ((v_ArrVal_119 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~q#1.offset_5| Int) (v_ArrVal_114 (Array Int Int))) (let ((.cse9 (select (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_122 (store v_ArrVal_119 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_122 v_ArrVal_119) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5|))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5| 0) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (or (= 0 .cse9) (= (select (let ((.cse10 (store |c_#memory_$Pointer$.base| v_ArrVal_122 (store v_ArrVal_114 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_122 v_ArrVal_114) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5|))))) (let ((.cse11 (store (select .cse10 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5| v_ArrVal_122))) (select (store .cse10 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse11) (select .cse11 |c_ULTIMATE.start_main_~#queue~0#1.offset|)))) (+ 8 .cse9)) 0))))))) is different from false [2023-11-19 07:40:40,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:40:40,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472029422] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-19 07:40:40,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:40:40,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 7] total 13 [2023-11-19 07:40:40,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590696890] [2023-11-19 07:40:40,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:40,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:40:40,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:40,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:40:40,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2023-11-19 07:40:40,230 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:42,254 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_122 Int)) (or (forall ((v_ArrVal_119 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~q#1.offset_5| Int) (v_ArrVal_114 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| v_ArrVal_122 (store v_ArrVal_114 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_122 v_ArrVal_114) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5|))))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5| v_ArrVal_122))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse1) .cse2) (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_122 (store v_ArrVal_119 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_122 v_ArrVal_119) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5|))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5| 0) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) 0) (= .cse2 0)))))) (< |c_#StackHeapBarrier| (+ v_ArrVal_122 1)))) (forall ((v_ArrVal_122 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_122 1)) (forall ((v_ArrVal_119 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~q#1.offset_5| Int) (v_ArrVal_114 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| v_ArrVal_122 (store v_ArrVal_119 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_122 v_ArrVal_119) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5|))))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5| 0))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (or (= 0 .cse3) (= (select (select (store .cse4 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse5) (select (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_122 (store v_ArrVal_114 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_122 v_ArrVal_114) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5|))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5| v_ArrVal_122) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ 8 .cse3)) 0)))))))) (forall ((v_ArrVal_122 Int)) (or (forall ((v_ArrVal_119 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~q#1.offset_5| Int) (v_ArrVal_114 (Array Int Int))) (let ((.cse8 (select (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_122 (store v_ArrVal_114 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_122 v_ArrVal_114) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5|))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5| v_ArrVal_122) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (or (= (let ((.cse6 (store |c_#memory_$Pointer$.offset| v_ArrVal_122 (store v_ArrVal_119 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_122 v_ArrVal_119) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5|))))) (let ((.cse7 (store (select .cse6 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5| 0))) (select (select (store .cse6 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse7) .cse8) (+ 8 (select .cse7 |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) 0) (= .cse8 0)))) (< |c_#StackHeapBarrier| (+ v_ArrVal_122 1)))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (or (and (= .cse9 0) (= .cse10 0)) (let ((.cse11 (+ .cse9 8))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse10) .cse11) 0) (= (select (select |c_#memory_$Pointer$.base| .cse10) .cse11) 0))))) (forall ((v_ArrVal_122 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_122 1)) (forall ((v_ArrVal_119 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~q#1.offset_5| Int) (v_ArrVal_114 (Array Int Int))) (let ((.cse12 (select (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_122 (store v_ArrVal_119 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_122 v_ArrVal_119) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5|))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5| 0) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (or (= 0 .cse12) (= (select (let ((.cse13 (store |c_#memory_$Pointer$.base| v_ArrVal_122 (store v_ArrVal_114 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_122 v_ArrVal_114) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5|))))) (let ((.cse14 (store (select .cse13 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_5| v_ArrVal_122))) (select (store .cse13 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse14) (select .cse14 |c_ULTIMATE.start_main_~#queue~0#1.offset|)))) (+ 8 .cse12)) 0))))))) is different from false [2023-11-19 07:40:42,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:42,517 INFO L93 Difference]: Finished difference Result 116 states and 154 transitions. [2023-11-19 07:40:42,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:40:42,524 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2023-11-19 07:40:42,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:42,526 INFO L225 Difference]: With dead ends: 116 [2023-11-19 07:40:42,526 INFO L226 Difference]: Without dead ends: 76 [2023-11-19 07:40:42,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=51, Invalid=165, Unknown=2, NotChecked=54, Total=272 [2023-11-19 07:40:42,528 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 20 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:40:42,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 100 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 62 Unchecked, 0.1s Time] [2023-11-19 07:40:42,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-19 07:40:42,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2023-11-19 07:40:42,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 73 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 95 transitions. [2023-11-19 07:40:42,545 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 95 transitions. Word has length 14 [2023-11-19 07:40:42,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:42,546 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 95 transitions. [2023-11-19 07:40:42,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:42,546 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2023-11-19 07:40:42,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 07:40:42,552 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:42,553 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:42,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:40:42,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:40:42,768 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:42,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:42,769 INFO L85 PathProgramCache]: Analyzing trace with hash 233825732, now seen corresponding path program 1 times [2023-11-19 07:40:42,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:42,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417758835] [2023-11-19 07:40:42,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:42,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:43,052 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:40:43,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:43,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417758835] [2023-11-19 07:40:43,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417758835] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:43,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:43,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:40:43,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939011786] [2023-11-19 07:40:43,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:43,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:40:43,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:43,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:40:43,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:40:43,061 INFO L87 Difference]: Start difference. First operand 74 states and 95 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:43,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:43,143 INFO L93 Difference]: Finished difference Result 157 states and 205 transitions. [2023-11-19 07:40:43,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:40:43,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2023-11-19 07:40:43,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:43,146 INFO L225 Difference]: With dead ends: 157 [2023-11-19 07:40:43,146 INFO L226 Difference]: Without dead ends: 100 [2023-11-19 07:40:43,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:40:43,149 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 31 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:40:43,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 76 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:40:43,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-19 07:40:43,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2023-11-19 07:40:43,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.288888888888889) internal successors, (116), 90 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2023-11-19 07:40:43,178 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 116 transitions. Word has length 20 [2023-11-19 07:40:43,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:43,178 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 116 transitions. [2023-11-19 07:40:43,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:43,179 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2023-11-19 07:40:43,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-19 07:40:43,183 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:43,183 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:43,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:40:43,184 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:43,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:43,185 INFO L85 PathProgramCache]: Analyzing trace with hash -10903966, now seen corresponding path program 1 times [2023-11-19 07:40:43,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:43,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114535893] [2023-11-19 07:40:43,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:43,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:44,122 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:40:44,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:44,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114535893] [2023-11-19 07:40:44,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114535893] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:40:44,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985347086] [2023-11-19 07:40:44,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:44,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:40:44,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:40:44,129 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:40:44,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:40:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:44,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-19 07:40:44,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:40:44,436 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:40:44,441 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-19 07:40:44,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:40:44,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2023-11-19 07:40:44,481 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 70 treesize of output 42 [2023-11-19 07:40:44,498 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 1 [2023-11-19 07:40:44,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:40:44,509 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 37 treesize of output 32 [2023-11-19 07:40:44,550 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2023-11-19 07:40:44,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 35 [2023-11-19 07:40:44,567 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 20 treesize of output 1 [2023-11-19 07:40:44,587 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-19 07:40:44,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2023-11-19 07:40:44,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-11-19 07:40:45,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:40:45,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:40:45,675 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 29 treesize of output 26 [2023-11-19 07:40:45,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:40:45,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:40:45,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:40:45,722 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 81 treesize of output 57 [2023-11-19 07:40:45,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:40:45,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:40:45,759 INFO L349 Elim1Store]: treesize reduction 59, result has 7.8 percent of original size [2023-11-19 07:40:45,760 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 78 treesize of output 71 [2023-11-19 07:40:45,798 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2023-11-19 07:40:45,799 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 65 treesize of output 60 [2023-11-19 07:40:45,810 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 20 treesize of output 1 [2023-11-19 07:40:45,836 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-19 07:40:45,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2023-11-19 07:40:45,867 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-19 07:40:45,867 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-19 07:40:45,886 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 1 [2023-11-19 07:40:45,898 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 20 treesize of output 1 [2023-11-19 07:40:46,321 INFO L349 Elim1Store]: treesize reduction 28, result has 56.9 percent of original size [2023-11-19 07:40:46,322 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 122 [2023-11-19 07:40:46,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:40:46,341 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 84 treesize of output 84 [2023-11-19 07:40:46,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:40:46,857 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 55 treesize of output 59 [2023-11-19 07:40:46,992 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:40:46,993 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:40:47,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:40:47,178 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 48 treesize of output 52 [2023-11-19 07:40:47,210 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_303 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~q#1.offset_7| Int) (v_ArrVal_296 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~n#1.base_7| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse0 (select v_ArrVal_296 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_7| 1)) (< 0 (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_ArrVal_296) |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_303) (select (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_append_to_queue_~n#1.base_7| (store v_ArrVal_302 8 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_ArrVal_302) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7|))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ (select (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| 0) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 4))) (not (= (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) 0 (select v_ArrVal_296 0)) 4 .cse0) 8 (select v_ArrVal_296 8)) v_ArrVal_296)) (< .cse0 |c_ULTIMATE.start_main_~next_time~0#1|)))) is different from false [2023-11-19 07:40:47,989 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:40:47,995 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:40:48,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:40:48,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 3537 treesize of output 3545 [2023-11-19 07:40:48,116 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 1559 treesize of output 1447 [2023-11-19 07:40:48,155 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 10 treesize of output 8 [2023-11-19 07:40:48,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:40:48,225 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 48 treesize of output 58 [2023-11-19 07:40:48,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2023-11-19 07:40:48,371 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-19 07:40:48,791 INFO L349 Elim1Store]: treesize reduction 272, result has 34.6 percent of original size [2023-11-19 07:40:48,791 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 4 case distinctions, treesize of input 5001 treesize of output 4877 [2023-11-19 07:40:49,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:40:49,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 208 [2023-11-19 07:40:49,198 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:40:49,200 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:40:49,201 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:40:49,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 23 [2023-11-19 07:40:49,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:40:49,717 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 726 treesize of output 700 [2023-11-19 07:40:52,954 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_main_~next_time~0#1| 0)) (.cse2 (< 0 |c_ULTIMATE.start_main_~next_time~0#1|))) (and (forall ((v_ArrVal_293 Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_7| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_7| 1)) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_287 (Array Int Int))) (or (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~q#1.offset_7| Int) (v_ArrVal_302 (Array Int Int))) (not (= (select (store (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| v_ArrVal_293 (store v_ArrVal_280 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 v_ArrVal_280) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9|))))) (store .cse1 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| v_ArrVal_293))))) (store .cse0 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| (store v_ArrVal_302 8 (select (select (store .cse0 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_ArrVal_302) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7|)))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) |c_ULTIMATE.start_main_~#queue~0#1.base|))) (= (select (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_293 v_ArrVal_287) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| 0) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0))) (= v_ArrVal_293 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|))) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)))) (or .cse2 (and (forall ((v_ArrVal_293 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)) (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_7| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_7| 1)) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_280 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| v_ArrVal_293 (store v_ArrVal_280 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 v_ArrVal_280) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9|))))) (let ((.cse3 (store (select .cse5 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| v_ArrVal_293))) (or (= (select .cse3 |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_7| Int) (v_ArrVal_302 (Array Int Int))) (= (select (store (select (let ((.cse4 (store .cse5 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse3))) (store .cse4 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| (store v_ArrVal_302 8 (select (select (store .cse4 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_ArrVal_302) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7|)))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) |v_ULTIMATE.start_append_to_queue_~n#1.base_7|)))))) (= v_ArrVal_293 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|))))) (or .cse6 (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_293 Int)) (or (= (select (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 (store v_ArrVal_280 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 v_ArrVal_280) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9|))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| v_ArrVal_293) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1))))))) (forall ((v_ArrVal_293 Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_7| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_7| 1)) (= v_ArrVal_293 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_280 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| v_ArrVal_293 (store v_ArrVal_280 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 v_ArrVal_280) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9|))))) (let ((.cse9 (store (select .cse8 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| v_ArrVal_293))) (or (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_7| Int) (v_ArrVal_287 (Array Int Int)) (v_ArrVal_302 (Array Int Int))) (or (= (select (store (select (let ((.cse7 (store .cse8 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse9))) (store .cse7 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| (store v_ArrVal_302 8 (select (select (store .cse7 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_ArrVal_302) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7|)))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) v_ArrVal_293) (forall ((v_arrayElimArr_1 (Array Int Int))) (= (select (store (select (store (let ((.cse10 (store |c_#memory_$Pointer$.offset| v_ArrVal_293 v_ArrVal_287))) (store .cse10 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| 0))) |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| 0) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0)))) (= (select .cse9 |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0))))))) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)))) (forall ((v_ArrVal_293 Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_7| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_7| 1)) (= v_ArrVal_293 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_280 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| v_ArrVal_293 (store v_ArrVal_280 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 v_ArrVal_280) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9|))))) (let ((.cse11 (store (select .cse13 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| v_ArrVal_293))) (or (= (select .cse11 |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_7| Int) (v_ArrVal_302 (Array Int Int))) (not (= (select (store (select (let ((.cse12 (store .cse13 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse11))) (store .cse12 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| (store v_ArrVal_302 8 (select (select (store .cse12 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_ArrVal_302) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7|)))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) |c_ULTIMATE.start_main_~#queue~0#1.base|))))))))) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)))) (or (and (forall ((v_ArrVal_293 Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_7| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_7| 1)) (= v_ArrVal_293 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_287 (Array Int Int))) (or (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~q#1.offset_7| Int) (v_ArrVal_302 (Array Int Int))) (= (select (store (select (let ((.cse14 (let ((.cse15 (store |c_#memory_$Pointer$.base| v_ArrVal_293 (store v_ArrVal_280 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 v_ArrVal_280) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9|))))) (store .cse15 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| v_ArrVal_293))))) (store .cse14 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| (store v_ArrVal_302 8 (select (select (store .cse14 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_ArrVal_302) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7|)))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) |v_ULTIMATE.start_append_to_queue_~n#1.base_7|)) (= (select (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_293 v_ArrVal_287) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| 0) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0))))) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)))) (or (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_293 Int) (v_ArrVal_287 (Array Int Int))) (or (= (select (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_293 v_ArrVal_287) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| 0) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)))) .cse6)) .cse2) (forall ((v_ArrVal_293 Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_7| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_7| 1)) (= v_ArrVal_293 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_287 (Array Int Int))) (or (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~q#1.offset_7| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse16 (select (store (select (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$.base| v_ArrVal_293 (store v_ArrVal_280 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 v_ArrVal_280) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9|))))) (store .cse18 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| v_ArrVal_293))))) (store .cse17 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| (store v_ArrVal_302 8 (select (select (store .cse17 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_ArrVal_302) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7|)))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (or (= .cse16 v_ArrVal_293) (= .cse16 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|)))) (= (select (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_293 v_ArrVal_287) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| 0) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0))))) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)))) (forall ((v_ArrVal_293 Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_7| Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_280 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$.base| v_ArrVal_293 (store v_ArrVal_280 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 v_ArrVal_280) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9|))))) (let ((.cse19 (store (select .cse22 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| v_ArrVal_293))) (or (= (select .cse19 |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_7| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse20 (select (store (select (let ((.cse21 (store .cse22 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse19))) (store .cse21 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| (store v_ArrVal_302 8 (select (select (store .cse21 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_ArrVal_302) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7|)))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (or (= .cse20 v_ArrVal_293) (not (= .cse20 |c_ULTIMATE.start_main_~#queue~0#1.base|))))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_7| 1)) (= v_ArrVal_293 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|))) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)))) (forall ((v_ArrVal_293 Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_7| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_7| 1)) (= v_ArrVal_293 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_287 (Array Int Int))) (let ((.cse25 (store |c_#memory_$Pointer$.offset| v_ArrVal_293 v_ArrVal_287))) (let ((.cse26 (store (select .cse25 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| 0))) (or (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~q#1.offset_7| Int) (v_ArrVal_302 (Array Int Int))) (or (= (select (store (select (let ((.cse23 (let ((.cse24 (store |c_#memory_$Pointer$.base| v_ArrVal_293 (store v_ArrVal_280 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 v_ArrVal_280) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9|))))) (store .cse24 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| v_ArrVal_293))))) (store .cse23 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| (store v_ArrVal_302 8 (select (select (store .cse23 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_ArrVal_302) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7|)))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) v_ArrVal_293) (forall ((v_arrayElimArr_1 (Array Int Int))) (= (select (store (select (store (store .cse25 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse26) |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| 0) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0)))) (= (select .cse26 |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0))))))) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)))) (forall ((v_ArrVal_293 Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_7| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_7| 1)) (= v_ArrVal_293 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_287 (Array Int Int))) (or (= (select (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_293 v_ArrVal_287) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| 0) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0) (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~q#1.offset_7| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse27 (select (store (select (let ((.cse28 (let ((.cse29 (store |c_#memory_$Pointer$.base| v_ArrVal_293 (store v_ArrVal_280 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 v_ArrVal_280) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9|))))) (store .cse29 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse29 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| v_ArrVal_293))))) (store .cse28 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| (store v_ArrVal_302 8 (select (select (store .cse28 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_ArrVal_302) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7|)))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (or (= .cse27 v_ArrVal_293) (not (= .cse27 |c_ULTIMATE.start_main_~#queue~0#1.base|))))))))) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)))) (forall ((v_ArrVal_293 Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_7| Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_287 (Array Int Int))) (let ((.cse31 (store |c_#memory_$Pointer$.offset| v_ArrVal_293 v_ArrVal_287))) (let ((.cse30 (store (select .cse31 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| 0))) (or (= (select .cse30 |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~q#1.offset_7| Int)) (= (select (store (select (store (store .cse31 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse30) |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| 0) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_7| 1)) (= v_ArrVal_293 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|))) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)))) (forall ((v_ArrVal_293 Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_7| Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_280 (Array Int Int))) (or (= (select (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 (store v_ArrVal_280 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 v_ArrVal_280) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9|))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| v_ArrVal_293) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~q#1.offset_7| Int) (v_ArrVal_287 (Array Int Int))) (= (select (store (select (store (let ((.cse32 (store |c_#memory_$Pointer$.offset| v_ArrVal_293 v_ArrVal_287))) (store .cse32 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse32 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| 0))) |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| 0) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_7| 1)) (= v_ArrVal_293 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|))) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)))) (forall ((v_ArrVal_293 Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_7| Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_280 (Array Int Int))) (let ((.cse36 (store |c_#memory_$Pointer$.base| v_ArrVal_293 (store v_ArrVal_280 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 v_ArrVal_280) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9|))))) (let ((.cse33 (store (select .cse36 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| v_ArrVal_293))) (or (= (select .cse33 |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_7| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse34 (select (store (select (let ((.cse35 (store .cse36 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse33))) (store .cse35 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| (store v_ArrVal_302 8 (select (select (store .cse35 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_ArrVal_302) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7|)))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (or (= .cse34 v_ArrVal_293) (= .cse34 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|)))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_7| 1)) (= v_ArrVal_293 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|))) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)))))) is different from false [2023-11-19 07:40:56,304 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-11-19 07:40:56,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985347086] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:40:56,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:40:56,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 20 [2023-11-19 07:40:56,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543193201] [2023-11-19 07:40:56,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:40:56,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-19 07:40:56,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:56,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-19 07:40:56,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=261, Unknown=2, NotChecked=66, Total=380 [2023-11-19 07:40:56,310 INFO L87 Difference]: Start difference. First operand 91 states and 116 transitions. Second operand has 20 states, 20 states have (on average 3.2) internal successors, (64), 20 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-19 07:40:58,387 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_main_~next_time~0#1| 0)) (.cse2 (< 0 |c_ULTIMATE.start_main_~next_time~0#1|))) (and (<= 1 |c_ULTIMATE.start_main_~next_time~0#1|) (forall ((v_ArrVal_293 Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_7| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_7| 1)) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_287 (Array Int Int))) (or (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~q#1.offset_7| Int) (v_ArrVal_302 (Array Int Int))) (not (= (select (store (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| v_ArrVal_293 (store v_ArrVal_280 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 v_ArrVal_280) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9|))))) (store .cse1 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| v_ArrVal_293))))) (store .cse0 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| (store v_ArrVal_302 8 (select (select (store .cse0 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_ArrVal_302) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7|)))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) |c_ULTIMATE.start_main_~#queue~0#1.base|))) (= (select (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_293 v_ArrVal_287) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| 0) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0))) (= v_ArrVal_293 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|))) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)))) (or .cse2 (and (forall ((v_ArrVal_293 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)) (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_7| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_7| 1)) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_280 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| v_ArrVal_293 (store v_ArrVal_280 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 v_ArrVal_280) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9|))))) (let ((.cse3 (store (select .cse5 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| v_ArrVal_293))) (or (= (select .cse3 |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_7| Int) (v_ArrVal_302 (Array Int Int))) (= (select (store (select (let ((.cse4 (store .cse5 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse3))) (store .cse4 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| (store v_ArrVal_302 8 (select (select (store .cse4 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_ArrVal_302) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7|)))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) |v_ULTIMATE.start_append_to_queue_~n#1.base_7|)))))) (= v_ArrVal_293 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|))))) (or .cse6 (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_293 Int)) (or (= (select (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 (store v_ArrVal_280 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 v_ArrVal_280) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9|))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| v_ArrVal_293) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1))))))) (forall ((v_ArrVal_293 Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_7| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_7| 1)) (= v_ArrVal_293 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_280 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| v_ArrVal_293 (store v_ArrVal_280 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 v_ArrVal_280) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9|))))) (let ((.cse9 (store (select .cse8 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| v_ArrVal_293))) (or (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_7| Int) (v_ArrVal_287 (Array Int Int)) (v_ArrVal_302 (Array Int Int))) (or (= (select (store (select (let ((.cse7 (store .cse8 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse9))) (store .cse7 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| (store v_ArrVal_302 8 (select (select (store .cse7 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_ArrVal_302) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7|)))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) v_ArrVal_293) (forall ((v_arrayElimArr_1 (Array Int Int))) (= (select (store (select (store (let ((.cse10 (store |c_#memory_$Pointer$.offset| v_ArrVal_293 v_ArrVal_287))) (store .cse10 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| 0))) |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| 0) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0)))) (= (select .cse9 |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0))))))) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)))) (forall ((v_ArrVal_293 Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_7| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_7| 1)) (= v_ArrVal_293 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_280 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| v_ArrVal_293 (store v_ArrVal_280 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 v_ArrVal_280) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9|))))) (let ((.cse11 (store (select .cse13 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| v_ArrVal_293))) (or (= (select .cse11 |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_7| Int) (v_ArrVal_302 (Array Int Int))) (not (= (select (store (select (let ((.cse12 (store .cse13 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse11))) (store .cse12 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| (store v_ArrVal_302 8 (select (select (store .cse12 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_ArrVal_302) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7|)))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) |c_ULTIMATE.start_main_~#queue~0#1.base|))))))))) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)))) (= |c_ULTIMATE.start_main_~next_time~0#1| 1) (or (and (forall ((v_ArrVal_293 Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_7| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_7| 1)) (= v_ArrVal_293 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_287 (Array Int Int))) (or (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~q#1.offset_7| Int) (v_ArrVal_302 (Array Int Int))) (= (select (store (select (let ((.cse14 (let ((.cse15 (store |c_#memory_$Pointer$.base| v_ArrVal_293 (store v_ArrVal_280 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 v_ArrVal_280) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9|))))) (store .cse15 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| v_ArrVal_293))))) (store .cse14 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| (store v_ArrVal_302 8 (select (select (store .cse14 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_ArrVal_302) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7|)))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) |v_ULTIMATE.start_append_to_queue_~n#1.base_7|)) (= (select (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_293 v_ArrVal_287) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| 0) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0))))) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)))) (or (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_293 Int) (v_ArrVal_287 (Array Int Int))) (or (= (select (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_293 v_ArrVal_287) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| 0) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)))) .cse6)) .cse2) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#queue~0#1.base|) (forall ((v_ArrVal_293 Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_7| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_7| 1)) (= v_ArrVal_293 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_287 (Array Int Int))) (or (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~q#1.offset_7| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse16 (select (store (select (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$.base| v_ArrVal_293 (store v_ArrVal_280 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 v_ArrVal_280) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9|))))) (store .cse18 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| v_ArrVal_293))))) (store .cse17 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| (store v_ArrVal_302 8 (select (select (store .cse17 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_ArrVal_302) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7|)))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (or (= .cse16 v_ArrVal_293) (= .cse16 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|)))) (= (select (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_293 v_ArrVal_287) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| 0) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0))))) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)))) (forall ((v_ArrVal_293 Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_7| Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_280 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$.base| v_ArrVal_293 (store v_ArrVal_280 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 v_ArrVal_280) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9|))))) (let ((.cse19 (store (select .cse22 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| v_ArrVal_293))) (or (= (select .cse19 |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_7| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse20 (select (store (select (let ((.cse21 (store .cse22 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse19))) (store .cse21 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| (store v_ArrVal_302 8 (select (select (store .cse21 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_ArrVal_302) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7|)))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (or (= .cse20 v_ArrVal_293) (not (= .cse20 |c_ULTIMATE.start_main_~#queue~0#1.base|))))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_7| 1)) (= v_ArrVal_293 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|))) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)))) (forall ((v_ArrVal_293 Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_7| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_7| 1)) (= v_ArrVal_293 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_287 (Array Int Int))) (let ((.cse25 (store |c_#memory_$Pointer$.offset| v_ArrVal_293 v_ArrVal_287))) (let ((.cse26 (store (select .cse25 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| 0))) (or (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~q#1.offset_7| Int) (v_ArrVal_302 (Array Int Int))) (or (= (select (store (select (let ((.cse23 (let ((.cse24 (store |c_#memory_$Pointer$.base| v_ArrVal_293 (store v_ArrVal_280 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 v_ArrVal_280) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9|))))) (store .cse24 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| v_ArrVal_293))))) (store .cse23 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| (store v_ArrVal_302 8 (select (select (store .cse23 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_ArrVal_302) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7|)))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) v_ArrVal_293) (forall ((v_arrayElimArr_1 (Array Int Int))) (= (select (store (select (store (store .cse25 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse26) |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| 0) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0)))) (= (select .cse26 |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0))))))) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)))) (forall ((v_ArrVal_293 Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_7| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_7| 1)) (= v_ArrVal_293 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_287 (Array Int Int))) (or (= (select (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_293 v_ArrVal_287) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| 0) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0) (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~q#1.offset_7| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse27 (select (store (select (let ((.cse28 (let ((.cse29 (store |c_#memory_$Pointer$.base| v_ArrVal_293 (store v_ArrVal_280 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 v_ArrVal_280) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9|))))) (store .cse29 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse29 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| v_ArrVal_293))))) (store .cse28 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| (store v_ArrVal_302 8 (select (select (store .cse28 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_ArrVal_302) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7|)))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (or (= .cse27 v_ArrVal_293) (not (= .cse27 |c_ULTIMATE.start_main_~#queue~0#1.base|))))))))) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)))) (forall ((v_ArrVal_293 Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_7| Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_287 (Array Int Int))) (let ((.cse31 (store |c_#memory_$Pointer$.offset| v_ArrVal_293 v_ArrVal_287))) (let ((.cse30 (store (select .cse31 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| 0))) (or (= (select .cse30 |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~q#1.offset_7| Int)) (= (select (store (select (store (store .cse31 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse30) |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| 0) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_7| 1)) (= v_ArrVal_293 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|))) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)))) (forall ((v_ArrVal_293 Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_7| Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_280 (Array Int Int))) (or (= (select (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 (store v_ArrVal_280 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 v_ArrVal_280) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9|))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| v_ArrVal_293) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~q#1.offset_7| Int) (v_ArrVal_287 (Array Int Int))) (= (select (store (select (store (let ((.cse32 (store |c_#memory_$Pointer$.offset| v_ArrVal_293 v_ArrVal_287))) (store .cse32 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse32 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| 0))) |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| 0) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_7| 1)) (= v_ArrVal_293 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|))) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)))) (forall ((v_ArrVal_293 Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_7| Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_9| Int) (v_ArrVal_280 (Array Int Int))) (let ((.cse36 (store |c_#memory_$Pointer$.base| v_ArrVal_293 (store v_ArrVal_280 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_293 v_ArrVal_280) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9|))))) (let ((.cse33 (store (select .cse36 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_9| v_ArrVal_293))) (or (= (select .cse33 |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_7| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse34 (select (store (select (let ((.cse35 (store .cse36 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse33))) (store .cse35 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| (store v_ArrVal_302 8 (select (select (store .cse35 |v_ULTIMATE.start_append_to_queue_~n#1.base_7| v_ArrVal_302) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7|)))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_7| |v_ULTIMATE.start_append_to_queue_~n#1.base_7|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (or (= .cse34 v_ArrVal_293) (= .cse34 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|)))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_7| 1)) (= v_ArrVal_293 |v_ULTIMATE.start_append_to_queue_~n#1.base_7|))) (< |c_#StackHeapBarrier| (+ v_ArrVal_293 1)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0))) is different from true [2023-11-19 07:41:08,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:08,134 INFO L93 Difference]: Finished difference Result 341 states and 449 transitions. [2023-11-19 07:41:08,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-11-19 07:41:08,136 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.2) internal successors, (64), 20 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 23 [2023-11-19 07:41:08,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:08,138 INFO L225 Difference]: With dead ends: 341 [2023-11-19 07:41:08,138 INFO L226 Difference]: Without dead ends: 285 [2023-11-19 07:41:08,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=516, Invalid=2977, Unknown=59, NotChecked=354, Total=3906 [2023-11-19 07:41:08,142 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 423 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 20 mSolverCounterUnsat, 60 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 60 IncrementalHoareTripleChecker+Unknown, 581 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:08,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 693 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 589 Invalid, 60 Unknown, 581 Unchecked, 4.4s Time] [2023-11-19 07:41:08,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-11-19 07:41:08,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 171. [2023-11-19 07:41:08,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.2823529411764707) internal successors, (218), 170 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:08,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 218 transitions. [2023-11-19 07:41:08,172 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 218 transitions. Word has length 23 [2023-11-19 07:41:08,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:08,173 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 218 transitions. [2023-11-19 07:41:08,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.2) internal successors, (64), 20 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-19 07:41:08,173 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 218 transitions. [2023-11-19 07:41:08,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-19 07:41:08,174 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:08,175 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:08,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:41:08,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:41:08,392 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:08,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:08,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1691130333, now seen corresponding path program 1 times [2023-11-19 07:41:08,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:08,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573836685] [2023-11-19 07:41:08,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:08,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:08,867 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 07:41:08,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:08,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573836685] [2023-11-19 07:41:08,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573836685] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:41:08,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988167993] [2023-11-19 07:41:08,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:08,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:41:08,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:41:08,872 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:41:08,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 07:41:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:09,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-19 07:41:09,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:41:09,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:41:09,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:41:09,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2023-11-19 07:41:09,235 INFO L349 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2023-11-19 07:41:09,235 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 28 treesize of output 38 [2023-11-19 07:41:09,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:41:09,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:41:09,258 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 37 treesize of output 32 [2023-11-19 07:41:09,303 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2023-11-19 07:41:09,304 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 32 treesize of output 35 [2023-11-19 07:41:09,314 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 20 treesize of output 1 [2023-11-19 07:41:09,322 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 20 treesize of output 1 [2023-11-19 07:41:10,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 07:41:10,026 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:41:10,399 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_11| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_11| 1)) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_11| Int) (v_ArrVal_362 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_append_to_queue_~n#1.base_11| (store v_ArrVal_362 8 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_append_to_queue_~n#1.base_11| v_ArrVal_362) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_11|))))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_11| |v_ULTIMATE.start_append_to_queue_~n#1.base_11|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (or (forall ((v_ArrVal_366 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse1) .cse2) (+ (select (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_append_to_queue_~n#1.base_11| (store v_ArrVal_366 8 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_append_to_queue_~n#1.base_11| v_ArrVal_366) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_11|))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_11| 0) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 8)) 0)) (= .cse2 0)))))))) (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_11| Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_11| Int) (v_ArrVal_362 (Array Int Int))) (let ((.cse3 (select (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_append_to_queue_~n#1.base_11| (store v_ArrVal_362 8 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_append_to_queue_~n#1.base_11| v_ArrVal_362) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_11|))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_11| |v_ULTIMATE.start_append_to_queue_~n#1.base_11|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (or (= .cse3 0) (forall ((v_ArrVal_366 (Array Int Int))) (= (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_append_to_queue_~n#1.base_11| (store v_ArrVal_366 8 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_append_to_queue_~n#1.base_11| v_ArrVal_366) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_11|))))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_11| 0))) (select (select (store .cse4 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse5) .cse3) (+ (select .cse5 |c_ULTIMATE.start_main_~#queue~0#1.offset|) 8)))) 0))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_11| 1)))) (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_11| Int)) (or (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_11| Int) (v_ArrVal_366 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_append_to_queue_~n#1.base_11| (store v_ArrVal_366 8 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_append_to_queue_~n#1.base_11| v_ArrVal_366) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_11|))))) (let ((.cse8 (store (select .cse7 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_11| 0))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (or (= .cse6 0) (forall ((v_ArrVal_362 (Array Int Int))) (= (select (select (store .cse7 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse8) (select (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_append_to_queue_~n#1.base_11| (store v_ArrVal_362 8 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_append_to_queue_~n#1.base_11| v_ArrVal_362) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_11|))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_11| |v_ULTIMATE.start_append_to_queue_~n#1.base_11|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ .cse6 8)) 0))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_11| 1)))) (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_11| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_append_to_queue_~n#1.base_11| 1)) (forall ((|v_ULTIMATE.start_append_to_queue_~q#1.offset_11| Int) (v_ArrVal_366 (Array Int Int))) (let ((.cse9 (select (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_append_to_queue_~n#1.base_11| (store v_ArrVal_366 8 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_append_to_queue_~n#1.base_11| v_ArrVal_366) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_11|))) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_11| 0) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (or (= .cse9 0) (forall ((v_ArrVal_362 (Array Int Int))) (= (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_append_to_queue_~n#1.base_11| (store v_ArrVal_362 8 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_append_to_queue_~n#1.base_11| v_ArrVal_362) |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_11|))))) (let ((.cse11 (store (select .cse10 |c_ULTIMATE.start_main_~#queue~0#1.base|) |v_ULTIMATE.start_append_to_queue_~q#1.offset_11| |v_ULTIMATE.start_append_to_queue_~n#1.base_11|))) (select (store .cse10 |c_ULTIMATE.start_main_~#queue~0#1.base| .cse11) (select .cse11 |c_ULTIMATE.start_main_~#queue~0#1.offset|)))) (+ .cse9 8)) 0)))))))) is different from false [2023-11-19 07:41:11,507 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 3 not checked. [2023-11-19 07:41:11,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988167993] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:41:11,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:41:11,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2023-11-19 07:41:11,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157297334] [2023-11-19 07:41:11,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:41:11,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-19 07:41:11,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:11,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-19 07:41:11,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2023-11-19 07:41:11,510 INFO L87 Difference]: Start difference. First operand 171 states and 218 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:12,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:12,840 INFO L93 Difference]: Finished difference Result 250 states and 325 transitions. [2023-11-19 07:41:12,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:41:12,841 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 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-19 07:41:12,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:12,843 INFO L225 Difference]: With dead ends: 250 [2023-11-19 07:41:12,843 INFO L226 Difference]: Without dead ends: 193 [2023-11-19 07:41:12,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=79, Invalid=230, Unknown=1, NotChecked=32, Total=342 [2023-11-19 07:41:12,846 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 44 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:12,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 152 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 36 Unchecked, 0.3s Time] [2023-11-19 07:41:12,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-11-19 07:41:12,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2023-11-19 07:41:12,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.2765957446808511) internal successors, (240), 188 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:12,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 240 transitions. [2023-11-19 07:41:12,918 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 240 transitions. Word has length 23 [2023-11-19 07:41:12,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:12,919 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 240 transitions. [2023-11-19 07:41:12,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:12,919 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 240 transitions. [2023-11-19 07:41:12,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-19 07:41:12,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:12,921 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:12,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 07:41:13,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:41:13,141 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:13,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:13,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1581376036, now seen corresponding path program 2 times [2023-11-19 07:41:13,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:13,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666990506] [2023-11-19 07:41:13,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:13,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:41:15,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:15,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666990506] [2023-11-19 07:41:15,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666990506] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:41:15,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223167472] [2023-11-19 07:41:15,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 07:41:15,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:41:15,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:41:15,063 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:41:15,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8341aec-ec5d-4957-a870-90bf63604ed0/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 07:41:15,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 07:41:15,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:41:15,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 107 conjunts are in the unsatisfiable core [2023-11-19 07:41:15,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:41:15,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:41:15,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:41:15,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2023-11-19 07:41:15,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:41:15,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:41:15,365 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 30 treesize of output 27 [2023-11-19 07:41:15,372 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 10 treesize of output 9 [2023-11-19 07:41:15,396 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-19 07:41:15,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2023-11-19 07:41:15,433 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-19 07:41:15,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2023-11-19 07:41:16,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:41:16,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:41:16,152 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 43 treesize of output 38 [2023-11-19 07:41:16,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 18 treesize of output 17 [2023-11-19 07:41:16,165 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 0 case distinctions, treesize of input 18 treesize of output 3 [2023-11-19 07:41:16,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:41:16,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:41:16,186 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 73 treesize of output 62 [2023-11-19 07:41:16,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2023-11-19 07:41:16,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 39 [2023-11-19 07:41:16,230 INFO L349 Elim1Store]: treesize reduction 4, result has 84.6 percent of original size [2023-11-19 07:41:16,230 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 29 treesize of output 29 [2023-11-19 07:41:16,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:41:16,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:41:16,251 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 43 treesize of output 25 [2023-11-19 07:41:16,606 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-11-19 07:41:16,606 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 124 treesize of output 45 [2023-11-19 07:41:16,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:41:16,622 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-19 07:41:16,683 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 15 treesize of output 7 [2023-11-19 07:41:16,725 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:41:16,725 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:41:17,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:41:17,578 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 553 treesize of output 552 [2023-11-19 07:41:17,594 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 450 treesize of output 354 [2023-11-19 07:41:17,609 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 200 treesize of output 152