./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 5e519f3a 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_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-data/process_queue.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:04:48,013 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:04:48,016 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:04:48,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:04:48,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:04:48,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:04:48,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:04:48,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:04:48,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:04:48,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:04:48,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:04:48,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:04:48,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:04:48,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:04:48,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:04:48,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:04:48,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:04:48,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:04:48,073 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:04:48,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:04:48,078 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:04:48,080 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:04:48,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:04:48,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:04:48,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:04:48,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:04:48,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:04:48,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:04:48,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:04:48,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:04:48,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:04:48,094 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:04:48,095 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:04:48,096 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:04:48,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:04:48,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:04:48,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:04:48,100 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:04:48,100 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:04:48,101 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:04:48,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:04:48,108 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:04:48,162 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:04:48,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:04:48,166 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:04:48,167 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:04:48,168 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:04:48,170 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:04:48,171 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:04:48,171 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:04:48,171 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:04:48,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:04:48,173 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:04:48,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:04:48,174 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:04:48,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:04:48,174 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:04:48,175 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:04:48,175 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:04:48,175 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:04:48,176 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:04:48,176 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:04:48,176 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:04:48,176 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:04:48,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:04:48,177 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:04:48,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:04:48,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:04:48,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:04:48,178 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:04:48,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:04:48,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:04:48,179 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:04:48,179 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:04:48,180 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:04:48,180 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/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_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 [2022-11-02 20:04:48,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:04:48,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:04:48,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:04:48,585 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:04:48,586 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:04:48,588 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/heap-data/process_queue.i [2022-11-02 20:04:48,660 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/data/4f5885405/71ebe1a5c60e4628a0686b21420c4870/FLAG376d0da08 [2022-11-02 20:04:49,268 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:04:49,269 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/sv-benchmarks/c/heap-data/process_queue.i [2022-11-02 20:04:49,283 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/data/4f5885405/71ebe1a5c60e4628a0686b21420c4870/FLAG376d0da08 [2022-11-02 20:04:49,547 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/data/4f5885405/71ebe1a5c60e4628a0686b21420c4870 [2022-11-02 20:04:49,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:04:49,552 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:04:49,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:04:49,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:04:49,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:04:49,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:04:49" (1/1) ... [2022-11-02 20:04:49,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@639a4db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:49, skipping insertion in model container [2022-11-02 20:04:49,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:04:49" (1/1) ... [2022-11-02 20:04:49,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:04:49,643 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:04:50,071 WARN L230 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_6c9a910d-af67-4231-a183-56e8f9e29d6e/sv-benchmarks/c/heap-data/process_queue.i[23979,23992] [2022-11-02 20:04:50,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:04:50,091 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:04:50,161 WARN L230 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_6c9a910d-af67-4231-a183-56e8f9e29d6e/sv-benchmarks/c/heap-data/process_queue.i[23979,23992] [2022-11-02 20:04:50,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:04:50,216 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:04:50,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:50 WrapperNode [2022-11-02 20:04:50,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:04:50,219 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:04:50,219 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:04:50,220 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:04:50,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:50" (1/1) ... [2022-11-02 20:04:50,278 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:50" (1/1) ... [2022-11-02 20:04:50,309 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 111 [2022-11-02 20:04:50,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:04:50,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:04:50,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:04:50,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:04:50,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:50" (1/1) ... [2022-11-02 20:04:50,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:50" (1/1) ... [2022-11-02 20:04:50,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:50" (1/1) ... [2022-11-02 20:04:50,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:50" (1/1) ... [2022-11-02 20:04:50,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:50" (1/1) ... [2022-11-02 20:04:50,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:50" (1/1) ... [2022-11-02 20:04:50,367 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:50" (1/1) ... [2022-11-02 20:04:50,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:50" (1/1) ... [2022-11-02 20:04:50,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:04:50,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:04:50,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:04:50,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:04:50,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:50" (1/1) ... [2022-11-02 20:04:50,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:04:50,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:04:50,428 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:04:50,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:04:50,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:04:50,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:04:50,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:04:50,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:04:50,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:04:50,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:04:50,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:04:50,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:04:50,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:04:50,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:04:50,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:04:50,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:04:50,723 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:04:50,726 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:04:51,123 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:04:51,142 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:04:51,143 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 20:04:51,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:04:51 BoogieIcfgContainer [2022-11-02 20:04:51,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:04:51,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:04:51,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:04:51,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:04:51,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:04:49" (1/3) ... [2022-11-02 20:04:51,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c954bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:04:51, skipping insertion in model container [2022-11-02 20:04:51,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:50" (2/3) ... [2022-11-02 20:04:51,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c954bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:04:51, skipping insertion in model container [2022-11-02 20:04:51,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:04:51" (3/3) ... [2022-11-02 20:04:51,162 INFO L112 eAbstractionObserver]: Analyzing ICFG process_queue.i [2022-11-02 20:04:51,186 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:04:51,186 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:04:51,276 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:04:51,296 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=LoopsAndPotentialCycles, 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;@57616b15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:04:51,299 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:04:51,310 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:51,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:04:51,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:51,321 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:51,322 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:51,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:51,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2060272908, now seen corresponding path program 1 times [2022-11-02 20:04:51,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:51,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693849714] [2022-11-02 20:04:51,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:51,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:51,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:51,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:51,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693849714] [2022-11-02 20:04:51,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693849714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:51,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:51,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:04:51,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544536634] [2022-11-02 20:04:51,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:51,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:04:51,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:51,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:04:51,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:04:51,855 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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) [2022-11-02 20:04:51,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:51,902 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2022-11-02 20:04:51,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:04:51,907 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 [2022-11-02 20:04:51,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:51,917 INFO L225 Difference]: With dead ends: 51 [2022-11-02 20:04:51,918 INFO L226 Difference]: Without dead ends: 23 [2022-11-02 20:04:51,922 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 [2022-11-02 20:04:51,926 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:51,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:04:51,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-02 20:04:51,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-02 20:04:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:51,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-11-02 20:04:51,970 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 11 [2022-11-02 20:04:51,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:51,971 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-11-02 20:04:51,971 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) [2022-11-02 20:04:51,971 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-11-02 20:04:51,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:04:51,972 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:51,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:51,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:04:51,973 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:51,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:51,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1911586027, now seen corresponding path program 1 times [2022-11-02 20:04:51,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:51,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128049823] [2022-11-02 20:04:51,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:51,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:52,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:52,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:52,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128049823] [2022-11-02 20:04:52,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128049823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:52,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:52,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:04:52,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587180822] [2022-11-02 20:04:52,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:52,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:04:52,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:52,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:04:52,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:04:52,092 INFO L87 Difference]: Start difference. First operand 23 states and 30 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) [2022-11-02 20:04:52,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:52,168 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-11-02 20:04:52,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:04:52,169 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 [2022-11-02 20:04:52,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:52,170 INFO L225 Difference]: With dead ends: 56 [2022-11-02 20:04:52,171 INFO L226 Difference]: Without dead ends: 35 [2022-11-02 20:04:52,171 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 [2022-11-02 20:04:52,173 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:52,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 86 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:04:52,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-02 20:04:52,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-11-02 20:04:52,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:52,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-11-02 20:04:52,183 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 11 [2022-11-02 20:04:52,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:52,184 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-11-02 20:04:52,184 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) [2022-11-02 20:04:52,185 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-11-02 20:04:52,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:04:52,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:52,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:52,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:04:52,187 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:52,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:52,188 INFO L85 PathProgramCache]: Analyzing trace with hash 459687026, now seen corresponding path program 1 times [2022-11-02 20:04:52,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:52,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805575689] [2022-11-02 20:04:52,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:52,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:53,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:53,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:53,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805575689] [2022-11-02 20:04:53,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805575689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:53,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:53,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:04:53,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274806555] [2022-11-02 20:04:53,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:53,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:04:53,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:53,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:04:53,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:04:53,350 INFO L87 Difference]: Start difference. First operand 33 states and 43 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) [2022-11-02 20:04:53,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:53,658 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2022-11-02 20:04:53,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:04:53,659 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 [2022-11-02 20:04:53,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:53,662 INFO L225 Difference]: With dead ends: 74 [2022-11-02 20:04:53,662 INFO L226 Difference]: Without dead ends: 72 [2022-11-02 20:04:53,663 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 [2022-11-02 20:04:53,665 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 63 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:53,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 105 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:04:53,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-02 20:04:53,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 51. [2022-11-02 20:04:53,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2022-11-02 20:04:53,679 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 11 [2022-11-02 20:04:53,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:53,679 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2022-11-02 20:04:53,680 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) [2022-11-02 20:04:53,680 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-11-02 20:04:53,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:04:53,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:53,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:53,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:04:53,682 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:53,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:53,683 INFO L85 PathProgramCache]: Analyzing trace with hash 608373907, now seen corresponding path program 1 times [2022-11-02 20:04:53,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:53,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011561993] [2022-11-02 20:04:53,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:53,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:53,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:53,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:53,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011561993] [2022-11-02 20:04:53,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011561993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:53,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:53,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:04:53,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470059556] [2022-11-02 20:04:53,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:53,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:04:53,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:53,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:04:53,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:04:53,786 INFO L87 Difference]: Start difference. First operand 51 states and 68 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) [2022-11-02 20:04:53,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:53,895 INFO L93 Difference]: Finished difference Result 106 states and 140 transitions. [2022-11-02 20:04:53,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:04:53,897 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 [2022-11-02 20:04:53,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:53,898 INFO L225 Difference]: With dead ends: 106 [2022-11-02 20:04:53,898 INFO L226 Difference]: Without dead ends: 57 [2022-11-02 20:04:53,899 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 [2022-11-02 20:04:53,901 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:53,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 74 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:04:53,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-02 20:04:53,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2022-11-02 20:04:53,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 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) [2022-11-02 20:04:53,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2022-11-02 20:04:53,928 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 11 [2022-11-02 20:04:53,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:53,929 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2022-11-02 20:04:53,929 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) [2022-11-02 20:04:53,929 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2022-11-02 20:04:53,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:04:53,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:53,931 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:53,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:04:53,932 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:53,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:53,934 INFO L85 PathProgramCache]: Analyzing trace with hash -2110602732, now seen corresponding path program 1 times [2022-11-02 20:04:53,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:53,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891218372] [2022-11-02 20:04:53,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:53,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:54,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:54,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:54,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891218372] [2022-11-02 20:04:54,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891218372] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:04:54,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084511418] [2022-11-02 20:04:54,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:54,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:04:54,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:04:54,889 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:04:54,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:04:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:55,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-02 20:04:55,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:04:55,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:04:55,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:04:55,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:04:55,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 26 [2022-11-02 20:04:55,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:04:55,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:04:55,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 26 [2022-11-02 20:04:55,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 21 [2022-11-02 20:04:55,357 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-02 20:04:55,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-02 20:04:55,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 25 [2022-11-02 20:04:55,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:04:55,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:04:55,586 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-02 20:04:55,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 77 treesize of output 40 [2022-11-02 20:04:55,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2022-11-02 20:04:55,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:55,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:04:57,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:57,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084511418] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:04:57,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:04:57,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-11-02 20:04:57,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347054747] [2022-11-02 20:04:57,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:04:57,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:04:57,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:57,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:04:57,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:04:57,749 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:58,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:58,098 INFO L93 Difference]: Finished difference Result 121 states and 160 transitions. [2022-11-02 20:04:58,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:04:58,103 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 20:04:58,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:58,104 INFO L225 Difference]: With dead ends: 121 [2022-11-02 20:04:58,104 INFO L226 Difference]: Without dead ends: 83 [2022-11-02 20:04:58,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:04:58,106 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 40 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:58,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 225 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 22 Unchecked, 0.2s Time] [2022-11-02 20:04:58,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-02 20:04:58,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 54. [2022-11-02 20:04:58,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:58,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2022-11-02 20:04:58,124 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 14 [2022-11-02 20:04:58,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:58,125 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2022-11-02 20:04:58,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:58,125 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2022-11-02 20:04:58,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:04:58,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:58,128 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:58,178 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-02 20:04:58,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:04:58,342 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:58,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:58,343 INFO L85 PathProgramCache]: Analyzing trace with hash 969563825, now seen corresponding path program 1 times [2022-11-02 20:04:58,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:58,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139672738] [2022-11-02 20:04:58,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:58,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:04:58,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:58,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139672738] [2022-11-02 20:04:58,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139672738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:04:58,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:04:58,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:04:58,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606283906] [2022-11-02 20:04:58,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:04:58,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:04:58,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:04:58,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:04:58,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:04:58,639 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:58,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:04:58,719 INFO L93 Difference]: Finished difference Result 117 states and 155 transitions. [2022-11-02 20:04:58,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:04:58,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:04:58,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:04:58,721 INFO L225 Difference]: With dead ends: 117 [2022-11-02 20:04:58,721 INFO L226 Difference]: Without dead ends: 79 [2022-11-02 20:04:58,722 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 [2022-11-02 20:04:58,723 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 29 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:04:58,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 75 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:04:58,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-02 20:04:58,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2022-11-02 20:04:58,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:58,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2022-11-02 20:04:58,737 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 19 [2022-11-02 20:04:58,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:04:58,738 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2022-11-02 20:04:58,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:04:58,738 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2022-11-02 20:04:58,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:04:58,739 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:04:58,740 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:04:58,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:04:58,740 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:04:58,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:04:58,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1377311315, now seen corresponding path program 1 times [2022-11-02 20:04:58,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:04:58,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573040147] [2022-11-02 20:04:58,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:58,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:04:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:59,712 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:04:59,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:04:59,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573040147] [2022-11-02 20:04:59,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573040147] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:04:59,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816066402] [2022-11-02 20:04:59,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:04:59,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:04:59,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:04:59,716 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:04:59,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:04:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:04:59,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-02 20:04:59,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:05:00,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2022-11-02 20:05:00,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:00,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:00,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2022-11-02 20:05:00,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:00,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:00,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2022-11-02 20:05:00,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:05:00,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:00,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-11-02 20:05:00,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:05:00,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:05:00,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:05:00,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:05:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:05:00,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:05:00,418 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:05:00,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 35 [2022-11-02 20:05:00,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-11-02 20:05:00,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-02 20:05:00,606 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:05:00,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816066402] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:05:00,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:05:00,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-11-02 20:05:00,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502991838] [2022-11-02 20:05:00,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:05:00,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 20:05:00,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:05:00,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 20:05:00,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:05:00,610 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:03,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:05:03,225 INFO L93 Difference]: Finished difference Result 323 states and 428 transitions. [2022-11-02 20:05:03,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-02 20:05:03,226 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:05:03,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:05:03,228 INFO L225 Difference]: With dead ends: 323 [2022-11-02 20:05:03,228 INFO L226 Difference]: Without dead ends: 269 [2022-11-02 20:05:03,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=529, Invalid=1823, Unknown=0, NotChecked=0, Total=2352 [2022-11-02 20:05:03,231 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 471 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:05:03,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 415 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:05:03,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-11-02 20:05:03,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 116. [2022-11-02 20:05:03,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.3043478260869565) internal successors, (150), 115 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 150 transitions. [2022-11-02 20:05:03,256 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 150 transitions. Word has length 22 [2022-11-02 20:05:03,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:05:03,257 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 150 transitions. [2022-11-02 20:05:03,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:03,257 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 150 transitions. [2022-11-02 20:05:03,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:05:03,258 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:05:03,259 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-02 20:05:03,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:05:03,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:05:03,474 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:05:03,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:05:03,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1662719123, now seen corresponding path program 2 times [2022-11-02 20:05:03,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:05:03,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378656298] [2022-11-02 20:05:03,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:05:03,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:05:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:05:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:05:06,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:05:06,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378656298] [2022-11-02 20:05:06,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378656298] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:05:06,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652044337] [2022-11-02 20:05:06,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:05:06,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:05:06,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:05:06,364 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:05:06,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:05:06,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:05:06,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:05:06,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-02 20:05:06,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:05:06,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:05:06,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:06,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:06,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2022-11-02 20:05:06,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:05:06,742 INFO L356 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-11-02 20:05:06,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 29 [2022-11-02 20:05:07,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:07,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:07,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 47 [2022-11-02 20:05:07,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:07,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:07,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2022-11-02 20:05:07,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:07,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:07,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-11-02 20:05:07,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 45 treesize of output 36 [2022-11-02 20:05:07,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 29 [2022-11-02 20:05:07,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:05:07,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:07,242 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-02 20:05:07,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2022-11-02 20:05:07,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:05:07,512 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:05:07,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:07,516 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:05:07,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 49 [2022-11-02 20:05:07,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:07,539 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:05:07,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 24 [2022-11-02 20:05:07,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:05:07,599 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:05:07,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:05:07,789 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_520 Int) (v_ArrVal_514 (Array Int Int)) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_518 (Array Int Int)) (v_ArrVal_509 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (or (not (= (select |c_#valid| v_ArrVal_520) 0)) (not (< v_ArrVal_520 |c_#StackHeapBarrier|)) (<= 1 (select (select (store (store |c_#memory_int| v_ArrVal_520 v_ArrVal_510) |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_514) (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_520 (store v_ArrVal_513 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_520 v_ArrVal_513) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_520 v_ArrVal_518) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_520)) v_ArrVal_520) 8)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_520 (store v_ArrVal_516 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_520 v_ArrVal_516) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_520 v_ArrVal_509) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)) v_ArrVal_520) 8) 4))))) is different from false [2022-11-02 20:05:08,149 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:05:08,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 377 treesize of output 376 [2022-11-02 20:05:08,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 306 treesize of output 242 [2022-11-02 20:05:08,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 136 treesize of output 104 [2022-11-02 20:05:10,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2022-11-02 20:05:10,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-11-02 20:05:10,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-11-02 20:05:16,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 280 treesize of output 276 [2022-11-02 20:05:16,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 276 treesize of output 272 [2022-11-02 20:05:16,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 289 treesize of output 285 [2022-11-02 20:05:16,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 298 treesize of output 294 [2022-11-02 20:05:16,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 302 treesize of output 298 [2022-11-02 20:05:16,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 301 treesize of output 299 [2022-11-02 20:05:16,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 299 treesize of output 295 [2022-11-02 20:05:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-02 20:05:16,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652044337] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:05:16,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:05:16,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2022-11-02 20:05:16,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450638937] [2022-11-02 20:05:16,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:05:16,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-02 20:05:16,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:05:16,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-02 20:05:16,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=553, Unknown=5, NotChecked=48, Total=702 [2022-11-02 20:05:16,801 INFO L87 Difference]: Start difference. First operand 116 states and 150 transitions. Second operand has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:25,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:05:25,239 INFO L93 Difference]: Finished difference Result 500 states and 652 transitions. [2022-11-02 20:05:25,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-11-02 20:05:25,240 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-02 20:05:25,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:05:25,242 INFO L225 Difference]: With dead ends: 500 [2022-11-02 20:05:25,242 INFO L226 Difference]: Without dead ends: 498 [2022-11-02 20:05:25,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 50 SyntacticMatches, 20 SemanticMatches, 93 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3220 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=1330, Invalid=7394, Unknown=22, NotChecked=184, Total=8930 [2022-11-02 20:05:25,247 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 317 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 468 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:05:25,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1048 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 745 Invalid, 0 Unknown, 468 Unchecked, 1.3s Time] [2022-11-02 20:05:25,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-11-02 20:05:25,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 334. [2022-11-02 20:05:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 1.2972972972972974) internal successors, (432), 333 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:25,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 432 transitions. [2022-11-02 20:05:25,302 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 432 transitions. Word has length 25 [2022-11-02 20:05:25,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:05:25,302 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 432 transitions. [2022-11-02 20:05:25,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:25,303 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 432 transitions. [2022-11-02 20:05:25,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:05:25,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:05:25,304 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-02 20:05:25,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:05:25,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-02 20:05:25,530 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:05:25,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:05:25,530 INFO L85 PathProgramCache]: Analyzing trace with hash 211481171, now seen corresponding path program 3 times [2022-11-02 20:05:25,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:05:25,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285130735] [2022-11-02 20:05:25,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:05:25,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:05:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:05:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:05:27,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:05:27,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285130735] [2022-11-02 20:05:27,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285130735] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:05:27,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813801244] [2022-11-02 20:05:27,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:05:27,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:05:27,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:05:27,958 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:05:27,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:05:28,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-02 20:05:28,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:05:28,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 126 conjunts are in the unsatisfiable core [2022-11-02 20:05:28,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:05:28,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:05:28,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:28,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:28,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 [2022-11-02 20:05:28,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:28,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:28,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 [2022-11-02 20:05:28,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 19 [2022-11-02 20:05:28,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:05:28,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 23 [2022-11-02 20:05:28,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:05:28,775 INFO L356 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-11-02 20:05:28,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 29 [2022-11-02 20:05:29,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:29,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:29,210 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-11-02 20:05:29,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 61 treesize of output 56 [2022-11-02 20:05:29,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:29,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:29,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:29,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-11-02 20:05:29,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 39 [2022-11-02 20:05:29,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 23 [2022-11-02 20:05:29,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:05:29,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 11 [2022-11-02 20:05:29,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:29,301 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-11-02 20:05:29,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2022-11-02 20:05:29,718 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:05:29,739 INFO L356 Elim1Store]: treesize reduction 67, result has 9.5 percent of original size [2022-11-02 20:05:29,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 153 treesize of output 83 [2022-11-02 20:05:29,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:29,764 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-11-02 20:05:29,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 29 [2022-11-02 20:05:29,774 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:05:29,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:05:36,225 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:05:36,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813801244] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:05:36,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:05:36,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2022-11-02 20:05:36,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956093800] [2022-11-02 20:05:36,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:05:36,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-02 20:05:36,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:05:36,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-02 20:05:36,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:05:36,230 INFO L87 Difference]: Start difference. First operand 334 states and 432 transitions. Second operand has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:39,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:05:39,276 INFO L93 Difference]: Finished difference Result 838 states and 1079 transitions. [2022-11-02 20:05:39,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:05:39,277 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 0 states have call successors, (0), 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 28 [2022-11-02 20:05:39,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:05:39,284 INFO L225 Difference]: With dead ends: 838 [2022-11-02 20:05:39,285 INFO L226 Difference]: Without dead ends: 535 [2022-11-02 20:05:39,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=188, Invalid=1072, Unknown=0, NotChecked=0, Total=1260 [2022-11-02 20:05:39,294 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 197 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:05:39,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 464 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 177 Invalid, 0 Unknown, 90 Unchecked, 0.7s Time] [2022-11-02 20:05:39,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-11-02 20:05:39,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 418. [2022-11-02 20:05:39,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.26378896882494) internal successors, (527), 417 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 527 transitions. [2022-11-02 20:05:39,363 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 527 transitions. Word has length 28 [2022-11-02 20:05:39,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:05:39,363 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 527 transitions. [2022-11-02 20:05:39,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:39,364 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 527 transitions. [2022-11-02 20:05:39,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:05:39,365 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:05:39,365 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:05:39,397 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:05:39,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:05:39,574 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:05:39,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:05:39,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1324510600, now seen corresponding path program 1 times [2022-11-02 20:05:39,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:05:39,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634257629] [2022-11-02 20:05:39,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:05:39,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:05:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:05:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:05:39,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:05:39,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634257629] [2022-11-02 20:05:39,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634257629] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:05:39,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609672093] [2022-11-02 20:05:39,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:05:39,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:05:39,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:05:39,738 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:05:39,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:05:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:05:39,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:05:39,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:05:39,965 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:05:39,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:05:40,019 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:05:40,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609672093] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:05:40,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:05:40,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-11-02 20:05:40,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293278556] [2022-11-02 20:05:40,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:05:40,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:05:40,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:05:40,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:05:40,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:05:40,022 INFO L87 Difference]: Start difference. First operand 418 states and 527 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:05:40,306 INFO L93 Difference]: Finished difference Result 1002 states and 1276 transitions. [2022-11-02 20:05:40,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:05:40,307 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 20:05:40,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:05:40,310 INFO L225 Difference]: With dead ends: 1002 [2022-11-02 20:05:40,310 INFO L226 Difference]: Without dead ends: 627 [2022-11-02 20:05:40,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:05:40,312 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 86 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:05:40,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 151 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:05:40,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2022-11-02 20:05:40,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 597. [2022-11-02 20:05:40,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.238255033557047) internal successors, (738), 596 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:40,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 738 transitions. [2022-11-02 20:05:40,409 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 738 transitions. Word has length 29 [2022-11-02 20:05:40,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:05:40,410 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 738 transitions. [2022-11-02 20:05:40,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:40,410 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 738 transitions. [2022-11-02 20:05:40,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:05:40,411 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:05:40,412 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:05:40,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:05:40,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:05:40,638 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:05:40,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:05:40,638 INFO L85 PathProgramCache]: Analyzing trace with hash -313393350, now seen corresponding path program 1 times [2022-11-02 20:05:40,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:05:40,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075944781] [2022-11-02 20:05:40,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:05:40,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:05:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:05:41,522 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:05:41,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:05:41,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075944781] [2022-11-02 20:05:41,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075944781] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:05:41,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387058533] [2022-11-02 20:05:41,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:05:41,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:05:41,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:05:41,525 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:05:41,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:05:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:05:41,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-02 20:05:41,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:05:41,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:05:41,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:41,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:41,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2022-11-02 20:05:41,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:05:41,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:41,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:41,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2022-11-02 20:05:41,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:05:41,830 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-02 20:05:41,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-02 20:05:42,299 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:05:42,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 99 [2022-11-02 20:05:42,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 80 treesize of output 30 [2022-11-02 20:05:42,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-11-02 20:05:42,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-11-02 20:05:42,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-11-02 20:05:42,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:05:42,485 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:05:42,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:05:42,673 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_choose_next_~node~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_choose_next_~node~0#1.offset| 4))) (let ((.cse2 (select .cse0 .cse1))) (or (forall ((v_ArrVal_861 Int) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (or (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_choose_next_~node~0#1.base| (store .cse0 .cse1 v_ArrVal_861)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_choose_next_~node~0#1.base| v_ArrVal_860) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_choose_next_~node~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 4))) (not (<= .cse2 (+ v_ArrVal_861 1))))) (= .cse2 1)))) is different from false [2022-11-02 20:05:42,699 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (let ((.cse2 (select |c_#memory_int| .cse1)) (.cse3 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 4))) (let ((.cse0 (select .cse2 .cse3))) (or (= .cse0 1) (forall ((v_ArrVal_861 Int) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (or (not (<= .cse0 (+ v_ArrVal_861 1))) (< 0 (select (select (store |c_#memory_int| .cse1 (store .cse2 .cse3 v_ArrVal_861)) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_860) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_859) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 4))))))))) is different from false [2022-11-02 20:05:43,003 INFO L356 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2022-11-02 20:05:43,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 158 treesize of output 185 [2022-11-02 20:05:43,260 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (let ((.cse0 (forall ((v_ArrVal_860 (Array Int Int))) (let ((.cse8 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_860) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (or (= .cse8 |c_ULTIMATE.start_check_queue_~n~0#1.base|) (= .cse8 .cse2))))) (.cse3 (forall ((v_ArrVal_860 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_860) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) |c_ULTIMATE.start_check_queue_~n~0#1.base|))) (.cse5 (forall ((v_ArrVal_859 (Array Int Int))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_859) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (or (= .cse4 .cse7) (= .cse7 |c_ULTIMATE.start_check_queue_~n~0#1.offset|))))) (.cse6 (forall ((v_ArrVal_859 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_859) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) |c_ULTIMATE.start_check_queue_~n~0#1.offset|)))) (let ((.cse1 (and .cse0 .cse3 .cse5 .cse6))) (and .cse0 (or .cse1 (= |c_ULTIMATE.start_check_queue_~n~0#1.base| .cse2)) (or .cse3 (forall ((v_ArrVal_859 (Array Int Int))) (= .cse4 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_859) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)))) (or .cse1 (= .cse4 |c_ULTIMATE.start_check_queue_~n~0#1.offset|)) .cse5 (or (forall ((v_ArrVal_860 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_860) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) .cse2)) .cse6))))) is different from false [2022-11-02 20:05:43,277 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (and (forall ((v_ArrVal_860 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_860) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) .cse0)) (forall ((v_ArrVal_859 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_859) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) is different from false [2022-11-02 20:05:43,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-11-02 20:05:43,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 17 [2022-11-02 20:05:43,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-02 20:05:43,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387058533] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:05:43,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:05:43,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 12] total 25 [2022-11-02 20:05:43,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178445435] [2022-11-02 20:05:43,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:05:43,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-02 20:05:43,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:05:43,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-02 20:05:43,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=361, Unknown=6, NotChecked=164, Total=600 [2022-11-02 20:05:43,357 INFO L87 Difference]: Start difference. First operand 597 states and 738 transitions. Second operand has 25 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:47,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:05:47,803 INFO L93 Difference]: Finished difference Result 1239 states and 1559 transitions. [2022-11-02 20:05:47,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-02 20:05:47,809 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 20:05:47,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:05:47,813 INFO L225 Difference]: With dead ends: 1239 [2022-11-02 20:05:47,813 INFO L226 Difference]: Without dead ends: 955 [2022-11-02 20:05:47,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 46 SyntacticMatches, 15 SemanticMatches, 49 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=508, Invalid=1664, Unknown=6, NotChecked=372, Total=2550 [2022-11-02 20:05:47,816 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 277 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 728 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:05:47,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 627 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 590 Invalid, 0 Unknown, 728 Unchecked, 2.0s Time] [2022-11-02 20:05:47,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2022-11-02 20:05:47,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 655. [2022-11-02 20:05:47,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 654 states have (on average 1.2522935779816513) internal successors, (819), 654 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:47,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 819 transitions. [2022-11-02 20:05:47,943 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 819 transitions. Word has length 29 [2022-11-02 20:05:47,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:05:47,943 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 819 transitions. [2022-11-02 20:05:47,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:47,944 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 819 transitions. [2022-11-02 20:05:47,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:05:47,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:05:47,945 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:05:47,977 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:05:48,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-02 20:05:48,158 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:05:48,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:05:48,159 INFO L85 PathProgramCache]: Analyzing trace with hash -190827821, now seen corresponding path program 1 times [2022-11-02 20:05:48,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:05:48,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052374964] [2022-11-02 20:05:48,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:05:48,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:05:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:05:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:05:48,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:05:48,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052374964] [2022-11-02 20:05:48,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052374964] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:05:48,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906854811] [2022-11-02 20:05:48,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:05:48,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:05:48,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:05:48,907 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:05:48,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:05:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:05:49,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-02 20:05:49,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:05:49,206 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-02 20:05:49,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-02 20:05:49,260 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-02 20:05:49,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-02 20:05:49,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:05:49,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:05:49,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:05:49,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:05:49,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2022-11-02 20:05:49,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-02 20:05:49,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2022-11-02 20:05:49,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-02 20:05:49,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-02 20:05:49,869 INFO L356 Elim1Store]: treesize reduction 61, result has 17.6 percent of original size [2022-11-02 20:05:49,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 61 [2022-11-02 20:05:49,910 INFO L356 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-11-02 20:05:49,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 45 [2022-11-02 20:05:50,294 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:05:50,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 77 treesize of output 85 [2022-11-02 20:05:50,342 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:05:50,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 72 [2022-11-02 20:05:50,624 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:05:50,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:05:51,019 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:05:51,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906854811] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:05:51,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:05:51,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 20 [2022-11-02 20:05:51,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244227969] [2022-11-02 20:05:51,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:05:51,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-02 20:05:51,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:05:51,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-02 20:05:51,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:05:51,023 INFO L87 Difference]: Start difference. First operand 655 states and 819 transitions. Second operand has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:54,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:05:54,272 INFO L93 Difference]: Finished difference Result 1627 states and 2080 transitions. [2022-11-02 20:05:54,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-02 20:05:54,273 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-02 20:05:54,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:05:54,277 INFO L225 Difference]: With dead ends: 1627 [2022-11-02 20:05:54,277 INFO L226 Difference]: Without dead ends: 917 [2022-11-02 20:05:54,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=448, Invalid=2204, Unknown=0, NotChecked=0, Total=2652 [2022-11-02 20:05:54,280 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 367 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:05:54,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 718 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 511 Invalid, 0 Unknown, 21 Unchecked, 1.4s Time] [2022-11-02 20:05:54,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2022-11-02 20:05:54,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 597. [2022-11-02 20:05:54,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.2919463087248322) internal successors, (770), 596 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:54,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 770 transitions. [2022-11-02 20:05:54,387 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 770 transitions. Word has length 30 [2022-11-02 20:05:54,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:05:54,387 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 770 transitions. [2022-11-02 20:05:54,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:54,388 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 770 transitions. [2022-11-02 20:05:54,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:05:54,389 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:05:54,389 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:05:54,429 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:05:54,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:05:54,614 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:05:54,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:05:54,614 INFO L85 PathProgramCache]: Analyzing trace with hash -583854831, now seen corresponding path program 1 times [2022-11-02 20:05:54,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:05:54,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256903434] [2022-11-02 20:05:54,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:05:54,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:05:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:05:54,708 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:05:54,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:05:54,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256903434] [2022-11-02 20:05:54,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256903434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:05:54,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:05:54,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:05:54,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449499571] [2022-11-02 20:05:54,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:05:54,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:05:54,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:05:54,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:05:54,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:05:54,722 INFO L87 Difference]: Start difference. First operand 597 states and 770 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:54,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:05:54,830 INFO L93 Difference]: Finished difference Result 1088 states and 1417 transitions. [2022-11-02 20:05:54,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:05:54,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-02 20:05:54,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:05:54,834 INFO L225 Difference]: With dead ends: 1088 [2022-11-02 20:05:54,834 INFO L226 Difference]: Without dead ends: 725 [2022-11-02 20:05:54,835 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 [2022-11-02 20:05:54,836 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 22 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:05:54,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 75 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:05:54,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2022-11-02 20:05:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 604. [2022-11-02 20:05:54,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 603 states have (on average 1.285240464344942) internal successors, (775), 603 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:54,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 775 transitions. [2022-11-02 20:05:54,929 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 775 transitions. Word has length 30 [2022-11-02 20:05:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:05:54,930 INFO L495 AbstractCegarLoop]: Abstraction has 604 states and 775 transitions. [2022-11-02 20:05:54,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:54,930 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 775 transitions. [2022-11-02 20:05:54,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:05:54,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:05:54,931 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:05:54,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:05:54,931 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:05:54,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:05:54,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1070079280, now seen corresponding path program 1 times [2022-11-02 20:05:54,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:05:54,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591399857] [2022-11-02 20:05:54,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:05:54,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:05:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:05:55,865 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:05:55,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:05:55,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591399857] [2022-11-02 20:05:55,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591399857] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:05:55,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451094403] [2022-11-02 20:05:55,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:05:55,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:05:55,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:05:55,870 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:05:55,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:05:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:05:56,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-02 20:05:56,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:05:56,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:05:56,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:56,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:56,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 21 treesize of output 25 [2022-11-02 20:05:56,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:56,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 17 [2022-11-02 20:05:56,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 13 [2022-11-02 20:05:56,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:05:56,194 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-02 20:05:56,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-02 20:05:56,583 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:05:56,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 53 [2022-11-02 20:05:56,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2022-11-02 20:05:56,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-11-02 20:05:56,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 22 [2022-11-02 20:05:56,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:05:56,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:05:56,624 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:05:56,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:05:56,650 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_choose_next_~node~0#1.offset| 8))) (and (forall ((v_ArrVal_1098 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_choose_next_~q#1.base| v_ArrVal_1098) |c_ULTIMATE.start_choose_next_~node~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_1099 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_choose_next_~q#1.base| v_ArrVal_1099) |c_ULTIMATE.start_choose_next_~node~0#1.base|) .cse0) 0)))) is different from false [2022-11-02 20:05:56,679 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 8))) (and (forall ((v_ArrVal_1098 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_1098) .cse0) .cse1))) (forall ((v_ArrVal_1099 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_1099) .cse0) .cse1) 0)))) is different from false [2022-11-02 20:05:57,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:57,017 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:05:57,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-02 20:05:57,031 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:05:57,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 20 [2022-11-02 20:05:57,075 INFO L356 Elim1Store]: treesize reduction 33, result has 38.9 percent of original size [2022-11-02 20:05:57,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 69 [2022-11-02 20:05:57,094 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-11-02 20:05:57,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 90 treesize of output 62 [2022-11-02 20:05:57,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:05:57,114 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:05:57,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 74 treesize of output 70 [2022-11-02 20:05:57,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:05:57,192 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-02 20:05:57,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451094403] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:05:57,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:05:57,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2022-11-02 20:05:57,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368419295] [2022-11-02 20:05:57,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:05:57,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-02 20:05:57,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:05:57,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-02 20:05:57,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=311, Unknown=2, NotChecked=74, Total=462 [2022-11-02 20:05:57,194 INFO L87 Difference]: Start difference. First operand 604 states and 775 transitions. Second operand has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:57,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:05:57,929 INFO L93 Difference]: Finished difference Result 985 states and 1277 transitions. [2022-11-02 20:05:57,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:05:57,930 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-02 20:05:57,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:05:57,932 INFO L225 Difference]: With dead ends: 985 [2022-11-02 20:05:57,933 INFO L226 Difference]: Without dead ends: 615 [2022-11-02 20:05:57,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=151, Invalid=555, Unknown=4, NotChecked=102, Total=812 [2022-11-02 20:05:57,935 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 112 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:05:57,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 344 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 109 Invalid, 0 Unknown, 177 Unchecked, 0.3s Time] [2022-11-02 20:05:57,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-11-02 20:05:58,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 597. [2022-11-02 20:05:58,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.278523489932886) internal successors, (762), 596 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:58,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 762 transitions. [2022-11-02 20:05:58,038 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 762 transitions. Word has length 33 [2022-11-02 20:05:58,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:05:58,038 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 762 transitions. [2022-11-02 20:05:58,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:58,039 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 762 transitions. [2022-11-02 20:05:58,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:05:58,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:05:58,040 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:05:58,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:05:58,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-02 20:05:58,254 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:05:58,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:05:58,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1610537933, now seen corresponding path program 1 times [2022-11-02 20:05:58,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:05:58,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444757084] [2022-11-02 20:05:58,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:05:58,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:05:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:05:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:05:58,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:05:58,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444757084] [2022-11-02 20:05:58,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444757084] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:05:58,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719933727] [2022-11-02 20:05:58,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:05:58,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:05:58,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:05:58,476 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:05:58,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:05:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:05:58,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-02 20:05:58,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:05:58,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:05:58,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:05:58,770 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:05:58,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:05:58,853 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:05:58,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719933727] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:05:58,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:05:58,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-11-02 20:05:58,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103302521] [2022-11-02 20:05:58,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:05:58,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:05:58,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:05:58,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:05:58,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:05:58,857 INFO L87 Difference]: Start difference. First operand 597 states and 762 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:59,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:05:59,132 INFO L93 Difference]: Finished difference Result 1030 states and 1337 transitions. [2022-11-02 20:05:59,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:05:59,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-02 20:05:59,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:05:59,137 INFO L225 Difference]: With dead ends: 1030 [2022-11-02 20:05:59,137 INFO L226 Difference]: Without dead ends: 667 [2022-11-02 20:05:59,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:05:59,139 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 64 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:05:59,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 116 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:05:59,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-11-02 20:05:59,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 620. [2022-11-02 20:05:59,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.2827140549273022) internal successors, (794), 619 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:59,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 794 transitions. [2022-11-02 20:05:59,240 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 794 transitions. Word has length 38 [2022-11-02 20:05:59,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:05:59,240 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 794 transitions. [2022-11-02 20:05:59,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:59,241 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 794 transitions. [2022-11-02 20:05:59,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:05:59,242 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:05:59,242 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:05:59,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:05:59,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:05:59,458 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:05:59,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:05:59,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1871575436, now seen corresponding path program 2 times [2022-11-02 20:05:59,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:05:59,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118413296] [2022-11-02 20:05:59,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:05:59,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:05:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:06:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:06:00,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:06:00,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118413296] [2022-11-02 20:06:00,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118413296] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:06:00,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629451292] [2022-11-02 20:06:00,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:06:00,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:06:00,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:06:00,858 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:06:00,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:06:01,113 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:06:01,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:06:01,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-02 20:06:01,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:06:01,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:01,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:01,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 [2022-11-02 20:06:01,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:01,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:01,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 [2022-11-02 20:06:01,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 19 [2022-11-02 20:06:01,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 19 [2022-11-02 20:06:01,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:06:01,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:06:01,701 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:06:01,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:01,706 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:06:01,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 38 [2022-11-02 20:06:01,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:01,722 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:06:01,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-11-02 20:06:01,730 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:06:01,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:06:03,808 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1334 Int)) (or (forall ((v_ArrVal_1327 (Array Int Int)) (v_ArrVal_1336 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_1334 (store v_ArrVal_1327 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1334 v_ArrVal_1327) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1334 v_ArrVal_1336) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)) v_ArrVal_1334) 8))) (not (< v_ArrVal_1334 |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1334 Int)) (or (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1330 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_1334 (store v_ArrVal_1325 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1334 v_ArrVal_1325) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_1334 v_ArrVal_1330) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1334)) v_ArrVal_1334) 8) 0)) (not (< v_ArrVal_1334 |c_#StackHeapBarrier|))))) is different from false [2022-11-02 20:06:08,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 104 [2022-11-02 20:06:08,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 128 [2022-11-02 20:06:08,063 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:06:08,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 134 treesize of output 136 [2022-11-02 20:06:08,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 78 treesize of output 76 [2022-11-02 20:06:08,090 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:06:08,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 95 [2022-11-02 20:06:08,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2022-11-02 20:06:08,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 9 not checked. [2022-11-02 20:06:08,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629451292] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:06:08,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:06:08,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-11-02 20:06:08,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517400861] [2022-11-02 20:06:08,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:06:08,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 20:06:08,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:06:08,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 20:06:08,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=189, Unknown=1, NotChecked=28, Total=272 [2022-11-02 20:06:08,470 INFO L87 Difference]: Start difference. First operand 620 states and 794 transitions. Second operand has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:06:10,755 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#queue~0#1.base|) (forall ((v_ArrVal_1334 Int)) (or (forall ((v_ArrVal_1327 (Array Int Int)) (v_ArrVal_1336 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_1334 (store v_ArrVal_1327 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1334 v_ArrVal_1327) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1334 v_ArrVal_1336) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)) v_ArrVal_1334) 8))) (not (< v_ArrVal_1334 |c_#StackHeapBarrier|)))) (= |c_ULTIMATE.start_check_queue_~n~0#1.base| 0) (= .cse0 |c_ULTIMATE.start_check_queue_~n~0#1.offset|) (= |c_ULTIMATE.start_main_~#queue~0#1.offset| 0) (= |c_ULTIMATE.start_check_queue_~n~0#1.base| .cse1) (forall ((v_ArrVal_1334 Int)) (or (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1330 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_1334 (store v_ArrVal_1325 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1334 v_ArrVal_1325) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_1334 v_ArrVal_1330) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1334)) v_ArrVal_1334) 8) 0)) (not (< v_ArrVal_1334 |c_#StackHeapBarrier|)))) (= |c_ULTIMATE.start_check_queue_~n~0#1.offset| 0) (= .cse0 0) (= .cse1 0))) is different from false [2022-11-02 20:06:12,759 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#queue~0#1.base|) (forall ((v_ArrVal_1334 Int)) (or (forall ((v_ArrVal_1327 (Array Int Int)) (v_ArrVal_1336 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_1334 (store v_ArrVal_1327 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1334 v_ArrVal_1327) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1334 v_ArrVal_1336) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)) v_ArrVal_1334) 8))) (not (< v_ArrVal_1334 |c_#StackHeapBarrier|)))) (= |c_ULTIMATE.start_main_~#queue~0#1.offset| 0) (forall ((v_ArrVal_1334 Int)) (or (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1330 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_1334 (store v_ArrVal_1325 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1334 v_ArrVal_1325) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_1334 v_ArrVal_1330) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1334)) v_ArrVal_1334) 8) 0)) (not (< v_ArrVal_1334 |c_#StackHeapBarrier|)))) (= (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 false [2022-11-02 20:06:14,958 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#queue~0#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#queue~0#1.base|) (= |c_ULTIMATE.start_choose_next_~q#1.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) (forall ((v_ArrVal_1334 Int)) (or (forall ((v_ArrVal_1327 (Array Int Int)) (v_ArrVal_1336 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_1334 (store v_ArrVal_1327 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1334 v_ArrVal_1327) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1334 v_ArrVal_1336) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)) v_ArrVal_1334) 8))) (not (< v_ArrVal_1334 |c_#StackHeapBarrier|)))) (= |c_ULTIMATE.start_check_queue_~n~0#1.base| 0) (= .cse0 |c_ULTIMATE.start_check_queue_~n~0#1.offset|) (= |c_ULTIMATE.start_main_~#queue~0#1.offset| 0) (= |c_ULTIMATE.start_check_queue_~n~0#1.base| .cse1) (forall ((v_ArrVal_1334 Int)) (or (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1330 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_1334 (store v_ArrVal_1325 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1334 v_ArrVal_1325) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_1334 v_ArrVal_1330) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1334)) v_ArrVal_1334) 8) 0)) (not (< v_ArrVal_1334 |c_#StackHeapBarrier|)))) (= |c_ULTIMATE.start_check_queue_~n~0#1.offset| 0) (= .cse0 0) (= .cse1 0))) is different from false [2022-11-02 20:06:15,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:06:15,150 INFO L93 Difference]: Finished difference Result 1379 states and 1817 transitions. [2022-11-02 20:06:15,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:06:15,151 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-02 20:06:15,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:06:15,155 INFO L225 Difference]: With dead ends: 1379 [2022-11-02 20:06:15,155 INFO L226 Difference]: Without dead ends: 1052 [2022-11-02 20:06:15,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=131, Invalid=433, Unknown=4, NotChecked=188, Total=756 [2022-11-02 20:06:15,158 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 90 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:06:15,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 302 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 116 Unchecked, 0.3s Time] [2022-11-02 20:06:15,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2022-11-02 20:06:15,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 960. [2022-11-02 20:06:15,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 959 states have (on average 1.3034410844629822) internal successors, (1250), 959 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:06:15,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1250 transitions. [2022-11-02 20:06:15,352 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1250 transitions. Word has length 41 [2022-11-02 20:06:15,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:06:15,352 INFO L495 AbstractCegarLoop]: Abstraction has 960 states and 1250 transitions. [2022-11-02 20:06:15,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:06:15,353 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1250 transitions. [2022-11-02 20:06:15,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:06:15,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:06:15,355 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-02 20:06:15,398 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:06:15,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-02 20:06:15,570 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:06:15,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:06:15,570 INFO L85 PathProgramCache]: Analyzing trace with hash -2115090350, now seen corresponding path program 4 times [2022-11-02 20:06:15,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:06:15,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547754728] [2022-11-02 20:06:15,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:06:15,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:06:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:06:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:06:21,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:06:21,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547754728] [2022-11-02 20:06:21,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547754728] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:06:21,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938150409] [2022-11-02 20:06:21,105 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:06:21,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:06:21,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:06:21,106 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:06:21,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c9a910d-af67-4231-a183-56e8f9e29d6e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:06:21,390 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:06:21,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:06:21,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 200 conjunts are in the unsatisfiable core [2022-11-02 20:06:21,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:06:21,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:06:21,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:21,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:21,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2022-11-02 20:06:21,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:21,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:21,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2022-11-02 20:06:21,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:06:21,567 INFO L356 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-11-02 20:06:21,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 29 [2022-11-02 20:06:21,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:06:22,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:22,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:22,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 39 [2022-11-02 20:06:22,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:22,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:22,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 45 [2022-11-02 20:06:22,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:22,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:22,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-11-02 20:06:22,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 45 treesize of output 36 [2022-11-02 20:06:22,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 32 [2022-11-02 20:06:22,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:06:22,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 11 [2022-11-02 20:06:22,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:22,314 INFO L356 Elim1Store]: treesize reduction 50, result has 37.5 percent of original size [2022-11-02 20:06:22,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 53 [2022-11-02 20:06:23,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:23,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:23,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:23,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:23,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2022-11-02 20:06:23,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:23,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:23,277 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-11-02 20:06:23,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 107 treesize of output 82 [2022-11-02 20:06:23,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:23,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:23,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 27 [2022-11-02 20:06:23,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 19 [2022-11-02 20:06:23,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 88 treesize of output 69 [2022-11-02 20:06:23,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:06:23,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:06:23,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:23,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:23,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:23,360 INFO L356 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2022-11-02 20:06:23,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 33 [2022-11-02 20:06:23,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:06:23,958 INFO L356 Elim1Store]: treesize reduction 63, result has 14.9 percent of original size [2022-11-02 20:06:23,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 202 treesize of output 100 [2022-11-02 20:06:23,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:23,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:06:23,989 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-11-02 20:06:23,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 29 [2022-11-02 20:06:24,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:06:24,089 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:06:24,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:06:24,373 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1568 (Array Int Int)) (v_ArrVal_1567 (Array Int Int)) (v_ArrVal_1578 (Array Int Int)) (v_ArrVal_1575 (Array Int Int)) (v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1569 Int) (v_ArrVal_1570 (Array Int Int))) (or (< 0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_1569 (store v_ArrVal_1570 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1569 v_ArrVal_1570) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1569 v_ArrVal_1578) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0))) (.cse0 (store (store |c_#memory_$Pointer$.base| v_ArrVal_1569 (store v_ArrVal_1574 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1569 v_ArrVal_1574) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_1569 v_ArrVal_1567) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1569)))) (let ((.cse1 (select (select .cse0 v_ArrVal_1569) 8)) (.cse2 (+ 8 (select (select .cse3 v_ArrVal_1569) 8)))) (select (select (store (store |c_#memory_int| v_ArrVal_1569 v_ArrVal_1575) |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_1568) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4))))) (not (= (select |c_#valid| v_ArrVal_1569) 0)) (not (< v_ArrVal_1569 |c_#StackHeapBarrier|)))) is different from false [2022-11-02 20:06:25,015 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1568 (Array Int Int)) (v_ArrVal_1567 (Array Int Int)) (v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1578 (Array Int Int)) (v_ArrVal_1575 (Array Int Int)) (v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1550 (Array Int Int)) (v_ArrVal_1570 (Array Int Int)) (v_ArrVal_1553 Int) (v_ArrVal_1569 Int)) (or (not (< v_ArrVal_1553 |c_#StackHeapBarrier|)) (not (= (select |c_#valid| v_ArrVal_1553) 0)) (< 0 (let ((.cse3 (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_1553 (store v_ArrVal_1546 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1553 v_ArrVal_1546) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1553 v_ArrVal_1545) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)))) (store (store .cse5 v_ArrVal_1569 (store v_ArrVal_1570 8 (select (select (store .cse5 v_ArrVal_1569 v_ArrVal_1570) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse5 v_ArrVal_1569 v_ArrVal_1578) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)))) (.cse0 (let ((.cse4 (store (store |c_#memory_$Pointer$.base| v_ArrVal_1553 (store v_ArrVal_1561 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1553 v_ArrVal_1561) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_1553 v_ArrVal_1559) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1553)))) (store (store .cse4 v_ArrVal_1569 (store v_ArrVal_1574 8 (select (select (store .cse4 v_ArrVal_1569 v_ArrVal_1574) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse4 v_ArrVal_1569 v_ArrVal_1567) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1569))))) (let ((.cse1 (select (select .cse0 v_ArrVal_1569) 8)) (.cse2 (+ (select (select .cse3 v_ArrVal_1569) 8) 8))) (select (select (store (store (store (store |c_#memory_int| v_ArrVal_1553 v_ArrVal_1550) |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_1548) v_ArrVal_1569 v_ArrVal_1575) |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_1568) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4))))) (not (= (select (store |c_#valid| v_ArrVal_1553 1) v_ArrVal_1569) 0)) (not (< v_ArrVal_1569 |c_#StackHeapBarrier|)))) is different from false [2022-11-02 20:06:26,535 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:06:26,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29539 treesize of output 28928 [2022-11-02 20:06:26,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28310 treesize of output 23414 [2022-11-02 20:06:26,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11707 treesize of output 11095 [2022-11-02 20:06:26,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22802 treesize of output 20354 [2022-11-02 20:06:26,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20354 treesize of output 19130 [2022-11-02 20:06:59,208 WARN L234 SmtUtils]: Spent 10.56s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:07:28,734 WARN L234 SmtUtils]: Spent 10.66s on a formula simplification that was a NOOP. DAG size: 113 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)