./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- 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-b5237d8 [2022-11-21 09:08:05,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 09:08:05,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 09:08:05,560 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 09:08:05,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 09:08:05,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 09:08:05,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 09:08:05,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 09:08:05,568 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 09:08:05,569 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 09:08:05,570 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 09:08:05,572 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 09:08:05,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 09:08:05,573 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 09:08:05,575 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 09:08:05,576 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 09:08:05,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 09:08:05,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 09:08:05,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 09:08:05,583 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 09:08:05,585 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 09:08:05,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 09:08:05,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 09:08:05,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 09:08:05,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 09:08:05,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 09:08:05,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 09:08:05,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 09:08:05,596 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 09:08:05,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 09:08:05,598 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 09:08:05,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 09:08:05,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 09:08:05,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 09:08:05,602 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 09:08:05,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 09:08:05,603 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 09:08:05,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 09:08:05,604 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 09:08:05,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 09:08:05,606 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 09:08:05,607 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 09:08:05,632 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 09:08:05,633 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 09:08:05,633 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 09:08:05,633 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 09:08:05,634 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 09:08:05,634 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 09:08:05,635 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 09:08:05,635 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 09:08:05,636 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 09:08:05,636 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 09:08:05,636 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 09:08:05,637 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 09:08:05,637 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 09:08:05,637 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 09:08:05,637 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 09:08:05,637 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 09:08:05,638 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 09:08:05,638 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 09:08:05,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 09:08:05,638 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 09:08:05,639 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 09:08:05,639 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 09:08:05,639 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 09:08:05,639 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 09:08:05,640 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 09:08:05,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 09:08:05,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 09:08:05,641 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 09:08:05,641 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 09:08:05,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 09:08:05,641 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_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/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_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2022-11-21 09:08:05,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 09:08:05,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 09:08:05,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 09:08:05,929 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 09:08:05,930 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 09:08:05,933 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-21 09:08:09,191 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 09:08:09,500 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 09:08:09,501 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-21 09:08:09,524 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/data/c1643f6b7/b0f1fedc63794569a9f21f72f471b28f/FLAG17b72d4a7 [2022-11-21 09:08:09,552 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/data/c1643f6b7/b0f1fedc63794569a9f21f72f471b28f [2022-11-21 09:08:09,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 09:08:09,556 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 09:08:09,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 09:08:09,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 09:08:09,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 09:08:09,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:08:09" (1/1) ... [2022-11-21 09:08:09,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4942a413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:08:09, skipping insertion in model container [2022-11-21 09:08:09,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:08:09" (1/1) ... [2022-11-21 09:08:09,579 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 09:08:09,630 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 09:08:10,172 WARN L237 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_c6975838-0aed-4625-9f97-fa927fd8c62d/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-21 09:08:10,178 WARN L237 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_c6975838-0aed-4625-9f97-fa927fd8c62d/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-21 09:08:10,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 09:08:10,196 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 09:08:10,249 WARN L237 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_c6975838-0aed-4625-9f97-fa927fd8c62d/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-21 09:08:10,257 WARN L237 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_c6975838-0aed-4625-9f97-fa927fd8c62d/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-21 09:08:10,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 09:08:10,348 INFO L208 MainTranslator]: Completed translation [2022-11-21 09:08:10,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:08:10 WrapperNode [2022-11-21 09:08:10,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 09:08:10,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 09:08:10,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 09:08:10,350 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 09:08:10,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:08:10" (1/1) ... [2022-11-21 09:08:10,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:08:10" (1/1) ... [2022-11-21 09:08:10,425 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-11-21 09:08:10,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 09:08:10,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 09:08:10,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 09:08:10,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 09:08:10,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:08:10" (1/1) ... [2022-11-21 09:08:10,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:08:10" (1/1) ... [2022-11-21 09:08:10,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:08:10" (1/1) ... [2022-11-21 09:08:10,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:08:10" (1/1) ... [2022-11-21 09:08:10,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:08:10" (1/1) ... [2022-11-21 09:08:10,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:08:10" (1/1) ... [2022-11-21 09:08:10,460 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:08:10" (1/1) ... [2022-11-21 09:08:10,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:08:10" (1/1) ... [2022-11-21 09:08:10,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 09:08:10,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 09:08:10,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 09:08:10,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 09:08:10,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:08:10" (1/1) ... [2022-11-21 09:08:10,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 09:08:10,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:08:10,530 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 09:08:10,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 09:08:10,584 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-21 09:08:10,584 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-21 09:08:10,584 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-21 09:08:10,585 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-21 09:08:10,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 09:08:10,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 09:08:10,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 09:08:10,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 09:08:10,589 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-21 09:08:10,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 09:08:10,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 09:08:10,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 09:08:10,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 09:08:10,592 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 09:08:10,882 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 09:08:10,900 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 09:08:11,591 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 09:08:11,602 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 09:08:11,603 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-21 09:08:11,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:08:11 BoogieIcfgContainer [2022-11-21 09:08:11,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 09:08:11,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 09:08:11,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 09:08:11,613 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 09:08:11,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:08:09" (1/3) ... [2022-11-21 09:08:11,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424aae66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:08:11, skipping insertion in model container [2022-11-21 09:08:11,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:08:10" (2/3) ... [2022-11-21 09:08:11,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424aae66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:08:11, skipping insertion in model container [2022-11-21 09:08:11,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:08:11" (3/3) ... [2022-11-21 09:08:11,616 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-11-21 09:08:11,639 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 09:08:11,639 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2022-11-21 09:08:11,639 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 09:08:11,757 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-21 09:08:11,796 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 09:08:11,813 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 291 transitions, 598 flow [2022-11-21 09:08:11,816 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 285 places, 291 transitions, 598 flow [2022-11-21 09:08:11,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 285 places, 291 transitions, 598 flow [2022-11-21 09:08:11,944 INFO L130 PetriNetUnfolder]: 13/289 cut-off events. [2022-11-21 09:08:11,944 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-21 09:08:11,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 289 events. 13/289 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 675 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 190. Up to 3 conditions per place. [2022-11-21 09:08:11,979 INFO L119 LiptonReduction]: Number of co-enabled transitions 18694 [2022-11-21 09:08:33,988 INFO L134 LiptonReduction]: Checked pairs total: 59291 [2022-11-21 09:08:33,989 INFO L136 LiptonReduction]: Total number of compositions: 457 [2022-11-21 09:08:34,001 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 109 places, 109 transitions, 234 flow [2022-11-21 09:08:34,256 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5589 states, 4122 states have (on average 3.8469189713731198) internal successors, (15857), 5588 states have internal predecessors, (15857), 0 states have call successors, (0), 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-21 09:08:34,282 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 09:08:34,289 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@186db3da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 09:08:34,290 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2022-11-21 09:08:34,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 5589 states, 4122 states have (on average 3.8469189713731198) internal successors, (15857), 5588 states have internal predecessors, (15857), 0 states have call successors, (0), 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-21 09:08:34,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 09:08:34,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:08:34,319 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 09:08:34,320 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:08:34,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:08:34,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1279, now seen corresponding path program 1 times [2022-11-21 09:08:34,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:08:34,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537487944] [2022-11-21 09:08:34,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:08:34,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:08:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:08:34,456 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-21 09:08:34,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:08:34,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537487944] [2022-11-21 09:08:34,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537487944] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:08:34,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:08:34,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 09:08:34,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739987603] [2022-11-21 09:08:34,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:08:34,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 09:08:34,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:08:34,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 09:08:34,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 09:08:34,520 INFO L87 Difference]: Start difference. First operand has 5589 states, 4122 states have (on average 3.8469189713731198) internal successors, (15857), 5588 states have internal predecessors, (15857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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-21 09:08:34,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:08:34,766 INFO L93 Difference]: Finished difference Result 2668 states and 7688 transitions. [2022-11-21 09:08:34,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 09:08:34,770 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2022-11-21 09:08:34,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:08:34,816 INFO L225 Difference]: With dead ends: 2668 [2022-11-21 09:08:34,817 INFO L226 Difference]: Without dead ends: 2668 [2022-11-21 09:08:34,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 09:08:34,821 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:08:34,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:08:34,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2022-11-21 09:08:35,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2668. [2022-11-21 09:08:35,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 2340 states have (on average 3.2854700854700853) internal successors, (7688), 2667 states have internal predecessors, (7688), 0 states have call successors, (0), 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-21 09:08:35,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 7688 transitions. [2022-11-21 09:08:35,045 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 7688 transitions. Word has length 1 [2022-11-21 09:08:35,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:08:35,045 INFO L495 AbstractCegarLoop]: Abstraction has 2668 states and 7688 transitions. [2022-11-21 09:08:35,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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-21 09:08:35,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 7688 transitions. [2022-11-21 09:08:35,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-21 09:08:35,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:08:35,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-21 09:08:35,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 09:08:35,050 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:08:35,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:08:35,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1279544, now seen corresponding path program 1 times [2022-11-21 09:08:35,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:08:35,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607775059] [2022-11-21 09:08:35,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:08:35,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:08:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:08:35,426 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-21 09:08:35,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:08:35,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607775059] [2022-11-21 09:08:35,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607775059] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:08:35,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:08:35,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 09:08:35,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026040438] [2022-11-21 09:08:35,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:08:35,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:08:35,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:08:35,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:08:35,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:08:35,432 INFO L87 Difference]: Start difference. First operand 2668 states and 7688 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:08:35,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:08:35,592 INFO L93 Difference]: Finished difference Result 2618 states and 7583 transitions. [2022-11-21 09:08:35,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:08:35,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-21 09:08:35,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:08:35,612 INFO L225 Difference]: With dead ends: 2618 [2022-11-21 09:08:35,613 INFO L226 Difference]: Without dead ends: 2618 [2022-11-21 09:08:35,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:08:35,615 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 65 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:08:35,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 4 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:08:35,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2022-11-21 09:08:35,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2618. [2022-11-21 09:08:35,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2618 states, 2310 states have (on average 3.2826839826839826) internal successors, (7583), 2617 states have internal predecessors, (7583), 0 states have call successors, (0), 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-21 09:08:35,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 7583 transitions. [2022-11-21 09:08:35,786 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 7583 transitions. Word has length 3 [2022-11-21 09:08:35,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:08:35,788 INFO L495 AbstractCegarLoop]: Abstraction has 2618 states and 7583 transitions. [2022-11-21 09:08:35,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:08:35,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 7583 transitions. [2022-11-21 09:08:35,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-21 09:08:35,788 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:08:35,789 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-21 09:08:35,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 09:08:35,789 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:08:35,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:08:35,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1279543, now seen corresponding path program 1 times [2022-11-21 09:08:35,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:08:35,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879789568] [2022-11-21 09:08:35,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:08:35,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:08:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:08:35,864 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-21 09:08:35,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:08:35,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879789568] [2022-11-21 09:08:35,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879789568] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:08:35,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:08:35,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 09:08:35,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144745144] [2022-11-21 09:08:35,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:08:35,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:08:35,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:08:35,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:08:35,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:08:35,868 INFO L87 Difference]: Start difference. First operand 2618 states and 7583 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:08:36,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:08:36,007 INFO L93 Difference]: Finished difference Result 2568 states and 7478 transitions. [2022-11-21 09:08:36,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:08:36,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-21 09:08:36,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:08:36,026 INFO L225 Difference]: With dead ends: 2568 [2022-11-21 09:08:36,026 INFO L226 Difference]: Without dead ends: 2568 [2022-11-21 09:08:36,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:08:36,028 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:08:36,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 4 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:08:36,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2022-11-21 09:08:36,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2568. [2022-11-21 09:08:36,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2568 states, 2280 states have (on average 3.2798245614035086) internal successors, (7478), 2567 states have internal predecessors, (7478), 0 states have call successors, (0), 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-21 09:08:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 7478 transitions. [2022-11-21 09:08:36,120 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 7478 transitions. Word has length 3 [2022-11-21 09:08:36,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:08:36,121 INFO L495 AbstractCegarLoop]: Abstraction has 2568 states and 7478 transitions. [2022-11-21 09:08:36,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:08:36,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 7478 transitions. [2022-11-21 09:08:36,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 09:08:36,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:08:36,122 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 09:08:36,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 09:08:36,123 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:08:36,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:08:36,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1229669010, now seen corresponding path program 1 times [2022-11-21 09:08:36,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:08:36,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779118552] [2022-11-21 09:08:36,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:08:36,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:08:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:08:36,294 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-21 09:08:36,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:08:36,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779118552] [2022-11-21 09:08:36,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779118552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:08:36,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:08:36,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 09:08:36,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192255800] [2022-11-21 09:08:36,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:08:36,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 09:08:36,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:08:36,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 09:08:36,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 09:08:36,296 INFO L87 Difference]: Start difference. First operand 2568 states and 7478 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-21 09:08:36,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:08:36,433 INFO L93 Difference]: Finished difference Result 1952 states and 5508 transitions. [2022-11-21 09:08:36,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:08:36,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-21 09:08:36,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:08:36,446 INFO L225 Difference]: With dead ends: 1952 [2022-11-21 09:08:36,446 INFO L226 Difference]: Without dead ends: 1952 [2022-11-21 09:08:36,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 09:08:36,447 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 123 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:08:36,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 4 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:08:36,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2022-11-21 09:08:36,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1952. [2022-11-21 09:08:36,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1760 states have (on average 3.1295454545454544) internal successors, (5508), 1951 states have internal predecessors, (5508), 0 states have call successors, (0), 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-21 09:08:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 5508 transitions. [2022-11-21 09:08:36,515 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 5508 transitions. Word has length 5 [2022-11-21 09:08:36,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:08:36,515 INFO L495 AbstractCegarLoop]: Abstraction has 1952 states and 5508 transitions. [2022-11-21 09:08:36,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-21 09:08:36,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 5508 transitions. [2022-11-21 09:08:36,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 09:08:36,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:08:36,516 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 09:08:36,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 09:08:36,517 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:08:36,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:08:36,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1229669011, now seen corresponding path program 1 times [2022-11-21 09:08:36,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:08:36,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306367390] [2022-11-21 09:08:36,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:08:36,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:08:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:08:36,758 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-21 09:08:36,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:08:36,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306367390] [2022-11-21 09:08:36,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306367390] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:08:36,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:08:36,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 09:08:36,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622295882] [2022-11-21 09:08:36,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:08:36,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:08:36,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:08:36,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:08:36,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:08:36,761 INFO L87 Difference]: Start difference. First operand 1952 states and 5508 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-21 09:08:36,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:08:36,874 INFO L93 Difference]: Finished difference Result 1336 states and 3538 transitions. [2022-11-21 09:08:36,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:08:36,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-21 09:08:36,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:08:36,882 INFO L225 Difference]: With dead ends: 1336 [2022-11-21 09:08:36,883 INFO L226 Difference]: Without dead ends: 1336 [2022-11-21 09:08:36,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:08:36,884 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 59 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:08:36,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 4 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:08:36,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2022-11-21 09:08:36,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1336. [2022-11-21 09:08:36,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1240 states have (on average 2.8532258064516127) internal successors, (3538), 1335 states have internal predecessors, (3538), 0 states have call successors, (0), 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-21 09:08:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 3538 transitions. [2022-11-21 09:08:36,924 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 3538 transitions. Word has length 5 [2022-11-21 09:08:36,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:08:36,925 INFO L495 AbstractCegarLoop]: Abstraction has 1336 states and 3538 transitions. [2022-11-21 09:08:36,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-21 09:08:36,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 3538 transitions. [2022-11-21 09:08:36,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 09:08:36,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:08:36,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 09:08:36,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 09:08:36,926 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:08:36,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:08:36,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1229601986, now seen corresponding path program 1 times [2022-11-21 09:08:36,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:08:36,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950502996] [2022-11-21 09:08:36,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:08:36,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:08:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:08:37,078 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-21 09:08:37,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:08:37,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950502996] [2022-11-21 09:08:37,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950502996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:08:37,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:08:37,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 09:08:37,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801876306] [2022-11-21 09:08:37,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:08:37,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:08:37,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:08:37,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:08:37,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:08:37,081 INFO L87 Difference]: Start difference. First operand 1336 states and 3538 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-21 09:08:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:08:37,181 INFO L93 Difference]: Finished difference Result 1190 states and 3162 transitions. [2022-11-21 09:08:37,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:08:37,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-21 09:08:37,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:08:37,189 INFO L225 Difference]: With dead ends: 1190 [2022-11-21 09:08:37,189 INFO L226 Difference]: Without dead ends: 1190 [2022-11-21 09:08:37,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:08:37,190 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:08:37,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 4 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:08:37,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2022-11-21 09:08:37,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1190. [2022-11-21 09:08:37,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1120 states have (on average 2.8232142857142857) internal successors, (3162), 1189 states have internal predecessors, (3162), 0 states have call successors, (0), 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-21 09:08:37,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 3162 transitions. [2022-11-21 09:08:37,227 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 3162 transitions. Word has length 5 [2022-11-21 09:08:37,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:08:37,227 INFO L495 AbstractCegarLoop]: Abstraction has 1190 states and 3162 transitions. [2022-11-21 09:08:37,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-21 09:08:37,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 3162 transitions. [2022-11-21 09:08:37,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 09:08:37,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:08:37,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 09:08:37,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 09:08:37,229 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:08:37,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:08:37,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1229601987, now seen corresponding path program 1 times [2022-11-21 09:08:37,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:08:37,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178770975] [2022-11-21 09:08:37,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:08:37,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:08:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:08:37,431 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-21 09:08:37,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:08:37,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178770975] [2022-11-21 09:08:37,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178770975] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:08:37,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:08:37,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 09:08:37,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021239001] [2022-11-21 09:08:37,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:08:37,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:08:37,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:08:37,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:08:37,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:08:37,433 INFO L87 Difference]: Start difference. First operand 1190 states and 3162 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-21 09:08:37,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:08:37,533 INFO L93 Difference]: Finished difference Result 1010 states and 2698 transitions. [2022-11-21 09:08:37,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:08:37,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-21 09:08:37,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:08:37,540 INFO L225 Difference]: With dead ends: 1010 [2022-11-21 09:08:37,540 INFO L226 Difference]: Without dead ends: 1010 [2022-11-21 09:08:37,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:08:37,541 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:08:37,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:08:37,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2022-11-21 09:08:37,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1010. [2022-11-21 09:08:37,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 968 states have (on average 2.7871900826446283) internal successors, (2698), 1009 states have internal predecessors, (2698), 0 states have call successors, (0), 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-21 09:08:37,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 2698 transitions. [2022-11-21 09:08:37,616 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 2698 transitions. Word has length 5 [2022-11-21 09:08:37,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:08:37,616 INFO L495 AbstractCegarLoop]: Abstraction has 1010 states and 2698 transitions. [2022-11-21 09:08:37,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-21 09:08:37,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 2698 transitions. [2022-11-21 09:08:37,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 09:08:37,618 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:08:37,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 09:08:37,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 09:08:37,618 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:08:37,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:08:37,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1229602043, now seen corresponding path program 1 times [2022-11-21 09:08:37,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:08:37,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542552320] [2022-11-21 09:08:37,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:08:37,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:08:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:08:38,678 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-21 09:08:38,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:08:38,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542552320] [2022-11-21 09:08:38,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542552320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:08:38,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:08:38,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 09:08:38,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063584833] [2022-11-21 09:08:38,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:08:38,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:08:38,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:08:38,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:08:38,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:08:38,680 INFO L87 Difference]: Start difference. First operand 1010 states and 2698 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-21 09:08:38,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:08:38,979 INFO L93 Difference]: Finished difference Result 1016 states and 2711 transitions. [2022-11-21 09:08:38,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:08:38,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-21 09:08:38,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:08:38,991 INFO L225 Difference]: With dead ends: 1016 [2022-11-21 09:08:38,996 INFO L226 Difference]: Without dead ends: 1016 [2022-11-21 09:08:38,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:08:38,997 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 09:08:38,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 8 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 09:08:39,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2022-11-21 09:08:39,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1011. [2022-11-21 09:08:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 969 states have (on average 2.787409700722394) internal successors, (2701), 1010 states have internal predecessors, (2701), 0 states have call successors, (0), 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-21 09:08:39,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 2701 transitions. [2022-11-21 09:08:39,030 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 2701 transitions. Word has length 5 [2022-11-21 09:08:39,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:08:39,031 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 2701 transitions. [2022-11-21 09:08:39,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-21 09:08:39,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 2701 transitions. [2022-11-21 09:08:39,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-21 09:08:39,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:08:39,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-21 09:08:39,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 09:08:39,034 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:08:39,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:08:39,035 INFO L85 PathProgramCache]: Analyzing trace with hash -534759366, now seen corresponding path program 1 times [2022-11-21 09:08:39,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:08:39,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996739286] [2022-11-21 09:08:39,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:08:39,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:08:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:08:39,676 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-21 09:08:39,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:08:39,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996739286] [2022-11-21 09:08:39,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996739286] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:08:39,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:08:39,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 09:08:39,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696451820] [2022-11-21 09:08:39,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:08:39,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 09:08:39,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:08:39,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 09:08:39,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 09:08:39,680 INFO L87 Difference]: Start difference. First operand 1011 states and 2701 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-21 09:08:39,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:08:39,902 INFO L93 Difference]: Finished difference Result 1286 states and 3454 transitions. [2022-11-21 09:08:39,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 09:08:39,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-21 09:08:39,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:08:39,909 INFO L225 Difference]: With dead ends: 1286 [2022-11-21 09:08:39,910 INFO L226 Difference]: Without dead ends: 1286 [2022-11-21 09:08:39,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 09:08:39,912 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 30 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 09:08:39,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 12 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 09:08:39,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2022-11-21 09:08:39,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1094. [2022-11-21 09:08:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 1052 states have (on average 2.826045627376426) internal successors, (2973), 1093 states have internal predecessors, (2973), 0 states have call successors, (0), 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-21 09:08:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 2973 transitions. [2022-11-21 09:08:39,950 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 2973 transitions. Word has length 6 [2022-11-21 09:08:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:08:39,951 INFO L495 AbstractCegarLoop]: Abstraction has 1094 states and 2973 transitions. [2022-11-21 09:08:39,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-21 09:08:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 2973 transitions. [2022-11-21 09:08:39,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-21 09:08:39,952 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:08:39,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-21 09:08:39,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 09:08:39,954 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:08:39,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:08:39,954 INFO L85 PathProgramCache]: Analyzing trace with hash -537040297, now seen corresponding path program 1 times [2022-11-21 09:08:39,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:08:39,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457932997] [2022-11-21 09:08:39,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:08:39,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:08:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:08:40,215 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-21 09:08:40,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:08:40,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457932997] [2022-11-21 09:08:40,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457932997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:08:40,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:08:40,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 09:08:40,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650632350] [2022-11-21 09:08:40,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:08:40,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 09:08:40,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:08:40,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 09:08:40,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 09:08:40,218 INFO L87 Difference]: Start difference. First operand 1094 states and 2973 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-21 09:08:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:08:40,417 INFO L93 Difference]: Finished difference Result 1280 states and 3468 transitions. [2022-11-21 09:08:40,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 09:08:40,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-21 09:08:40,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:08:40,438 INFO L225 Difference]: With dead ends: 1280 [2022-11-21 09:08:40,446 INFO L226 Difference]: Without dead ends: 1280 [2022-11-21 09:08:40,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-21 09:08:40,447 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 100 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 09:08:40,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 12 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 09:08:40,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2022-11-21 09:08:40,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 998. [2022-11-21 09:08:40,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 970 states have (on average 2.8072164948453606) internal successors, (2723), 997 states have internal predecessors, (2723), 0 states have call successors, (0), 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-21 09:08:40,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 2723 transitions. [2022-11-21 09:08:40,483 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 2723 transitions. Word has length 6 [2022-11-21 09:08:40,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:08:40,484 INFO L495 AbstractCegarLoop]: Abstraction has 998 states and 2723 transitions. [2022-11-21 09:08:40,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-21 09:08:40,484 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 2723 transitions. [2022-11-21 09:08:40,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 09:08:40,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:08:40,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:08:40,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 09:08:40,492 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:08:40,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:08:40,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1494000732, now seen corresponding path program 1 times [2022-11-21 09:08:40,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:08:40,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042008690] [2022-11-21 09:08:40,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:08:40,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:08:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:08:40,581 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-21 09:08:40,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:08:40,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042008690] [2022-11-21 09:08:40,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042008690] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:08:40,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:08:40,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 09:08:40,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936909360] [2022-11-21 09:08:40,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:08:40,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:08:40,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:08:40,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:08:40,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:08:40,586 INFO L87 Difference]: Start difference. First operand 998 states and 2723 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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-21 09:08:40,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:08:40,691 INFO L93 Difference]: Finished difference Result 434 states and 998 transitions. [2022-11-21 09:08:40,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:08:40,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-21 09:08:40,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:08:40,699 INFO L225 Difference]: With dead ends: 434 [2022-11-21 09:08:40,699 INFO L226 Difference]: Without dead ends: 426 [2022-11-21 09:08:40,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:08:40,700 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 28 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:08:40,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 7 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:08:40,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-11-21 09:08:40,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 400. [2022-11-21 09:08:40,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 387 states have (on average 2.41343669250646) internal successors, (934), 399 states have internal predecessors, (934), 0 states have call successors, (0), 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-21 09:08:40,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 934 transitions. [2022-11-21 09:08:40,713 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 934 transitions. Word has length 9 [2022-11-21 09:08:40,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:08:40,713 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 934 transitions. [2022-11-21 09:08:40,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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-21 09:08:40,713 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 934 transitions. [2022-11-21 09:08:40,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 09:08:40,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:08:40,715 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:08:40,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 09:08:40,716 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:08:40,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:08:40,716 INFO L85 PathProgramCache]: Analyzing trace with hash 740251664, now seen corresponding path program 1 times [2022-11-21 09:08:40,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:08:40,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913238906] [2022-11-21 09:08:40,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:08:40,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:08:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:08:40,846 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-21 09:08:40,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:08:40,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913238906] [2022-11-21 09:08:40,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913238906] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:08:40,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:08:40,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 09:08:40,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547801119] [2022-11-21 09:08:40,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:08:40,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:08:40,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:08:40,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:08:40,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:08:40,849 INFO L87 Difference]: Start difference. First operand 400 states and 934 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-21 09:08:40,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:08:40,939 INFO L93 Difference]: Finished difference Result 380 states and 890 transitions. [2022-11-21 09:08:40,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:08:40,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-21 09:08:40,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:08:40,942 INFO L225 Difference]: With dead ends: 380 [2022-11-21 09:08:40,942 INFO L226 Difference]: Without dead ends: 380 [2022-11-21 09:08:40,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:08:40,943 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:08:40,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 4 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:08:40,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-21 09:08:40,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2022-11-21 09:08:40,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 370 states have (on average 2.4054054054054053) internal successors, (890), 379 states have internal predecessors, (890), 0 states have call successors, (0), 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-21 09:08:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 890 transitions. [2022-11-21 09:08:40,958 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 890 transitions. Word has length 11 [2022-11-21 09:08:40,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:08:40,959 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 890 transitions. [2022-11-21 09:08:40,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-21 09:08:40,959 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 890 transitions. [2022-11-21 09:08:40,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 09:08:40,960 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:08:40,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:08:40,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 09:08:40,961 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:08:40,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:08:40,962 INFO L85 PathProgramCache]: Analyzing trace with hash 740251665, now seen corresponding path program 1 times [2022-11-21 09:08:40,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:08:40,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586791789] [2022-11-21 09:08:40,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:08:40,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:08:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:08:41,482 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-21 09:08:41,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:08:41,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586791789] [2022-11-21 09:08:41,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586791789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:08:41,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:08:41,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 09:08:41,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566362231] [2022-11-21 09:08:41,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:08:41,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 09:08:41,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:08:41,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 09:08:41,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 09:08:41,486 INFO L87 Difference]: Start difference. First operand 380 states and 890 transitions. Second operand has 5 states, 5 states have (on average 2.2) 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-21 09:08:41,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:08:41,657 INFO L93 Difference]: Finished difference Result 390 states and 909 transitions. [2022-11-21 09:08:41,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 09:08:41,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) 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-21 09:08:41,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:08:41,659 INFO L225 Difference]: With dead ends: 390 [2022-11-21 09:08:41,659 INFO L226 Difference]: Without dead ends: 390 [2022-11-21 09:08:41,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 09:08:41,660 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 09:08:41,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 12 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 09:08:41,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-11-21 09:08:41,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 384. [2022-11-21 09:08:41,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 374 states have (on average 2.4010695187165774) internal successors, (898), 383 states have internal predecessors, (898), 0 states have call successors, (0), 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-21 09:08:41,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 898 transitions. [2022-11-21 09:08:41,673 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 898 transitions. Word has length 11 [2022-11-21 09:08:41,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:08:41,674 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 898 transitions. [2022-11-21 09:08:41,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) 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-21 09:08:41,674 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 898 transitions. [2022-11-21 09:08:41,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 09:08:41,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:08:41,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:08:41,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 09:08:41,676 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:08:41,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:08:41,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1341499408, now seen corresponding path program 1 times [2022-11-21 09:08:41,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:08:41,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632155768] [2022-11-21 09:08:41,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:08:41,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:08:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:08:41,902 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-21 09:08:41,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:08:41,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632155768] [2022-11-21 09:08:41,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632155768] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:08:41,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:08:41,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 09:08:41,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471831180] [2022-11-21 09:08:41,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:08:41,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 09:08:41,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:08:41,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 09:08:41,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 09:08:41,905 INFO L87 Difference]: Start difference. First operand 384 states and 898 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-21 09:08:42,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:08:42,046 INFO L93 Difference]: Finished difference Result 475 states and 1103 transitions. [2022-11-21 09:08:42,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 09:08:42,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-21 09:08:42,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:08:42,049 INFO L225 Difference]: With dead ends: 475 [2022-11-21 09:08:42,049 INFO L226 Difference]: Without dead ends: 475 [2022-11-21 09:08:42,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 09:08:42,050 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 66 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:08:42,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 9 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:08:42,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-11-21 09:08:42,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2022-11-21 09:08:42,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 465 states have (on average 2.372043010752688) internal successors, (1103), 474 states have internal predecessors, (1103), 0 states have call successors, (0), 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-21 09:08:42,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1103 transitions. [2022-11-21 09:08:42,064 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1103 transitions. Word has length 12 [2022-11-21 09:08:42,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:08:42,065 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 1103 transitions. [2022-11-21 09:08:42,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-21 09:08:42,065 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1103 transitions. [2022-11-21 09:08:42,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 09:08:42,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:08:42,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:08:42,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 09:08:42,067 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:08:42,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:08:42,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1363188893, now seen corresponding path program 1 times [2022-11-21 09:08:42,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:08:42,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982019671] [2022-11-21 09:08:42,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:08:42,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:08:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:08:42,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:08:42,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:08:42,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982019671] [2022-11-21 09:08:42,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982019671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:08:42,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:08:42,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 09:08:42,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707788175] [2022-11-21 09:08:42,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:08:42,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 09:08:42,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:08:42,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 09:08:42,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:08:42,954 INFO L87 Difference]: Start difference. First operand 475 states and 1103 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:08:43,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:08:43,269 INFO L93 Difference]: Finished difference Result 624 states and 1427 transitions. [2022-11-21 09:08:43,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 09:08:43,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-21 09:08:43,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:08:43,272 INFO L225 Difference]: With dead ends: 624 [2022-11-21 09:08:43,272 INFO L226 Difference]: Without dead ends: 624 [2022-11-21 09:08:43,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-21 09:08:43,273 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 60 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 09:08:43,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 22 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 09:08:43,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-11-21 09:08:43,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 519. [2022-11-21 09:08:43,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 509 states have (on average 2.3634577603143416) internal successors, (1203), 518 states have internal predecessors, (1203), 0 states have call successors, (0), 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-21 09:08:43,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 1203 transitions. [2022-11-21 09:08:43,294 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 1203 transitions. Word has length 13 [2022-11-21 09:08:43,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:08:43,295 INFO L495 AbstractCegarLoop]: Abstraction has 519 states and 1203 transitions. [2022-11-21 09:08:43,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:08:43,295 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 1203 transitions. [2022-11-21 09:08:43,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 09:08:43,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:08:43,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:08:43,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 09:08:43,297 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:08:43,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:08:43,297 INFO L85 PathProgramCache]: Analyzing trace with hash 949156331, now seen corresponding path program 2 times [2022-11-21 09:08:43,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:08:43,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985283693] [2022-11-21 09:08:43,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:08:43,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:08:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:08:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:08:44,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:08:44,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985283693] [2022-11-21 09:08:44,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985283693] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:08:44,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066188104] [2022-11-21 09:08:44,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 09:08:44,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:08:44,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:08:44,537 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:08:44,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 09:08:44,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 09:08:44,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 09:08:44,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-21 09:08:44,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:08:45,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 09:08:45,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:08:45,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 09:08:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:08:45,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:08:45,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-11-21 09:08:45,289 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:08:45,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-21 09:08:45,307 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:08:45,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-11-21 09:08:45,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 09:08:45,341 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 09:08:45,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 1 [2022-11-21 09:08:45,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:08:45,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066188104] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:08:45,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:08:45,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 14 [2022-11-21 09:08:45,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983357618] [2022-11-21 09:08:45,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:08:45,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-21 09:08:45,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:08:45,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-21 09:08:45,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=192, Unknown=1, NotChecked=0, Total=240 [2022-11-21 09:08:45,482 INFO L87 Difference]: Start difference. First operand 519 states and 1203 transitions. Second operand has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:08:47,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:08:47,236 INFO L93 Difference]: Finished difference Result 799 states and 1828 transitions. [2022-11-21 09:08:47,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 09:08:47,237 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-21 09:08:47,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:08:47,240 INFO L225 Difference]: With dead ends: 799 [2022-11-21 09:08:47,240 INFO L226 Difference]: Without dead ends: 799 [2022-11-21 09:08:47,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=125, Invalid=380, Unknown=1, NotChecked=0, Total=506 [2022-11-21 09:08:47,241 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 310 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 09:08:47,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 61 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-21 09:08:47,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2022-11-21 09:08:47,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 532. [2022-11-21 09:08:47,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 522 states have (on average 2.4061302681992336) internal successors, (1256), 531 states have internal predecessors, (1256), 0 states have call successors, (0), 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-21 09:08:47,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1256 transitions. [2022-11-21 09:08:47,260 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 1256 transitions. Word has length 13 [2022-11-21 09:08:47,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:08:47,260 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 1256 transitions. [2022-11-21 09:08:47,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:08:47,261 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 1256 transitions. [2022-11-21 09:08:47,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 09:08:47,262 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:08:47,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:08:47,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 09:08:47,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-21 09:08:47,468 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:08:47,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:08:47,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1625342350, now seen corresponding path program 1 times [2022-11-21 09:08:47,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:08:47,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629570538] [2022-11-21 09:08:47,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:08:47,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:08:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:08:48,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:08:48,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:08:48,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629570538] [2022-11-21 09:08:48,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629570538] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:08:48,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784323444] [2022-11-21 09:08:48,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:08:48,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:08:48,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:08:48,900 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:08:48,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 09:08:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:08:49,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-21 09:08:49,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:08:49,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:08:49,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:08:49,133 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 09:08:49,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-21 09:08:49,151 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 09:08:49,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 09:08:49,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-21 09:08:49,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-21 09:08:49,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-21 09:08:49,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:08:49,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-21 09:08:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:08:49,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:08:49,945 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_577 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_577) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_577 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_577) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-21 09:08:50,060 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_577 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_577) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_577 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_577) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-21 09:08:50,124 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_573 Int) (v_ArrVal_577 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_573) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_577) |c_~#queue~0.base|) .cse4) 4)))) (forall ((v_ArrVal_573 Int) (v_ArrVal_577 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_573) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_577) |c_~#queue~0.base|) .cse4) 4)) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-11-21 09:08:50,146 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:08:50,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2022-11-21 09:08:58,680 WARN L233 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:09:01,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:09:01,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784323444] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:09:01,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:09:01,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-21 09:09:01,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12429473] [2022-11-21 09:09:01,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:09:01,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-21 09:09:01,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:09:01,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-21 09:09:01,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=393, Unknown=11, NotChecked=132, Total=650 [2022-11-21 09:09:01,584 INFO L87 Difference]: Start difference. First operand 532 states and 1256 transitions. Second operand has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:09:12,500 WARN L233 SmtUtils]: Spent 5.06s on a formula simplification. DAG size of input: 94 DAG size of output: 80 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:09:20,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:09:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:09:26,465 INFO L93 Difference]: Finished difference Result 740 states and 1727 transitions. [2022-11-21 09:09:26,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-21 09:09:26,466 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-21 09:09:26,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:09:26,469 INFO L225 Difference]: With dead ends: 740 [2022-11-21 09:09:26,469 INFO L226 Difference]: Without dead ends: 740 [2022-11-21 09:09:26,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 30.2s TimeCoverageRelationStatistics Valid=247, Invalid=938, Unknown=17, NotChecked=204, Total=1406 [2022-11-21 09:09:26,471 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 100 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 33 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 350 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-11-21 09:09:26,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 114 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 980 Invalid, 17 Unknown, 350 Unchecked, 6.6s Time] [2022-11-21 09:09:26,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2022-11-21 09:09:26,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 550. [2022-11-21 09:09:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 540 states have (on average 2.401851851851852) internal successors, (1297), 549 states have internal predecessors, (1297), 0 states have call successors, (0), 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-21 09:09:26,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1297 transitions. [2022-11-21 09:09:26,494 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1297 transitions. Word has length 13 [2022-11-21 09:09:26,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:09:26,494 INFO L495 AbstractCegarLoop]: Abstraction has 550 states and 1297 transitions. [2022-11-21 09:09:26,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:09:26,495 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1297 transitions. [2022-11-21 09:09:26,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 09:09:26,496 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:09:26,496 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:09:26,514 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 09:09:26,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-21 09:09:26,702 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:09:26,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:09:26,703 INFO L85 PathProgramCache]: Analyzing trace with hash 648121009, now seen corresponding path program 1 times [2022-11-21 09:09:26,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:09:26,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821725036] [2022-11-21 09:09:26,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:09:26,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:09:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:09:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:09:27,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:09:27,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821725036] [2022-11-21 09:09:27,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821725036] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:09:27,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547308766] [2022-11-21 09:09:27,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:09:27,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:09:27,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:09:27,855 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:09:27,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 09:09:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:09:28,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-21 09:09:28,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:09:28,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2022-11-21 09:09:28,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:09:28,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:09:28,081 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 09:09:28,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-11-21 09:09:28,111 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-21 09:09:28,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-21 09:09:28,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 09:09:28,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:09:28,365 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-21 09:09:28,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-21 09:09:28,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-21 09:09:28,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-21 09:09:28,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:09:28,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 09:09:28,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:09:28,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:09:28,849 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_670 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-21 09:09:28,867 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_670 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-21 09:09:29,007 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_670 (Array Int Int)) (v_ArrVal_667 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_667) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_670 (Array Int Int)) (v_ArrVal_667 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_667) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-11-21 09:09:29,031 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:09:29,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2022-11-21 09:09:38,820 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1477| Int) (v_ArrVal_663 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_663))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_665 Int) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_667 Int)) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1477| 4)) v_ArrVal_665))) (store (store .cse1 .cse2 v_ArrVal_667) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1477| (select .cse4 .cse3))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1477| Int) (v_ArrVal_663 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_663))) (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_665 Int) (v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (< (* (select (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1477| 4)) v_ArrVal_665))) (store (store .cse6 .cse2 v_prenex_4) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_prenex_3) |c_~#queue~0.base|) .cse3) 4) 1609)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1477| (select .cse7 .cse3))))))))) is different from false [2022-11-21 09:09:38,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:09:38,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547308766] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:09:38,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:09:38,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 26 [2022-11-21 09:09:38,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020325341] [2022-11-21 09:09:38,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:09:38,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-21 09:09:38,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:09:38,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-21 09:09:38,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=440, Unknown=9, NotChecked=188, Total=756 [2022-11-21 09:09:38,856 INFO L87 Difference]: Start difference. First operand 550 states and 1297 transitions. Second operand has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 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-21 09:09:51,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:09:51,319 INFO L93 Difference]: Finished difference Result 1049 states and 2454 transitions. [2022-11-21 09:09:51,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 09:09:51,320 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 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-21 09:09:51,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:09:51,323 INFO L225 Difference]: With dead ends: 1049 [2022-11-21 09:09:51,323 INFO L226 Difference]: Without dead ends: 1049 [2022-11-21 09:09:51,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=255, Invalid=870, Unknown=13, NotChecked=268, Total=1406 [2022-11-21 09:09:51,324 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 262 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 59 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 417 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-21 09:09:51,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 107 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 988 Invalid, 13 Unknown, 417 Unchecked, 2.8s Time] [2022-11-21 09:09:51,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2022-11-21 09:09:51,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 616. [2022-11-21 09:09:51,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 606 states have (on average 2.443894389438944) internal successors, (1481), 615 states have internal predecessors, (1481), 0 states have call successors, (0), 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-21 09:09:51,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 1481 transitions. [2022-11-21 09:09:51,345 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 1481 transitions. Word has length 14 [2022-11-21 09:09:51,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:09:51,346 INFO L495 AbstractCegarLoop]: Abstraction has 616 states and 1481 transitions. [2022-11-21 09:09:51,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 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-21 09:09:51,346 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 1481 transitions. [2022-11-21 09:09:51,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 09:09:51,347 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:09:51,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:09:51,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 09:09:51,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-21 09:09:51,554 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:09:51,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:09:51,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1154017767, now seen corresponding path program 2 times [2022-11-21 09:09:51,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:09:51,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358410831] [2022-11-21 09:09:51,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:09:51,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:09:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:09:52,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:09:52,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:09:52,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358410831] [2022-11-21 09:09:52,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358410831] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:09:52,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961651463] [2022-11-21 09:09:52,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 09:09:52,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:09:52,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:09:52,817 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:09:52,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 09:09:52,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 09:09:52,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 09:09:52,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-21 09:09:53,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:09:53,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:09:53,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:09:53,046 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 09:09:53,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-21 09:09:53,080 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-21 09:09:53,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-21 09:09:53,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-21 09:09:53,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-21 09:09:53,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-21 09:09:53,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-21 09:09:54,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:09:54,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-21 09:09:54,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:09:54,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:09:54,248 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_767 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_767 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-21 09:09:56,406 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_766) |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_766) |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-21 09:09:56,425 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_766) |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_766) |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-21 09:09:58,641 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_763 Int) (v_ArrVal_767 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_763) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_766) |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse4) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_763 Int) (v_ArrVal_767 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_763) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_766) |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse4) 4))))))) is different from false [2022-11-21 09:09:58,685 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:09:58,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 101 [2022-11-21 09:10:09,916 WARN L233 SmtUtils]: Spent 6.98s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:10:18,213 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:10:21,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:10:21,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961651463] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:10:21,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:10:21,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-21 09:10:21,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653867634] [2022-11-21 09:10:21,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:10:21,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-21 09:10:21,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:21,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-21 09:10:21,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=476, Unknown=20, NotChecked=196, Total=812 [2022-11-21 09:10:21,599 INFO L87 Difference]: Start difference. First operand 616 states and 1481 transitions. Second operand has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 0 states have call successors, (0), 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-21 09:10:27,884 WARN L233 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 53 DAG size of output: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:10:29,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:10:41,516 WARN L233 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:10:51,112 WARN L233 SmtUtils]: Spent 6.74s on a formula simplification. DAG size of input: 92 DAG size of output: 80 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:10:57,266 WARN L233 SmtUtils]: Spent 5.22s on a formula simplification. DAG size of input: 84 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:10:59,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:11:01,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:11:03,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:11:27,799 WARN L233 SmtUtils]: Spent 21.21s on a formula simplification. DAG size of input: 118 DAG size of output: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:11:30,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:11:32,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:11:34,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:11:36,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:11:38,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:11:40,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:11:42,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:12:11,218 WARN L233 SmtUtils]: Spent 15.15s on a formula simplification. DAG size of input: 108 DAG size of output: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:12:13,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:12:15,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:12:17,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:12:19,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:12:21,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:12:23,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:12:24,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:12:31,498 WARN L233 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 29 DAG size of output: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:12:50,462 WARN L233 SmtUtils]: Spent 13.88s on a formula simplification. DAG size of input: 73 DAG size of output: 62 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:12:53,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:12:56,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:13:08,339 WARN L233 SmtUtils]: Spent 9.42s on a formula simplification. DAG size of input: 80 DAG size of output: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:13:11,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:13:40,399 WARN L233 SmtUtils]: Spent 12.97s on a formula simplification. DAG size of input: 83 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:13:55,004 WARN L233 SmtUtils]: Spent 10.03s on a formula simplification. DAG size of input: 70 DAG size of output: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:13:58,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:14:00,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:14:02,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:14:04,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:14:07,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:14:12,344 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select |c_#length| |c_~#queue~0.base|)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse6 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse3 (* (select (select |c_#memory_int| |c_~#queue~0.base|) .cse1) 4)) (.cse5 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse7 (+ (select .cse4 .cse6) 1))) (and (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_766) |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse2)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_766) |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse1) 4) 4) .cse2)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (+ .cse3 |c_~#queue~0.offset| 4) .cse2) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_766) |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_766) |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (<= 0 (+ .cse3 |c_~#queue~0.offset|)) (forall ((v_prenex_6 Int) (v_prenex_5 (Array Int Int)) (v_prenex_7 (Array Int Int))) (< (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 .cse5 v_prenex_6) .cse6 .cse7)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_5) |c_~#stored_elements~0.base| v_prenex_7) |c_~#queue~0.base|) .cse1) 4)) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_763 Int) (v_ArrVal_767 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 .cse5 v_ArrVal_763) .cse6 .cse7)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_766) |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse1) 4))))))) is different from false [2022-11-21 09:14:14,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:14:16,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:14:19,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:14:21,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:14:24,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:14:26,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:14:28,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:14:31,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:14:32,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:15:18,754 WARN L233 SmtUtils]: Spent 36.18s on a formula simplification. DAG size of input: 98 DAG size of output: 94 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:15:22,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:15:34,811 WARN L233 SmtUtils]: Spent 8.33s on a formula simplification. DAG size of input: 63 DAG size of output: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:15:37,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:15:40,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:15:42,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:15:44,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:15:45,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:15:45,110 INFO L93 Difference]: Finished difference Result 1317 states and 3166 transitions. [2022-11-21 09:15:45,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-21 09:15:45,111 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 0 states have call successors, (0), 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-21 09:15:45,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:15:45,117 INFO L225 Difference]: With dead ends: 1317 [2022-11-21 09:15:45,117 INFO L226 Difference]: Without dead ends: 1317 [2022-11-21 09:15:45,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 5 IntricatePredicates, 4 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 251.1s TimeCoverageRelationStatistics Valid=518, Invalid=1761, Unknown=93, NotChecked=490, Total=2862 [2022-11-21 09:15:45,118 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 441 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 66 mSolverCounterUnsat, 170 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 97.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 170 IncrementalHoareTripleChecker+Unknown, 448 IncrementalHoareTripleChecker+Unchecked, 100.2s IncrementalHoareTripleChecker+Time [2022-11-21 09:15:45,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 174 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1243 Invalid, 170 Unknown, 448 Unchecked, 100.2s Time] [2022-11-21 09:15:45,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2022-11-21 09:15:45,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 686. [2022-11-21 09:15:45,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 676 states have (on average 2.4659763313609466) internal successors, (1667), 685 states have internal predecessors, (1667), 0 states have call successors, (0), 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-21 09:15:45,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1667 transitions. [2022-11-21 09:15:45,141 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1667 transitions. Word has length 14 [2022-11-21 09:15:45,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:15:45,142 INFO L495 AbstractCegarLoop]: Abstraction has 686 states and 1667 transitions. [2022-11-21 09:15:45,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 0 states have call successors, (0), 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-21 09:15:45,142 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1667 transitions. [2022-11-21 09:15:45,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 09:15:45,143 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:15:45,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:15:45,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 09:15:45,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:15:45,349 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:15:45,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:15:45,349 INFO L85 PathProgramCache]: Analyzing trace with hash -551375410, now seen corresponding path program 1 times [2022-11-21 09:15:45,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:15:45,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228086776] [2022-11-21 09:15:45,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:15:45,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:15:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:15:45,466 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-21 09:15:45,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:15:45,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228086776] [2022-11-21 09:15:45,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228086776] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:15:45,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:15:45,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 09:15:45,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920392359] [2022-11-21 09:15:45,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:15:45,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:15:45,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:15:45,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:15:45,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:15:45,468 INFO L87 Difference]: Start difference. First operand 686 states and 1667 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:15:45,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:15:45,689 INFO L93 Difference]: Finished difference Result 698 states and 1675 transitions. [2022-11-21 09:15:45,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:15:45,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-21 09:15:45,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:15:45,691 INFO L225 Difference]: With dead ends: 698 [2022-11-21 09:15:45,691 INFO L226 Difference]: Without dead ends: 698 [2022-11-21 09:15:45,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:15:45,692 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 26 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 09:15:45,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 9 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 09:15:45,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2022-11-21 09:15:45,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 672. [2022-11-21 09:15:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 662 states have (on average 2.4622356495468276) internal successors, (1630), 671 states have internal predecessors, (1630), 0 states have call successors, (0), 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-21 09:15:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1630 transitions. [2022-11-21 09:15:45,709 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1630 transitions. Word has length 15 [2022-11-21 09:15:45,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:15:45,710 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 1630 transitions. [2022-11-21 09:15:45,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:15:45,710 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1630 transitions. [2022-11-21 09:15:45,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 09:15:45,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:15:45,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:15:45,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 09:15:45,711 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:15:45,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:15:45,712 INFO L85 PathProgramCache]: Analyzing trace with hash 909194776, now seen corresponding path program 1 times [2022-11-21 09:15:45,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:15:45,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404506922] [2022-11-21 09:15:45,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:15:45,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:15:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:15:45,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:15:45,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:15:45,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404506922] [2022-11-21 09:15:45,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404506922] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:15:45,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:15:45,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:15:45,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123919125] [2022-11-21 09:15:45,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:15:45,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:15:45,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:15:45,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:15:45,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:15:45,832 INFO L87 Difference]: Start difference. First operand 672 states and 1630 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-21 09:15:46,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:15:46,033 INFO L93 Difference]: Finished difference Result 481 states and 1022 transitions. [2022-11-21 09:15:46,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:15:46,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-21 09:15:46,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:15:46,035 INFO L225 Difference]: With dead ends: 481 [2022-11-21 09:15:46,035 INFO L226 Difference]: Without dead ends: 479 [2022-11-21 09:15:46,035 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-21 09:15:46,036 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 09:15:46,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 3 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 09:15:46,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-11-21 09:15:46,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 478. [2022-11-21 09:15:46,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 468 states have (on average 2.173076923076923) internal successors, (1017), 477 states have internal predecessors, (1017), 0 states have call successors, (0), 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-21 09:15:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1017 transitions. [2022-11-21 09:15:46,048 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1017 transitions. Word has length 16 [2022-11-21 09:15:46,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:15:46,049 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 1017 transitions. [2022-11-21 09:15:46,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-21 09:15:46,050 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1017 transitions. [2022-11-21 09:15:46,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 09:15:46,050 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:15:46,051 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:15:46,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-21 09:15:46,051 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:15:46,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:15:46,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1955257272, now seen corresponding path program 1 times [2022-11-21 09:15:46,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:15:46,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976085746] [2022-11-21 09:15:46,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:15:46,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:15:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:15:47,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:15:47,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:15:47,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976085746] [2022-11-21 09:15:47,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976085746] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:15:47,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333237151] [2022-11-21 09:15:47,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:15:47,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:15:47,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:15:47,423 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:15:47,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 09:15:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:15:47,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-21 09:15:47,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:15:47,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:15:47,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:15:47,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:15:47,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-21 09:15:48,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:15:48,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:15:48,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:15:48,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333237151] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:15:48,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:15:48,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3, 3] total 16 [2022-11-21 09:15:48,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744189377] [2022-11-21 09:15:48,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:15:48,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-21 09:15:48,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:15:48,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-21 09:15:48,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-11-21 09:15:48,431 INFO L87 Difference]: Start difference. First operand 478 states and 1017 transitions. Second operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:15:51,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:15:51,104 INFO L93 Difference]: Finished difference Result 1224 states and 2499 transitions. [2022-11-21 09:15:51,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 09:15:51,105 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-21 09:15:51,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:15:51,108 INFO L225 Difference]: With dead ends: 1224 [2022-11-21 09:15:51,108 INFO L226 Difference]: Without dead ends: 1224 [2022-11-21 09:15:51,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=287, Invalid=835, Unknown=0, NotChecked=0, Total=1122 [2022-11-21 09:15:51,109 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 582 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-21 09:15:51,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 58 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-21 09:15:51,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2022-11-21 09:15:51,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 857. [2022-11-21 09:15:51,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 847 states have (on average 2.103896103896104) internal successors, (1782), 856 states have internal predecessors, (1782), 0 states have call successors, (0), 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-21 09:15:51,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1782 transitions. [2022-11-21 09:15:51,131 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1782 transitions. Word has length 19 [2022-11-21 09:15:51,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:15:51,131 INFO L495 AbstractCegarLoop]: Abstraction has 857 states and 1782 transitions. [2022-11-21 09:15:51,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:15:51,131 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1782 transitions. [2022-11-21 09:15:51,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 09:15:51,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:15:51,132 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 09:15:51,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 09:15:51,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-21 09:15:51,339 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:15:51,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:15:51,339 INFO L85 PathProgramCache]: Analyzing trace with hash -431472802, now seen corresponding path program 3 times [2022-11-21 09:15:51,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:15:51,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299200862] [2022-11-21 09:15:51,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:15:51,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:15:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:15:53,832 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:15:53,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:15:53,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299200862] [2022-11-21 09:15:53,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299200862] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:15:53,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975943275] [2022-11-21 09:15:53,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 09:15:53,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:15:53,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:15:53,847 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:15:53,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 09:15:54,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-21 09:15:54,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 09:15:54,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-21 09:15:54,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:15:54,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2022-11-21 09:15:54,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:15:54,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:15:54,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-11-21 09:15:54,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:15:54,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:15:54,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:15:54,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-21 09:15:54,361 INFO L321 Elim1Store]: treesize reduction 40, result has 45.2 percent of original size [2022-11-21 09:15:54,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 35 treesize of output 55 [2022-11-21 09:15:54,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:15:54,873 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-21 09:15:54,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-21 09:15:55,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-21 09:15:55,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-21 09:15:55,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 09:15:55,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 09:15:55,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:15:55,806 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-21 09:15:55,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 34 [2022-11-21 09:15:56,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-21 09:15:56,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 22 [2022-11-21 09:15:56,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-21 09:15:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:15:56,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:15:56,596 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1047 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1047) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1047 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1047) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2022-11-21 09:15:56,818 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1047 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1047) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1047 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1047) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-21 09:15:56,856 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1044 Int) (v_ArrVal_1047 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1044) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1047) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1044 Int) (v_ArrVal_1047 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1044) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1047) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-11-21 09:15:59,385 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1040 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1040))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (let ((.cse0 (+ (* (select .cse5 .cse4) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_1041 Int) (v_ArrVal_1044 Int) (v_ArrVal_1047 (Array Int Int))) (<= (+ (* (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse0 v_ArrVal_1041))) (store (store .cse2 .cse3 v_ArrVal_1044) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1047) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))) (forall ((v_ArrVal_1040 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1040))) (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (+ (* (select .cse9 .cse4) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse6)) (forall ((v_ArrVal_1041 Int) (v_ArrVal_1044 Int) (v_ArrVal_1047 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1041))) (store (store .cse8 .cse3 v_ArrVal_1044) .cse4 (+ (select .cse8 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1047) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))))))) is different from false [2022-11-21 09:15:59,941 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse0 (store (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1039) |c_~#stored_elements~0.base| v_ArrVal_1040))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse5 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1041 Int) (v_ArrVal_1044 Int) (v_ArrVal_1047 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse5 v_ArrVal_1041))) (store (store .cse1 .cse2 v_ArrVal_1044) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1047) |c_~#queue~0.base|) .cse3) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= 0 .cse5))))))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse8 (store (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1039) |c_~#stored_elements~0.base| v_ArrVal_1040))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse7)) (forall ((v_ArrVal_1041 Int) (v_ArrVal_1044 Int) (v_ArrVal_1047 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse10 .cse7 v_ArrVal_1041))) (store (store .cse9 .cse2 v_ArrVal_1044) .cse3 (+ (select .cse9 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1047) |c_~#queue~0.base|) .cse3) 4))))))))))) is different from false [2022-11-21 09:16:00,007 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse12 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1)))))) (and (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse0 (store (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1039) |c_~#stored_elements~0.base| v_ArrVal_1040))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse5 (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)))) (or (forall ((v_ArrVal_1041 Int) (v_ArrVal_1044 Int) (v_ArrVal_1047 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse5 v_ArrVal_1041))) (store (store .cse1 .cse2 v_ArrVal_1044) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1047) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (not (<= 0 .cse5))))))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse8 (store (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1039) |c_~#stored_elements~0.base| v_ArrVal_1040))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (+ |c_~#queue~0.offset| (* (select .cse10 .cse3) 4)))) (or (not (<= 0 .cse7)) (forall ((v_ArrVal_1041 Int) (v_ArrVal_1044 Int) (v_ArrVal_1047 (Array Int Int))) (<= (+ (* (select (select (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse10 .cse7 v_ArrVal_1041))) (store (store .cse9 .cse2 v_ArrVal_1044) .cse3 (+ (select .cse9 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1047) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))))) is different from false [2022-11-21 09:16:29,220 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-21 09:16:29,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975943275] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:16:29,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:16:29,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 15] total 39 [2022-11-21 09:16:29,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271074513] [2022-11-21 09:16:29,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:16:29,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-21 09:16:29,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:29,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-21 09:16:29,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1027, Unknown=23, NotChecked=426, Total=1640 [2022-11-21 09:16:29,226 INFO L87 Difference]: Start difference. First operand 857 states and 1782 transitions. Second operand has 41 states, 40 states have (on average 1.65) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:17:23,884 WARN L233 SmtUtils]: Spent 48.90s on a formula simplification. DAG size of input: 202 DAG size of output: 186 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:17:59,224 WARN L233 SmtUtils]: Spent 32.72s on a formula simplification. DAG size of input: 192 DAG size of output: 180 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:18:04,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:18:12,920 WARN L233 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:18:17,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:18:19,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:18:47,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:18:47,906 INFO L93 Difference]: Finished difference Result 1394 states and 2838 transitions. [2022-11-21 09:18:47,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-21 09:18:47,923 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.65) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 09:18:47,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:18:47,926 INFO L225 Difference]: With dead ends: 1394 [2022-11-21 09:18:47,926 INFO L226 Difference]: Without dead ends: 1394 [2022-11-21 09:18:47,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 19 SyntacticMatches, 20 SemanticMatches, 62 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 155.4s TimeCoverageRelationStatistics Valid=499, Invalid=2785, Unknown=46, NotChecked=702, Total=4032 [2022-11-21 09:18:47,928 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 564 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 2623 mSolverCounterSat, 141 mSolverCounterUnsat, 46 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 3730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 2623 IncrementalHoareTripleChecker+Invalid, 46 IncrementalHoareTripleChecker+Unknown, 920 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2022-11-21 09:18:47,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 224 Invalid, 3730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 2623 Invalid, 46 Unknown, 920 Unchecked, 16.8s Time] [2022-11-21 09:18:47,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2022-11-21 09:18:47,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 798. [2022-11-21 09:18:47,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 788 states have (on average 2.100253807106599) internal successors, (1655), 797 states have internal predecessors, (1655), 0 states have call successors, (0), 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-21 09:18:47,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1655 transitions. [2022-11-21 09:18:47,949 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1655 transitions. Word has length 22 [2022-11-21 09:18:47,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:18:47,949 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 1655 transitions. [2022-11-21 09:18:47,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.65) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:18:47,950 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1655 transitions. [2022-11-21 09:18:47,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 09:18:47,950 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:18:47,951 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 09:18:47,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 09:18:48,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-21 09:18:48,158 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:18:48,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:18:48,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2044182564, now seen corresponding path program 4 times [2022-11-21 09:18:48,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:18:48,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161992021] [2022-11-21 09:18:48,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:18:48,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:18:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:18:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:18:51,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:18:51,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161992021] [2022-11-21 09:18:51,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161992021] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:18:51,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777034326] [2022-11-21 09:18:51,115 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 09:18:51,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:18:51,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:18:51,116 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:18:51,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 09:18:51,306 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 09:18:51,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 09:18:51,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-21 09:18:51,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:18:51,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:18:51,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:18:51,367 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 09:18:51,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-21 09:18:51,410 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-21 09:18:51,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-21 09:18:51,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-21 09:18:52,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-21 09:18:52,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-21 09:18:52,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:18:52,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-21 09:18:52,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 85 [2022-11-21 09:18:53,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 83 [2022-11-21 09:18:53,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 89 [2022-11-21 09:18:54,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:18:54,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 163 [2022-11-21 09:18:54,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 163 [2022-11-21 09:18:54,525 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:18:54,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:18:54,628 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1167 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_1167 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-21 09:18:54,659 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-21 09:18:54,678 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-21 09:18:54,706 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= (+ (* 4 (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-21 09:18:56,896 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1162 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1162) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse4) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1162 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1162) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse4) 4))))))) is different from false [2022-11-21 09:19:00,223 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse4 .cse3)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| .cse0)) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1162 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| 4)) v_ArrVal_1161))) (store (store .cse1 .cse2 v_ArrVal_1162) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse3) 4)) (select |c_#length| |c_~#queue~0.base|))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| .cse0)) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1162 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| 4)) v_ArrVal_1161))) (store (store .cse5 .cse2 v_ArrVal_1162) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse3) 4))))))))) is different from false [2022-11-21 09:19:00,261 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1159 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1159))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| (select .cse0 .cse1))) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1162 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| 4)) v_ArrVal_1161))) (store (store .cse3 .cse4 v_ArrVal_1162) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))) (forall ((v_ArrVal_1159 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| Int)) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1159))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| (select .cse5 .cse1))) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1162 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| 4)) v_ArrVal_1161))) (store (store .cse7 .cse4 v_ArrVal_1162) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))))))) is different from false [2022-11-21 09:19:00,301 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_1159 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| Int)) (let ((.cse2 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1159))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| (select .cse0 .cse1))) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1162 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| 4)) v_ArrVal_1161))) (store (store .cse3 .cse4 v_ArrVal_1162) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))))) (forall ((v_ArrVal_1159 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| Int)) (let ((.cse7 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1159))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| (select .cse6 .cse1))) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1162 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| 4)) v_ArrVal_1161))) (store (store .cse8 .cse4 v_ArrVal_1162) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse1) 4)))))))))) is different from false [2022-11-21 09:19:00,342 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))))) (and (forall ((v_ArrVal_1159 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| Int)) (let ((.cse0 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1159))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1161 Int) (v_ArrVal_1162 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| 4)) v_ArrVal_1161))) (store (store .cse1 .cse2 v_ArrVal_1162) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| (select .cse4 .cse3))))))) (forall ((v_ArrVal_1159 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| Int)) (let ((.cse7 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1159))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| (select .cse6 .cse3))) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1162 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| 4)) v_ArrVal_1161))) (store (store .cse8 .cse2 v_ArrVal_1162) .cse3 (+ (select .cse8 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))))) is different from false [2022-11-21 09:19:00,430 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse8 (+ (select .cse5 .cse7) 1))) (and (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1155 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1155) .cse7 .cse8)) |c_~#stored_elements~0.base| v_ArrVal_1159))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1161 Int) (v_ArrVal_1162 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| 4)) v_ArrVal_1161))) (store (store .cse1 .cse2 v_ArrVal_1162) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse3)) 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| (select .cse4 .cse3))))))) (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1155 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1155) .cse7 .cse8)) |c_~#stored_elements~0.base| v_ArrVal_1159))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| (select .cse9 .cse3))) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1162 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| 4)) v_ArrVal_1161))) (store (store .cse11 .cse2 v_ArrVal_1162) .cse3 (+ (select .cse11 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse3)))))))))))) is different from false [2022-11-21 09:19:00,477 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:19:00,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 355 treesize of output 359 [2022-11-21 09:19:12,330 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse7 (select .cse6 .cse3))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1499| Int)) (or (forall ((v_prenex_17 Int) (v_prenex_12 Int) (v_ArrVal_1153 Int) (v_prenex_11 Int) (v_prenex_14 Int) (v_prenex_13 (Array Int Int)) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1499| 4)) v_ArrVal_1153))) (store (store .cse5 .cse2 v_prenex_14) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_prenex_13))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (< (* (select (select (store (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* v_prenex_17 4) |c_~#queue~0.offset|) v_prenex_11))) (store (store .cse1 .cse2 v_prenex_12) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_prenex_16) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_15) |c_~#queue~0.base|) .cse3) 4) 1609) (not (<= v_prenex_17 (select .cse4 .cse3))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1499| .cse7)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1499| Int)) (or (forall ((v_ArrVal_1161 Int) (v_ArrVal_1162 Int) (v_ArrVal_1153 Int) (v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1155 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| Int)) (let ((.cse9 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse11 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1499| 4)) v_ArrVal_1153))) (store (store .cse11 .cse2 v_ArrVal_1155) .cse3 (+ (select .cse11 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1159))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| (select .cse8 .cse3))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| 4)) v_ArrVal_1161))) (store (store .cse10 .cse2 v_ArrVal_1162) .cse3 (+ (select .cse10 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse3) 4))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1499| .cse7))))))) is different from false [2022-11-21 09:19:12,521 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-21 09:19:12,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777034326] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:19:12,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:19:12,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 15] total 40 [2022-11-21 09:19:12,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462676537] [2022-11-21 09:19:12,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:19:12,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-21 09:19:12,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:19:12,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-21 09:19:12,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=811, Unknown=24, NotChecked=748, Total=1722 [2022-11-21 09:19:12,523 INFO L87 Difference]: Start difference. First operand 798 states and 1655 transitions. Second operand has 42 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 41 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:19:38,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:20:03,406 WARN L233 SmtUtils]: Spent 20.94s on a formula simplification. DAG size of input: 193 DAG size of output: 168 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:20:04,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:20:06,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:20:08,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:20:10,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:20:12,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:20:15,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:20:17,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:20:19,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:20:21,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:20:23,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:20:46,822 WARN L233 SmtUtils]: Spent 15.90s on a formula simplification. DAG size of input: 144 DAG size of output: 115 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:20:48,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:20:58,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:21:00,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:21:02,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:21:04,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:21:06,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:21:09,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:21:11,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:21:13,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:21:13,365 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse9 (select |c_#length| |c_~#queue~0.base|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse8 (+ (select .cse5 .cse7) 1))) (and (forall ((v_prenex_17 Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_14 Int) (v_prenex_13 (Array Int Int)) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_prenex_14) .cse7 .cse8)) |c_~#stored_elements~0.base| v_prenex_13))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (not (<= v_prenex_17 (select .cse0 .cse1))) (< (+ |c_~#queue~0.offset| (* 4 (select (select (store (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* v_prenex_17 4) |c_~#queue~0.offset|) v_prenex_11))) (store (store .cse3 .cse4 v_prenex_12) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_prenex_16) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_15) |c_~#queue~0.base|) .cse1))) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609)))))) (forall ((v_ArrVal_1162 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1162) .cse7 .cse8)) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse1) 4) 4) .cse9)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1162 Int) (v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1155 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| Int)) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1155) .cse7 .cse8)) |c_~#stored_elements~0.base| v_ArrVal_1159))) (let ((.cse10 (select .cse11 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| (select .cse10 .cse1))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| 4)) v_ArrVal_1161))) (store (store .cse12 .cse4 v_ArrVal_1162) .cse1 (+ (select .cse12 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse1)))))))) (forall ((v_ArrVal_1162 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1162) .cse7 .cse8)) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1155 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| Int)) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1155) .cse7 .cse8)) |c_~#stored_elements~0.base| v_ArrVal_1159))) (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1161 Int) (v_ArrVal_1162 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store (store (store .cse13 |c_~#queue~0.base| (let ((.cse14 (store .cse15 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| 4)) v_ArrVal_1161))) (store (store .cse14 .cse4 v_ArrVal_1162) .cse1 (+ (select .cse14 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse1)) 4) .cse9)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| (select .cse15 .cse1))))))) (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1155 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| Int)) (let ((.cse17 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1155) .cse7 .cse8)) |c_~#stored_elements~0.base| v_ArrVal_1159))) (let ((.cse16 (select .cse17 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| (select .cse16 .cse1))) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1162 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store (store .cse17 |c_~#queue~0.base| (let ((.cse18 (store .cse16 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| 4)) v_ArrVal_1161))) (store (store .cse18 .cse4 v_ArrVal_1162) .cse1 (+ (select .cse18 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse1)))))))))))) is different from false [2022-11-21 09:21:15,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:21:18,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:21:20,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:21:22,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:21:24,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:21:27,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:21:29,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:21:30,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:21:32,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:21:33,076 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1))))) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse9 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_1159 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| Int)) (let ((.cse0 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1159))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1161 Int) (v_ArrVal_1162 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| 4)) v_ArrVal_1161))) (store (store .cse1 .cse2 v_ArrVal_1162) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| (select .cse4 .cse3))))))) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1159 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| Int)) (let ((.cse7 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1159))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| (select .cse6 .cse3))) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1162 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| 4)) v_ArrVal_1161))) (store (store .cse8 .cse2 v_ArrVal_1162) .cse3 (+ (select .cse8 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse9)))))) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= (+ (* 4 (select (select (store (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset| 4) .cse9)))) is different from false [2022-11-21 09:21:40,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:21:42,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:21:44,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:21:47,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:21:49,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:21:49,394 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse6 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_1159 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| Int)) (let ((.cse3 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1159))) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| (select .cse2 .cse1))) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1162 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| 4)) v_ArrVal_1161))) (store (store .cse4 .cse5 v_ArrVal_1162) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse1) 4)) .cse6)))))) (forall ((v_ArrVal_1159 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| Int)) (let ((.cse8 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1159))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| (select .cse7 .cse1))) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1162 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| 4)) v_ArrVal_1161))) (store (store .cse9 .cse5 v_ArrVal_1162) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse1) 4)))))))) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse1) 4)) .cse6)))) is different from false [2022-11-21 09:21:51,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:21:51,765 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (+ |c_~#queue~0.offset| 1604)) (.cse5 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1159 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1159))) (let ((.cse1 (select .cse2 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| (select .cse1 .cse0))) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1162 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| 4)) v_ArrVal_1161))) (store (store .cse3 .cse4 v_ArrVal_1162) .cse0 (+ (select .cse3 .cse0) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) .cse5)))))) (forall ((v_ArrVal_1159 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1159))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| (select .cse6 .cse0))) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1162 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| 4)) v_ArrVal_1161))) (store (store .cse8 .cse4 v_ArrVal_1162) .cse0 (+ (select .cse8 .cse0) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))))) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) .cse5)))) is different from false [2022-11-21 09:21:52,435 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse4 .cse3)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| .cse0)) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1162 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| 4)) v_ArrVal_1161))) (store (store .cse1 .cse2 v_ArrVal_1162) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse3) 4)) .cse5)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| .cse0)) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1162 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1497| 4)) v_ArrVal_1161))) (store (store .cse6 .cse2 v_ArrVal_1162) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse3) 4)))))) (forall ((v_ArrVal_1167 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse3) 4)))) (forall ((v_ArrVal_1167 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1167) |c_~#queue~0.base|) .cse3) 4) 4) .cse5))))) is different from false [2022-11-21 09:21:55,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:21:57,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:22:02,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:22:04,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:22:12,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:22:13,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:22:13,185 INFO L93 Difference]: Finished difference Result 1183 states and 2448 transitions. [2022-11-21 09:22:13,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-21 09:22:13,186 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 41 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 09:22:13,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:22:13,189 INFO L225 Difference]: With dead ends: 1183 [2022-11-21 09:22:13,189 INFO L226 Difference]: Without dead ends: 1183 [2022-11-21 09:22:13,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 20 SyntacticMatches, 13 SemanticMatches, 66 ConstructedPredicates, 16 IntricatePredicates, 4 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 102.4s TimeCoverageRelationStatistics Valid=405, Invalid=2261, Unknown=50, NotChecked=1840, Total=4556 [2022-11-21 09:22:13,191 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 306 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 94 mSolverCounterUnsat, 53 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 96.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 3307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 53 IncrementalHoareTripleChecker+Unknown, 1632 IncrementalHoareTripleChecker+Unchecked, 98.3s IncrementalHoareTripleChecker+Time [2022-11-21 09:22:13,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 94 Invalid, 3307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1528 Invalid, 53 Unknown, 1632 Unchecked, 98.3s Time] [2022-11-21 09:22:13,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2022-11-21 09:22:13,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 841. [2022-11-21 09:22:13,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 831 states have (on average 2.1107099879663056) internal successors, (1754), 840 states have internal predecessors, (1754), 0 states have call successors, (0), 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-21 09:22:13,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1754 transitions. [2022-11-21 09:22:13,211 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1754 transitions. Word has length 22 [2022-11-21 09:22:13,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:22:13,211 INFO L495 AbstractCegarLoop]: Abstraction has 841 states and 1754 transitions. [2022-11-21 09:22:13,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 41 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:22:13,212 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1754 transitions. [2022-11-21 09:22:13,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-21 09:22:13,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:22:13,213 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:22:13,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 09:22:13,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:22:13,419 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:22:13,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:22:13,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1217927995, now seen corresponding path program 1 times [2022-11-21 09:22:13,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:22:13,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080659858] [2022-11-21 09:22:13,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:22:13,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:22:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:22:15,108 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:22:15,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:22:15,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080659858] [2022-11-21 09:22:15,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080659858] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:22:15,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047477276] [2022-11-21 09:22:15,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:22:15,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:22:15,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:22:15,112 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:22:15,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 09:22:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:22:15,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-21 09:22:15,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:22:15,407 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-21 09:22:15,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-21 09:22:16,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 09:22:16,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 09:22:16,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:22:16,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 09:22:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-21 09:22:16,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:22:16,657 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1279 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1279) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_1279 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1279) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-21 09:22:16,676 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1278 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1278) |c_~#stored_elements~0.base| v_ArrVal_1279) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1278 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1278) |c_~#stored_elements~0.base| v_ArrVal_1279) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-21 09:22:16,689 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:22:16,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-21 09:22:16,710 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:22:16,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 165 [2022-11-21 09:22:16,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2022-11-21 09:22:16,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 126 [2022-11-21 09:22:16,869 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:22:16,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-21 09:22:16,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:22:16,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:22:16,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:22:16,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-21 09:22:17,512 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:22:17,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2022-11-21 09:22:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2022-11-21 09:22:17,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047477276] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:22:17,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:22:17,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 27 [2022-11-21 09:22:17,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721815854] [2022-11-21 09:22:17,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:22:17,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-21 09:22:17,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:22:17,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-21 09:22:17,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=535, Unknown=2, NotChecked=98, Total=756 [2022-11-21 09:22:17,768 INFO L87 Difference]: Start difference. First operand 841 states and 1754 transitions. Second operand has 28 states, 28 states have (on average 2.75) internal successors, (77), 27 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:22:21,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:22:21,725 INFO L93 Difference]: Finished difference Result 1033 states and 2096 transitions. [2022-11-21 09:22:21,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-21 09:22:21,726 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.75) internal successors, (77), 27 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-21 09:22:21,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:22:21,728 INFO L225 Difference]: With dead ends: 1033 [2022-11-21 09:22:21,728 INFO L226 Difference]: Without dead ends: 1033 [2022-11-21 09:22:21,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=533, Invalid=1543, Unknown=2, NotChecked=178, Total=2256 [2022-11-21 09:22:21,729 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 443 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 284 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-21 09:22:21,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 73 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 870 Invalid, 0 Unknown, 284 Unchecked, 1.9s Time] [2022-11-21 09:22:21,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2022-11-21 09:22:21,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 755. [2022-11-21 09:22:21,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 745 states have (on average 2.091275167785235) internal successors, (1558), 754 states have internal predecessors, (1558), 0 states have call successors, (0), 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-21 09:22:21,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1558 transitions. [2022-11-21 09:22:21,748 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1558 transitions. Word has length 29 [2022-11-21 09:22:21,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:22:21,749 INFO L495 AbstractCegarLoop]: Abstraction has 755 states and 1558 transitions. [2022-11-21 09:22:21,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.75) internal successors, (77), 27 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:22:21,749 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1558 transitions. [2022-11-21 09:22:21,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 09:22:21,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:22:21,750 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2022-11-21 09:22:21,757 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 09:22:21,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:22:21,957 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 09:22:21,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:22:21,958 INFO L85 PathProgramCache]: Analyzing trace with hash -150941613, now seen corresponding path program 5 times [2022-11-21 09:22:21,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:22:21,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430540361] [2022-11-21 09:22:21,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:22:21,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:22:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:22:25,315 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:22:25,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:22:25,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430540361] [2022-11-21 09:22:25,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430540361] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:22:25,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147911457] [2022-11-21 09:22:25,316 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 09:22:25,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:22:25,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:22:25,319 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:22:25,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6975838-0aed-4625-9f97-fa927fd8c62d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 09:22:25,718 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-21 09:22:25,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 09:22:25,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 127 conjunts are in the unsatisfiable core [2022-11-21 09:22:25,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:22:25,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:22:25,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:22:25,822 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 09:22:25,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-21 09:22:25,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:22:25,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:22:25,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:22:25,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-21 09:22:25,891 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-21 09:22:25,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-21 09:22:26,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-21 09:22:26,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-21 09:22:27,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-21 09:22:27,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:22:27,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 83 [2022-11-21 09:22:27,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 09:22:27,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 82 [2022-11-21 09:22:28,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 149 [2022-11-21 09:22:29,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 117 [2022-11-21 09:22:29,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:22:29,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 219 [2022-11-21 09:22:29,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 219 [2022-11-21 09:22:29,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 239 [2022-11-21 09:22:30,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 440 treesize of output 435 [2022-11-21 09:22:31,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 341 treesize of output 334 [2022-11-21 09:22:31,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:22:31,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 651 treesize of output 653 [2022-11-21 09:22:31,699 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:22:31,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:22:32,051 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1425 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1425) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1425 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1425) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))))) is different from false [2022-11-21 09:22:32,069 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1425 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1425) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1425 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1425) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-21 09:22:32,103 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1421 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1421) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1425) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1421 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1421) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1425) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-11-21 09:22:34,769 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (select |c_#length| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1418 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1418))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse5 (* (select .cse4 .cse3) 4))) (or (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1420 Int) (v_ArrVal_1421 Int)) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ .cse5 |c_~#queue~0.offset|) v_ArrVal_1420))) (store (store .cse1 .cse2 v_ArrVal_1421) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1425) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (not (<= (+ .cse5 |c_~#queue~0.offset| 4) .cse6))))))) (forall ((v_ArrVal_1418 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1418))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (* (select .cse10 .cse3) 4))) (or (not (<= (+ .cse7 |c_~#queue~0.offset| 4) .cse6)) (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1420 Int) (v_ArrVal_1421 Int)) (<= (+ (* (select (select (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse10 (+ .cse7 |c_~#queue~0.offset|) v_ArrVal_1420))) (store (store .cse9 .cse2 v_ArrVal_1421) .cse3 (+ (select .cse9 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1425) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse6))))))))) is different from false [2022-11-21 09:22:35,279 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (select |c_#length| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1418 (Array Int Int))) (let ((.cse0 (store (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1417) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1418))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse5 (* (select .cse4 .cse3) 4))) (or (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1420 Int) (v_ArrVal_1421 Int)) (<= 0 (+ (* 4 (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ .cse5 |c_~#queue~0.offset|) v_ArrVal_1420))) (store (store .cse1 .cse2 v_ArrVal_1421) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1425) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|))) (not (<= (+ .cse5 |c_~#queue~0.offset| 4) .cse6))))))) (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1418 (Array Int Int))) (let ((.cse8 (store (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1417) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1418))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse11 (* (select .cse10 .cse3) 4))) (or (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1420 Int) (v_ArrVal_1421 Int)) (<= (+ (* 4 (select (select (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse10 (+ .cse11 |c_~#queue~0.offset|) v_ArrVal_1420))) (store (store .cse9 .cse2 v_ArrVal_1421) .cse3 (+ (select .cse9 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1425) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset| 4) .cse6)) (not (<= (+ .cse11 |c_~#queue~0.offset| 4) .cse6))))))))) is different from false