./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f83ae5bec1717d6f197d4259600c0d1f406909832409df09253b7bf70d3f66fc --- 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-e04fb08 [2022-11-16 12:24:15,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:24:15,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:24:15,544 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:24:15,545 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:24:15,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:24:15,547 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:24:15,549 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:24:15,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:24:15,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:24:15,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:24:15,568 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:24:15,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:24:15,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:24:15,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:24:15,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:24:15,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:24:15,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:24:15,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:24:15,579 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:24:15,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:24:15,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:24:15,589 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:24:15,590 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:24:15,602 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:24:15,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:24:15,602 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:24:15,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:24:15,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:24:15,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:24:15,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:24:15,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:24:15,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:24:15,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:24:15,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:24:15,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:24:15,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:24:15,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:24:15,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:24:15,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:24:15,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:24:15,618 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 12:24:15,655 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:24:15,655 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:24:15,656 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:24:15,656 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:24:15,656 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:24:15,656 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:24:15,657 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:24:15,657 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:24:15,657 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:24:15,658 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:24:15,662 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:24:15,662 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:24:15,663 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:24:15,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:24:15,663 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:24:15,663 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:24:15,673 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:24:15,673 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:24:15,673 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:24:15,673 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:24:15,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:24:15,674 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:24:15,674 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:24:15,675 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:24:15,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:24:15,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:24:15,675 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:24:15,676 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:24:15,676 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:24:15,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:24:15,676 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:24:15,677 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:24:15,677 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:24:15,677 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_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/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_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f83ae5bec1717d6f197d4259600c0d1f406909832409df09253b7bf70d3f66fc [2022-11-16 12:24:16,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:24:16,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:24:16,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:24:16,081 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:24:16,082 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:24:16,083 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2022-11-16 12:24:16,155 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/data/7c925941e/4e3c8316afd540858407e7457577840a/FLAG7fab3ac7d [2022-11-16 12:24:16,733 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:24:16,733 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2022-11-16 12:24:16,744 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/data/7c925941e/4e3c8316afd540858407e7457577840a/FLAG7fab3ac7d [2022-11-16 12:24:17,044 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/data/7c925941e/4e3c8316afd540858407e7457577840a [2022-11-16 12:24:17,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:24:17,049 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:24:17,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:24:17,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:24:17,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:24:17,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:24:17" (1/1) ... [2022-11-16 12:24:17,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d4dbe0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:17, skipping insertion in model container [2022-11-16 12:24:17,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:24:17" (1/1) ... [2022-11-16 12:24:17,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:24:17,115 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:24:17,352 WARN L229 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_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c[4232,4245] [2022-11-16 12:24:17,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:24:17,369 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:24:17,428 WARN L229 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_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c[4232,4245] [2022-11-16 12:24:17,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:24:17,472 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:24:17,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:17 WrapperNode [2022-11-16 12:24:17,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:24:17,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:24:17,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:24:17,477 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:24:17,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:17" (1/1) ... [2022-11-16 12:24:17,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:17" (1/1) ... [2022-11-16 12:24:17,543 INFO L138 Inliner]: procedures = 27, calls = 83, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 346 [2022-11-16 12:24:17,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:24:17,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:24:17,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:24:17,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:24:17,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:17" (1/1) ... [2022-11-16 12:24:17,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:17" (1/1) ... [2022-11-16 12:24:17,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:17" (1/1) ... [2022-11-16 12:24:17,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:17" (1/1) ... [2022-11-16 12:24:17,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:17" (1/1) ... [2022-11-16 12:24:17,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:17" (1/1) ... [2022-11-16 12:24:17,577 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:17" (1/1) ... [2022-11-16 12:24:17,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:17" (1/1) ... [2022-11-16 12:24:17,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:24:17,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:24:17,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:24:17,584 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:24:17,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:17" (1/1) ... [2022-11-16 12:24:17,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:24:17,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:24:17,637 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:24:17,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:24:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:24:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:24:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:24:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:24:17,674 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 12:24:17,674 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 12:24:17,674 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 12:24:17,674 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 12:24:17,674 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-16 12:24:17,675 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-16 12:24:17,675 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-16 12:24:17,675 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-16 12:24:17,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:24:17,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 12:24:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 12:24:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:24:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:24:17,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:24:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:24:17,678 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 12:24:17,892 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:24:17,895 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:24:18,546 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:24:18,839 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:24:18,840 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2022-11-16 12:24:18,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:24:18 BoogieIcfgContainer [2022-11-16 12:24:18,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:24:18,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:24:18,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:24:18,849 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:24:18,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:24:17" (1/3) ... [2022-11-16 12:24:18,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc59800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:24:18, skipping insertion in model container [2022-11-16 12:24:18,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:17" (2/3) ... [2022-11-16 12:24:18,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc59800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:24:18, skipping insertion in model container [2022-11-16 12:24:18,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:24:18" (3/3) ... [2022-11-16 12:24:18,853 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2022-11-16 12:24:18,862 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 12:24:18,874 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:24:18,875 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:24:18,875 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:24:18,960 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-16 12:24:19,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 265 transitions, 562 flow [2022-11-16 12:24:19,110 INFO L130 PetriNetUnfolder]: 22/261 cut-off events. [2022-11-16 12:24:19,110 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-16 12:24:19,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 261 events. 22/261 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 124 event pairs, 0 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 222. Up to 2 conditions per place. [2022-11-16 12:24:19,118 INFO L82 GeneralOperation]: Start removeDead. Operand has 256 places, 265 transitions, 562 flow [2022-11-16 12:24:19,125 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 239 places, 248 transitions, 520 flow [2022-11-16 12:24:19,135 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:24:19,155 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2ea6f7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:24:19,155 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-16 12:24:19,288 INFO L130 PetriNetUnfolder]: 22/247 cut-off events. [2022-11-16 12:24:19,288 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-16 12:24:19,289 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:24:19,290 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:24:19,292 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:24:19,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:24:19,298 INFO L85 PathProgramCache]: Analyzing trace with hash 305754719, now seen corresponding path program 1 times [2022-11-16 12:24:19,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:24:19,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692420167] [2022-11-16 12:24:19,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:24:19,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:24:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:19,652 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-16 12:24:19,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:24:19,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692420167] [2022-11-16 12:24:19,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692420167] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:24:19,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:24:19,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:24:19,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660681861] [2022-11-16 12:24:19,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:24:19,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:24:19,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:24:19,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:24:19,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:24:19,702 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 265 [2022-11-16 12:24:19,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 248 transitions, 520 flow. Second operand has 2 states, 2 states have (on average 244.5) internal successors, (489), 2 states have internal predecessors, (489), 0 states have call successors, (0), 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-16 12:24:19,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:24:19,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 265 [2022-11-16 12:24:19,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:24:19,979 INFO L130 PetriNetUnfolder]: 124/548 cut-off events. [2022-11-16 12:24:19,980 INFO L131 PetriNetUnfolder]: For 106/107 co-relation queries the response was YES. [2022-11-16 12:24:19,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 548 events. 124/548 cut-off events. For 106/107 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1738 event pairs, 51 based on Foata normal form. 128/613 useless extension candidates. Maximal degree in co-relation 504. Up to 163 conditions per place. [2022-11-16 12:24:19,992 INFO L137 encePairwiseOnDemand]: 250/265 looper letters, 12 selfloop transitions, 0 changer transitions 8/233 dead transitions. [2022-11-16 12:24:19,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 233 transitions, 514 flow [2022-11-16 12:24:19,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:24:20,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 12:24:20,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 501 transitions. [2022-11-16 12:24:20,019 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9452830188679245 [2022-11-16 12:24:20,021 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 501 transitions. [2022-11-16 12:24:20,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 501 transitions. [2022-11-16 12:24:20,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:24:20,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 501 transitions. [2022-11-16 12:24:20,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 250.5) internal successors, (501), 2 states have internal predecessors, (501), 0 states have call successors, (0), 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-16 12:24:20,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 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-16 12:24:20,044 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 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-16 12:24:20,046 INFO L175 Difference]: Start difference. First operand has 239 places, 248 transitions, 520 flow. Second operand 2 states and 501 transitions. [2022-11-16 12:24:20,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 233 transitions, 514 flow [2022-11-16 12:24:20,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 233 transitions, 498 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-11-16 12:24:20,062 INFO L231 Difference]: Finished difference. Result has 232 places, 225 transitions, 458 flow [2022-11-16 12:24:20,065 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=458, PETRI_PLACES=232, PETRI_TRANSITIONS=225} [2022-11-16 12:24:20,071 INFO L288 CegarLoopForPetriNet]: 239 programPoint places, -7 predicate places. [2022-11-16 12:24:20,071 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 225 transitions, 458 flow [2022-11-16 12:24:20,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 244.5) internal successors, (489), 2 states have internal predecessors, (489), 0 states have call successors, (0), 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-16 12:24:20,073 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:24:20,073 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:24:20,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:24:20,074 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:24:20,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:24:20,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2090388928, now seen corresponding path program 1 times [2022-11-16 12:24:20,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:24:20,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225787144] [2022-11-16 12:24:20,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:24:20,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:24:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:20,917 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-16 12:24:20,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:24:20,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225787144] [2022-11-16 12:24:20,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225787144] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:24:20,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:24:20,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:24:20,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216901811] [2022-11-16 12:24:20,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:24:20,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:24:20,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:24:20,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:24:20,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:24:20,925 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 265 [2022-11-16 12:24:20,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 225 transitions, 458 flow. Second operand has 5 states, 5 states have (on average 204.2) internal successors, (1021), 5 states have internal predecessors, (1021), 0 states have call successors, (0), 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-16 12:24:20,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:24:20,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 265 [2022-11-16 12:24:20,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:24:21,210 INFO L130 PetriNetUnfolder]: 134/552 cut-off events. [2022-11-16 12:24:21,211 INFO L131 PetriNetUnfolder]: For 31/32 co-relation queries the response was YES. [2022-11-16 12:24:21,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 552 events. 134/552 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1694 event pairs, 14 based on Foata normal form. 1/511 useless extension candidates. Maximal degree in co-relation 775. Up to 133 conditions per place. [2022-11-16 12:24:21,217 INFO L137 encePairwiseOnDemand]: 259/265 looper letters, 50 selfloop transitions, 3 changer transitions 4/237 dead transitions. [2022-11-16 12:24:21,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 237 transitions, 601 flow [2022-11-16 12:24:21,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:24:21,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 12:24:21,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1038 transitions. [2022-11-16 12:24:21,221 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7833962264150943 [2022-11-16 12:24:21,222 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1038 transitions. [2022-11-16 12:24:21,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1038 transitions. [2022-11-16 12:24:21,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:24:21,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1038 transitions. [2022-11-16 12:24:21,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 207.6) internal successors, (1038), 5 states have internal predecessors, (1038), 0 states have call successors, (0), 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-16 12:24:21,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 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-16 12:24:21,231 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 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-16 12:24:21,232 INFO L175 Difference]: Start difference. First operand has 232 places, 225 transitions, 458 flow. Second operand 5 states and 1038 transitions. [2022-11-16 12:24:21,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 237 transitions, 601 flow [2022-11-16 12:24:21,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 237 transitions, 601 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:24:21,243 INFO L231 Difference]: Finished difference. Result has 231 places, 227 transitions, 481 flow [2022-11-16 12:24:21,244 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=481, PETRI_PLACES=231, PETRI_TRANSITIONS=227} [2022-11-16 12:24:21,245 INFO L288 CegarLoopForPetriNet]: 239 programPoint places, -8 predicate places. [2022-11-16 12:24:21,245 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 227 transitions, 481 flow [2022-11-16 12:24:21,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 204.2) internal successors, (1021), 5 states have internal predecessors, (1021), 0 states have call successors, (0), 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-16 12:24:21,246 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:24:21,246 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:24:21,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:24:21,247 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:24:21,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:24:21,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1368444775, now seen corresponding path program 1 times [2022-11-16 12:24:21,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:24:21,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9316385] [2022-11-16 12:24:21,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:24:21,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:24:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:21,559 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-16 12:24:21,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:24:21,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9316385] [2022-11-16 12:24:21,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9316385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:24:21,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:24:21,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:24:21,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95152035] [2022-11-16 12:24:21,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:24:21,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:24:21,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:24:21,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:24:21,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:24:21,568 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 265 [2022-11-16 12:24:21,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 227 transitions, 481 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 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-16 12:24:21,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:24:21,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 265 [2022-11-16 12:24:21,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:24:21,859 INFO L130 PetriNetUnfolder]: 208/757 cut-off events. [2022-11-16 12:24:21,860 INFO L131 PetriNetUnfolder]: For 138/140 co-relation queries the response was YES. [2022-11-16 12:24:21,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 757 events. 208/757 cut-off events. For 138/140 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2963 event pairs, 36 based on Foata normal form. 13/694 useless extension candidates. Maximal degree in co-relation 1181. Up to 207 conditions per place. [2022-11-16 12:24:21,870 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 30 selfloop transitions, 2 changer transitions 0/239 dead transitions. [2022-11-16 12:24:21,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 239 transitions, 581 flow [2022-11-16 12:24:21,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:24:21,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:24:21,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2022-11-16 12:24:21,876 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.909433962264151 [2022-11-16 12:24:21,876 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 723 transitions. [2022-11-16 12:24:21,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 723 transitions. [2022-11-16 12:24:21,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:24:21,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 723 transitions. [2022-11-16 12:24:21,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 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-16 12:24:21,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-16 12:24:21,883 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-16 12:24:21,883 INFO L175 Difference]: Start difference. First operand has 231 places, 227 transitions, 481 flow. Second operand 3 states and 723 transitions. [2022-11-16 12:24:21,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 239 transitions, 581 flow [2022-11-16 12:24:21,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 239 transitions, 573 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-11-16 12:24:21,891 INFO L231 Difference]: Finished difference. Result has 229 places, 228 transitions, 488 flow [2022-11-16 12:24:21,892 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=488, PETRI_PLACES=229, PETRI_TRANSITIONS=228} [2022-11-16 12:24:21,895 INFO L288 CegarLoopForPetriNet]: 239 programPoint places, -10 predicate places. [2022-11-16 12:24:21,895 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 228 transitions, 488 flow [2022-11-16 12:24:21,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 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-16 12:24:21,896 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:24:21,897 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:24:21,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:24:21,897 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:24:21,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:24:21,899 INFO L85 PathProgramCache]: Analyzing trace with hash 2051449603, now seen corresponding path program 1 times [2022-11-16 12:24:21,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:24:21,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160822341] [2022-11-16 12:24:21,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:24:21,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:24:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:22,132 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-16 12:24:22,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:24:22,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160822341] [2022-11-16 12:24:22,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160822341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:24:22,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:24:22,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:24:22,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181386787] [2022-11-16 12:24:22,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:24:22,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:24:22,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:24:22,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:24:22,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:24:22,141 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 265 [2022-11-16 12:24:22,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 228 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 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-16 12:24:22,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:24:22,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 265 [2022-11-16 12:24:22,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:24:22,380 INFO L130 PetriNetUnfolder]: 153/696 cut-off events. [2022-11-16 12:24:22,380 INFO L131 PetriNetUnfolder]: For 212/215 co-relation queries the response was YES. [2022-11-16 12:24:22,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 696 events. 153/696 cut-off events. For 212/215 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2807 event pairs, 27 based on Foata normal form. 12/635 useless extension candidates. Maximal degree in co-relation 1086. Up to 171 conditions per place. [2022-11-16 12:24:22,386 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 31 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2022-11-16 12:24:22,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 240 transitions, 597 flow [2022-11-16 12:24:22,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:24:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:24:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2022-11-16 12:24:22,390 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9081761006289308 [2022-11-16 12:24:22,393 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 722 transitions. [2022-11-16 12:24:22,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 722 transitions. [2022-11-16 12:24:22,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:24:22,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 722 transitions. [2022-11-16 12:24:22,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 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-16 12:24:22,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-16 12:24:22,400 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-16 12:24:22,400 INFO L175 Difference]: Start difference. First operand has 229 places, 228 transitions, 488 flow. Second operand 3 states and 722 transitions. [2022-11-16 12:24:22,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 240 transitions, 597 flow [2022-11-16 12:24:22,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 240 transitions, 594 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 12:24:22,411 INFO L231 Difference]: Finished difference. Result has 231 places, 229 transitions, 500 flow [2022-11-16 12:24:22,412 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=231, PETRI_TRANSITIONS=229} [2022-11-16 12:24:22,413 INFO L288 CegarLoopForPetriNet]: 239 programPoint places, -8 predicate places. [2022-11-16 12:24:22,414 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 229 transitions, 500 flow [2022-11-16 12:24:22,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 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-16 12:24:22,414 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:24:22,415 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:24:22,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:24:22,415 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:24:22,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:24:22,416 INFO L85 PathProgramCache]: Analyzing trace with hash 391049304, now seen corresponding path program 1 times [2022-11-16 12:24:22,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:24:22,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104412318] [2022-11-16 12:24:22,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:24:22,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:24:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:22,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:24:22,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:24:22,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104412318] [2022-11-16 12:24:22,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104412318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:24:22,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:24:22,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:24:22,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468927831] [2022-11-16 12:24:22,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:24:22,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:24:22,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:24:22,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:24:22,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:24:22,842 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 265 [2022-11-16 12:24:22,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 229 transitions, 500 flow. Second operand has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 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-16 12:24:22,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:24:22,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 265 [2022-11-16 12:24:22,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:24:23,270 INFO L130 PetriNetUnfolder]: 109/773 cut-off events. [2022-11-16 12:24:23,270 INFO L131 PetriNetUnfolder]: For 229/230 co-relation queries the response was YES. [2022-11-16 12:24:23,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 773 events. 109/773 cut-off events. For 229/230 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2936 event pairs, 36 based on Foata normal form. 8/712 useless extension candidates. Maximal degree in co-relation 1224. Up to 167 conditions per place. [2022-11-16 12:24:23,276 INFO L137 encePairwiseOnDemand]: 255/265 looper letters, 84 selfloop transitions, 11 changer transitions 0/270 dead transitions. [2022-11-16 12:24:23,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 270 transitions, 793 flow [2022-11-16 12:24:23,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:24:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 12:24:23,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1881 transitions. [2022-11-16 12:24:23,282 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7886792452830189 [2022-11-16 12:24:23,282 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1881 transitions. [2022-11-16 12:24:23,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1881 transitions. [2022-11-16 12:24:23,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:24:23,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1881 transitions. [2022-11-16 12:24:23,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 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-16 12:24:23,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-16 12:24:23,298 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-16 12:24:23,298 INFO L175 Difference]: Start difference. First operand has 231 places, 229 transitions, 500 flow. Second operand 9 states and 1881 transitions. [2022-11-16 12:24:23,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 270 transitions, 793 flow [2022-11-16 12:24:23,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 270 transitions, 790 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 12:24:23,305 INFO L231 Difference]: Finished difference. Result has 240 places, 233 transitions, 540 flow [2022-11-16 12:24:23,306 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=540, PETRI_PLACES=240, PETRI_TRANSITIONS=233} [2022-11-16 12:24:23,307 INFO L288 CegarLoopForPetriNet]: 239 programPoint places, 1 predicate places. [2022-11-16 12:24:23,307 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 233 transitions, 540 flow [2022-11-16 12:24:23,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 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-16 12:24:23,308 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:24:23,309 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:24:23,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:24:23,309 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:24:23,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:24:23,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1284535408, now seen corresponding path program 1 times [2022-11-16 12:24:23,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:24:23,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316134506] [2022-11-16 12:24:23,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:24:23,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:24:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:23,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:24:23,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:24:23,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316134506] [2022-11-16 12:24:23,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316134506] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:24:23,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:24:23,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:24:23,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742923054] [2022-11-16 12:24:23,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:24:23,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:24:23,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:24:23,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:24:23,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:24:23,625 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 265 [2022-11-16 12:24:23,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 233 transitions, 540 flow. Second operand has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 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-16 12:24:23,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:24:23,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 265 [2022-11-16 12:24:23,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:24:24,010 INFO L130 PetriNetUnfolder]: 127/1067 cut-off events. [2022-11-16 12:24:24,011 INFO L131 PetriNetUnfolder]: For 321/323 co-relation queries the response was YES. [2022-11-16 12:24:24,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 1067 events. 127/1067 cut-off events. For 321/323 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5015 event pairs, 42 based on Foata normal form. 15/997 useless extension candidates. Maximal degree in co-relation 1650. Up to 219 conditions per place. [2022-11-16 12:24:24,019 INFO L137 encePairwiseOnDemand]: 255/265 looper letters, 75 selfloop transitions, 12 changer transitions 0/262 dead transitions. [2022-11-16 12:24:24,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 262 transitions, 794 flow [2022-11-16 12:24:24,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:24:24,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 12:24:24,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1869 transitions. [2022-11-16 12:24:24,025 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7836477987421384 [2022-11-16 12:24:24,025 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1869 transitions. [2022-11-16 12:24:24,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1869 transitions. [2022-11-16 12:24:24,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:24:24,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1869 transitions. [2022-11-16 12:24:24,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 207.66666666666666) internal successors, (1869), 9 states have internal predecessors, (1869), 0 states have call successors, (0), 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-16 12:24:24,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-16 12:24:24,037 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-16 12:24:24,037 INFO L175 Difference]: Start difference. First operand has 240 places, 233 transitions, 540 flow. Second operand 9 states and 1869 transitions. [2022-11-16 12:24:24,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 262 transitions, 794 flow [2022-11-16 12:24:24,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 262 transitions, 785 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 12:24:24,044 INFO L231 Difference]: Finished difference. Result has 247 places, 237 transitions, 575 flow [2022-11-16 12:24:24,045 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=575, PETRI_PLACES=247, PETRI_TRANSITIONS=237} [2022-11-16 12:24:24,046 INFO L288 CegarLoopForPetriNet]: 239 programPoint places, 8 predicate places. [2022-11-16 12:24:24,046 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 237 transitions, 575 flow [2022-11-16 12:24:24,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 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-16 12:24:24,047 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:24:24,048 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:24:24,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:24:24,048 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:24:24,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:24:24,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1225086179, now seen corresponding path program 1 times [2022-11-16 12:24:24,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:24:24,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93832958] [2022-11-16 12:24:24,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:24:24,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:24:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:24,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:24:24,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:24:24,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93832958] [2022-11-16 12:24:24,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93832958] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:24:24,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:24:24,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:24:24,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294300092] [2022-11-16 12:24:24,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:24:24,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:24:24,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:24:24,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:24:24,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:24:24,750 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 265 [2022-11-16 12:24:24,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 237 transitions, 575 flow. Second operand has 8 states, 8 states have (on average 193.25) internal successors, (1546), 8 states have internal predecessors, (1546), 0 states have call successors, (0), 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-16 12:24:24,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:24:24,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 265 [2022-11-16 12:24:24,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:24:27,388 INFO L130 PetriNetUnfolder]: 3272/9314 cut-off events. [2022-11-16 12:24:27,388 INFO L131 PetriNetUnfolder]: For 2799/2802 co-relation queries the response was YES. [2022-11-16 12:24:27,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16569 conditions, 9314 events. 3272/9314 cut-off events. For 2799/2802 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 87835 event pairs, 1597 based on Foata normal form. 0/7843 useless extension candidates. Maximal degree in co-relation 16558. Up to 1850 conditions per place. [2022-11-16 12:24:27,496 INFO L137 encePairwiseOnDemand]: 254/265 looper letters, 117 selfloop transitions, 11 changer transitions 0/291 dead transitions. [2022-11-16 12:24:27,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 291 transitions, 998 flow [2022-11-16 12:24:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:24:27,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 12:24:27,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1795 transitions. [2022-11-16 12:24:27,503 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7526205450733753 [2022-11-16 12:24:27,503 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1795 transitions. [2022-11-16 12:24:27,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1795 transitions. [2022-11-16 12:24:27,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:24:27,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1795 transitions. [2022-11-16 12:24:27,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 199.44444444444446) internal successors, (1795), 9 states have internal predecessors, (1795), 0 states have call successors, (0), 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-16 12:24:27,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-16 12:24:27,516 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-16 12:24:27,516 INFO L175 Difference]: Start difference. First operand has 247 places, 237 transitions, 575 flow. Second operand 9 states and 1795 transitions. [2022-11-16 12:24:27,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 291 transitions, 998 flow [2022-11-16 12:24:27,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 291 transitions, 987 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 12:24:27,533 INFO L231 Difference]: Finished difference. Result has 255 places, 240 transitions, 606 flow [2022-11-16 12:24:27,534 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=606, PETRI_PLACES=255, PETRI_TRANSITIONS=240} [2022-11-16 12:24:27,535 INFO L288 CegarLoopForPetriNet]: 239 programPoint places, 16 predicate places. [2022-11-16 12:24:27,535 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 240 transitions, 606 flow [2022-11-16 12:24:27,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.25) internal successors, (1546), 8 states have internal predecessors, (1546), 0 states have call successors, (0), 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-16 12:24:27,536 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:24:27,536 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:24:27,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:24:27,537 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:24:27,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:24:27,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2018917119, now seen corresponding path program 1 times [2022-11-16 12:24:27,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:24:27,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709039597] [2022-11-16 12:24:27,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:24:27,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:24:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:28,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:24:28,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:24:28,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709039597] [2022-11-16 12:24:28,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709039597] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:24:28,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:24:28,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:24:28,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456082705] [2022-11-16 12:24:28,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:24:28,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:24:28,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:24:28,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:24:28,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:24:28,371 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 265 [2022-11-16 12:24:28,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 240 transitions, 606 flow. Second operand has 8 states, 8 states have (on average 193.25) internal successors, (1546), 8 states have internal predecessors, (1546), 0 states have call successors, (0), 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-16 12:24:28,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:24:28,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 265 [2022-11-16 12:24:28,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:24:30,312 INFO L130 PetriNetUnfolder]: 2420/7206 cut-off events. [2022-11-16 12:24:30,313 INFO L131 PetriNetUnfolder]: For 2887/2925 co-relation queries the response was YES. [2022-11-16 12:24:30,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13425 conditions, 7206 events. 2420/7206 cut-off events. For 2887/2925 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 63223 event pairs, 1207 based on Foata normal form. 0/6226 useless extension candidates. Maximal degree in co-relation 13411. Up to 1609 conditions per place. [2022-11-16 12:24:30,370 INFO L137 encePairwiseOnDemand]: 254/265 looper letters, 87 selfloop transitions, 9 changer transitions 21/280 dead transitions. [2022-11-16 12:24:30,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 280 transitions, 960 flow [2022-11-16 12:24:30,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:24:30,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 12:24:30,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1788 transitions. [2022-11-16 12:24:30,376 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7496855345911949 [2022-11-16 12:24:30,376 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1788 transitions. [2022-11-16 12:24:30,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1788 transitions. [2022-11-16 12:24:30,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:24:30,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1788 transitions. [2022-11-16 12:24:30,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 198.66666666666666) internal successors, (1788), 9 states have internal predecessors, (1788), 0 states have call successors, (0), 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-16 12:24:30,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-16 12:24:30,391 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-16 12:24:30,392 INFO L175 Difference]: Start difference. First operand has 255 places, 240 transitions, 606 flow. Second operand 9 states and 1788 transitions. [2022-11-16 12:24:30,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 280 transitions, 960 flow [2022-11-16 12:24:30,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 280 transitions, 944 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-16 12:24:30,405 INFO L231 Difference]: Finished difference. Result has 260 places, 238 transitions, 602 flow [2022-11-16 12:24:30,406 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=602, PETRI_PLACES=260, PETRI_TRANSITIONS=238} [2022-11-16 12:24:30,409 INFO L288 CegarLoopForPetriNet]: 239 programPoint places, 21 predicate places. [2022-11-16 12:24:30,409 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 238 transitions, 602 flow [2022-11-16 12:24:30,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.25) internal successors, (1546), 8 states have internal predecessors, (1546), 0 states have call successors, (0), 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-16 12:24:30,411 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:24:30,411 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:24:30,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:24:30,412 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:24:30,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:24:30,412 INFO L85 PathProgramCache]: Analyzing trace with hash -592046739, now seen corresponding path program 1 times [2022-11-16 12:24:30,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:24:30,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877293222] [2022-11-16 12:24:30,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:24:30,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:24:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:31,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:24:31,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:24:31,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877293222] [2022-11-16 12:24:31,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877293222] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:24:31,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:24:31,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:24:31,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155397935] [2022-11-16 12:24:31,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:24:31,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:24:31,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:24:31,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:24:31,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:24:31,233 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 265 [2022-11-16 12:24:31,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 238 transitions, 602 flow. Second operand has 9 states, 9 states have (on average 192.88888888888889) internal successors, (1736), 9 states have internal predecessors, (1736), 0 states have call successors, (0), 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-16 12:24:31,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:24:31,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 265 [2022-11-16 12:24:31,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:24:32,548 INFO L130 PetriNetUnfolder]: 1714/4472 cut-off events. [2022-11-16 12:24:32,548 INFO L131 PetriNetUnfolder]: For 2209/2225 co-relation queries the response was YES. [2022-11-16 12:24:32,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9168 conditions, 4472 events. 1714/4472 cut-off events. For 2209/2225 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 31832 event pairs, 517 based on Foata normal form. 114/4190 useless extension candidates. Maximal degree in co-relation 9152. Up to 1609 conditions per place. [2022-11-16 12:24:32,579 INFO L137 encePairwiseOnDemand]: 257/265 looper letters, 90 selfloop transitions, 8 changer transitions 3/264 dead transitions. [2022-11-16 12:24:32,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 264 transitions, 896 flow [2022-11-16 12:24:32,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:24:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 12:24:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1582 transitions. [2022-11-16 12:24:32,584 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7462264150943396 [2022-11-16 12:24:32,584 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1582 transitions. [2022-11-16 12:24:32,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1582 transitions. [2022-11-16 12:24:32,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:24:32,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1582 transitions. [2022-11-16 12:24:32,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 197.75) internal successors, (1582), 8 states have internal predecessors, (1582), 0 states have call successors, (0), 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-16 12:24:32,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 265.0) internal successors, (2385), 9 states have internal predecessors, (2385), 0 states have call successors, (0), 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-16 12:24:32,593 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 265.0) internal successors, (2385), 9 states have internal predecessors, (2385), 0 states have call successors, (0), 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-16 12:24:32,593 INFO L175 Difference]: Start difference. First operand has 260 places, 238 transitions, 602 flow. Second operand 8 states and 1582 transitions. [2022-11-16 12:24:32,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 264 transitions, 896 flow [2022-11-16 12:24:32,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 264 transitions, 866 flow, removed 7 selfloop flow, removed 10 redundant places. [2022-11-16 12:24:32,602 INFO L231 Difference]: Finished difference. Result has 255 places, 236 transitions, 591 flow [2022-11-16 12:24:32,603 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=591, PETRI_PLACES=255, PETRI_TRANSITIONS=236} [2022-11-16 12:24:32,603 INFO L288 CegarLoopForPetriNet]: 239 programPoint places, 16 predicate places. [2022-11-16 12:24:32,604 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 236 transitions, 591 flow [2022-11-16 12:24:32,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 192.88888888888889) internal successors, (1736), 9 states have internal predecessors, (1736), 0 states have call successors, (0), 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-16 12:24:32,605 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:24:32,605 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:24:32,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:24:32,606 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:24:32,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:24:32,606 INFO L85 PathProgramCache]: Analyzing trace with hash 247900951, now seen corresponding path program 1 times [2022-11-16 12:24:32,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:24:32,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510683639] [2022-11-16 12:24:32,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:24:32,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:24:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:24:33,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:24:33,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510683639] [2022-11-16 12:24:33,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510683639] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:24:33,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909411958] [2022-11-16 12:24:33,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:24:33,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:24:33,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:24:33,181 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:24:33,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:24:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:33,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 12:24:33,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:24:34,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:24:34,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:24:35,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:24:35,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909411958] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 12:24:35,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:24:35,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9, 11] total 26 [2022-11-16 12:24:35,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706608599] [2022-11-16 12:24:35,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:24:35,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:24:35,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:24:35,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:24:35,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2022-11-16 12:24:35,627 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 265 [2022-11-16 12:24:35,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 236 transitions, 591 flow. Second operand has 10 states, 10 states have (on average 189.6) internal successors, (1896), 10 states have internal predecessors, (1896), 0 states have call successors, (0), 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-16 12:24:35,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:24:35,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 265 [2022-11-16 12:24:35,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:24:37,979 INFO L130 PetriNetUnfolder]: 3519/6521 cut-off events. [2022-11-16 12:24:37,980 INFO L131 PetriNetUnfolder]: For 3524/3530 co-relation queries the response was YES. [2022-11-16 12:24:38,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14664 conditions, 6521 events. 3519/6521 cut-off events. For 3524/3530 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 44152 event pairs, 208 based on Foata normal form. 2/5956 useless extension candidates. Maximal degree in co-relation 14650. Up to 1280 conditions per place. [2022-11-16 12:24:38,048 INFO L137 encePairwiseOnDemand]: 248/265 looper letters, 154 selfloop transitions, 30 changer transitions 0/344 dead transitions. [2022-11-16 12:24:38,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 344 transitions, 1322 flow [2022-11-16 12:24:38,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:24:38,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-16 12:24:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3293 transitions. [2022-11-16 12:24:38,058 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7309655937846837 [2022-11-16 12:24:38,059 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3293 transitions. [2022-11-16 12:24:38,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3293 transitions. [2022-11-16 12:24:38,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:24:38,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3293 transitions. [2022-11-16 12:24:38,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 193.7058823529412) internal successors, (3293), 17 states have internal predecessors, (3293), 0 states have call successors, (0), 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-16 12:24:38,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 265.0) internal successors, (4770), 18 states have internal predecessors, (4770), 0 states have call successors, (0), 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-16 12:24:38,082 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 265.0) internal successors, (4770), 18 states have internal predecessors, (4770), 0 states have call successors, (0), 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-16 12:24:38,083 INFO L175 Difference]: Start difference. First operand has 255 places, 236 transitions, 591 flow. Second operand 17 states and 3293 transitions. [2022-11-16 12:24:38,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 344 transitions, 1322 flow [2022-11-16 12:24:38,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 344 transitions, 1281 flow, removed 4 selfloop flow, removed 9 redundant places. [2022-11-16 12:24:38,096 INFO L231 Difference]: Finished difference. Result has 269 places, 252 transitions, 730 flow [2022-11-16 12:24:38,096 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=730, PETRI_PLACES=269, PETRI_TRANSITIONS=252} [2022-11-16 12:24:38,097 INFO L288 CegarLoopForPetriNet]: 239 programPoint places, 30 predicate places. [2022-11-16 12:24:38,097 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 252 transitions, 730 flow [2022-11-16 12:24:38,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 189.6) internal successors, (1896), 10 states have internal predecessors, (1896), 0 states have call successors, (0), 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-16 12:24:38,098 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:24:38,099 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:24:38,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:24:38,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 12:24:38,306 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:24:38,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:24:38,307 INFO L85 PathProgramCache]: Analyzing trace with hash 383571851, now seen corresponding path program 2 times [2022-11-16 12:24:38,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:24:38,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238635481] [2022-11-16 12:24:38,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:24:38,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:24:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:38,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:24:38,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:24:38,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238635481] [2022-11-16 12:24:38,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238635481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:24:38,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:24:38,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:24:38,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407217579] [2022-11-16 12:24:38,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:24:38,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:24:38,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:24:38,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:24:38,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:24:38,985 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 265 [2022-11-16 12:24:38,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 252 transitions, 730 flow. Second operand has 9 states, 9 states have (on average 189.33333333333334) internal successors, (1704), 9 states have internal predecessors, (1704), 0 states have call successors, (0), 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-16 12:24:38,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:24:38,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 265 [2022-11-16 12:24:38,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:24:40,719 INFO L130 PetriNetUnfolder]: 2909/5964 cut-off events. [2022-11-16 12:24:40,720 INFO L131 PetriNetUnfolder]: For 6930/7028 co-relation queries the response was YES. [2022-11-16 12:24:40,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15335 conditions, 5964 events. 2909/5964 cut-off events. For 6930/7028 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 41810 event pairs, 591 based on Foata normal form. 33/5548 useless extension candidates. Maximal degree in co-relation 15314. Up to 1822 conditions per place. [2022-11-16 12:24:40,801 INFO L137 encePairwiseOnDemand]: 256/265 looper letters, 114 selfloop transitions, 13 changer transitions 7/302 dead transitions. [2022-11-16 12:24:40,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 302 transitions, 1221 flow [2022-11-16 12:24:40,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:24:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 12:24:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1755 transitions. [2022-11-16 12:24:40,808 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7358490566037735 [2022-11-16 12:24:40,808 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1755 transitions. [2022-11-16 12:24:40,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1755 transitions. [2022-11-16 12:24:40,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:24:40,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1755 transitions. [2022-11-16 12:24:40,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 0 states have call successors, (0), 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-16 12:24:40,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-16 12:24:40,821 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-16 12:24:40,821 INFO L175 Difference]: Start difference. First operand has 269 places, 252 transitions, 730 flow. Second operand 9 states and 1755 transitions. [2022-11-16 12:24:40,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 302 transitions, 1221 flow [2022-11-16 12:24:40,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 302 transitions, 1190 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-16 12:24:40,853 INFO L231 Difference]: Finished difference. Result has 273 places, 254 transitions, 767 flow [2022-11-16 12:24:40,853 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=767, PETRI_PLACES=273, PETRI_TRANSITIONS=254} [2022-11-16 12:24:40,854 INFO L288 CegarLoopForPetriNet]: 239 programPoint places, 34 predicate places. [2022-11-16 12:24:40,854 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 254 transitions, 767 flow [2022-11-16 12:24:40,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 189.33333333333334) internal successors, (1704), 9 states have internal predecessors, (1704), 0 states have call successors, (0), 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-16 12:24:40,855 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:24:40,855 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:24:40,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:24:40,856 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:24:40,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:24:40,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1995209147, now seen corresponding path program 1 times [2022-11-16 12:24:40,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:24:40,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322557401] [2022-11-16 12:24:40,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:24:40,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:24:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:41,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 12:24:41,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:24:41,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322557401] [2022-11-16 12:24:41,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322557401] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:24:41,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19383077] [2022-11-16 12:24:41,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:24:41,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:24:41,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:24:41,383 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:24:41,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:24:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:41,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 12:24:41,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:24:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 12:24:41,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:24:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 12:24:42,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19383077] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 12:24:42,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:24:42,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 6] total 11 [2022-11-16 12:24:42,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028558689] [2022-11-16 12:24:42,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:24:42,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:24:42,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:24:42,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:24:42,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:24:42,362 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 265 [2022-11-16 12:24:42,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 254 transitions, 767 flow. Second operand has 7 states, 7 states have (on average 224.57142857142858) internal successors, (1572), 7 states have internal predecessors, (1572), 0 states have call successors, (0), 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-16 12:24:42,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:24:42,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 265 [2022-11-16 12:24:42,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:24:44,016 INFO L130 PetriNetUnfolder]: 2785/6508 cut-off events. [2022-11-16 12:24:44,016 INFO L131 PetriNetUnfolder]: For 7179/7521 co-relation queries the response was YES. [2022-11-16 12:24:44,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16311 conditions, 6508 events. 2785/6508 cut-off events. For 7179/7521 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 55385 event pairs, 311 based on Foata normal form. 118/6107 useless extension candidates. Maximal degree in co-relation 16286. Up to 1480 conditions per place. [2022-11-16 12:24:44,077 INFO L137 encePairwiseOnDemand]: 254/265 looper letters, 66 selfloop transitions, 25 changer transitions 0/305 dead transitions. [2022-11-16 12:24:44,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 305 transitions, 1178 flow [2022-11-16 12:24:44,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:24:44,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 12:24:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1615 transitions. [2022-11-16 12:24:44,081 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8706199460916442 [2022-11-16 12:24:44,081 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1615 transitions. [2022-11-16 12:24:44,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1615 transitions. [2022-11-16 12:24:44,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:24:44,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1615 transitions. [2022-11-16 12:24:44,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 230.71428571428572) internal successors, (1615), 7 states have internal predecessors, (1615), 0 states have call successors, (0), 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-16 12:24:44,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 265.0) internal successors, (2120), 8 states have internal predecessors, (2120), 0 states have call successors, (0), 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-16 12:24:44,090 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 265.0) internal successors, (2120), 8 states have internal predecessors, (2120), 0 states have call successors, (0), 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-16 12:24:44,090 INFO L175 Difference]: Start difference. First operand has 273 places, 254 transitions, 767 flow. Second operand 7 states and 1615 transitions. [2022-11-16 12:24:44,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 305 transitions, 1178 flow [2022-11-16 12:24:44,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 305 transitions, 1136 flow, removed 10 selfloop flow, removed 8 redundant places. [2022-11-16 12:24:44,111 INFO L231 Difference]: Finished difference. Result has 272 places, 266 transitions, 910 flow [2022-11-16 12:24:44,112 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=910, PETRI_PLACES=272, PETRI_TRANSITIONS=266} [2022-11-16 12:24:44,113 INFO L288 CegarLoopForPetriNet]: 239 programPoint places, 33 predicate places. [2022-11-16 12:24:44,113 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 266 transitions, 910 flow [2022-11-16 12:24:44,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 224.57142857142858) internal successors, (1572), 7 states have internal predecessors, (1572), 0 states have call successors, (0), 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-16 12:24:44,114 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:24:44,114 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:24:44,124 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-16 12:24:44,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 12:24:44,320 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:24:44,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:24:44,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1785205229, now seen corresponding path program 1 times [2022-11-16 12:24:44,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:24:44,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141093210] [2022-11-16 12:24:44,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:24:44,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:24:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:44,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 12:24:44,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:24:44,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141093210] [2022-11-16 12:24:44,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141093210] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:24:44,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381714674] [2022-11-16 12:24:44,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:24:44,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:24:44,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:24:44,707 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:24:44,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:24:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:44,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 12:24:44,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:24:45,288 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 12:24:45,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:24:45,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381714674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:24:45,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:24:45,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 8 [2022-11-16 12:24:45,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636315403] [2022-11-16 12:24:45,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:24:45,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:24:45,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:24:45,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:24:45,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:24:45,292 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 265 [2022-11-16 12:24:45,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 266 transitions, 910 flow. Second operand has 6 states, 6 states have (on average 225.16666666666666) internal successors, (1351), 6 states have internal predecessors, (1351), 0 states have call successors, (0), 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-16 12:24:45,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:24:45,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 265 [2022-11-16 12:24:45,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:24:48,263 INFO L130 PetriNetUnfolder]: 7404/16063 cut-off events. [2022-11-16 12:24:48,264 INFO L131 PetriNetUnfolder]: For 35994/37225 co-relation queries the response was YES. [2022-11-16 12:24:48,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48700 conditions, 16063 events. 7404/16063 cut-off events. For 35994/37225 co-relation queries the response was YES. Maximal size of possible extension queue 1158. Compared 157958 event pairs, 1025 based on Foata normal form. 160/14963 useless extension candidates. Maximal degree in co-relation 48673. Up to 2878 conditions per place. [2022-11-16 12:24:48,470 INFO L137 encePairwiseOnDemand]: 256/265 looper letters, 146 selfloop transitions, 45 changer transitions 0/405 dead transitions. [2022-11-16 12:24:48,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 405 transitions, 2312 flow [2022-11-16 12:24:48,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:24:48,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 12:24:48,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1867 transitions. [2022-11-16 12:24:48,475 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8806603773584906 [2022-11-16 12:24:48,476 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1867 transitions. [2022-11-16 12:24:48,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1867 transitions. [2022-11-16 12:24:48,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:24:48,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1867 transitions. [2022-11-16 12:24:48,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 233.375) internal successors, (1867), 8 states have internal predecessors, (1867), 0 states have call successors, (0), 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-16 12:24:48,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 265.0) internal successors, (2385), 9 states have internal predecessors, (2385), 0 states have call successors, (0), 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-16 12:24:48,486 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 265.0) internal successors, (2385), 9 states have internal predecessors, (2385), 0 states have call successors, (0), 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-16 12:24:48,486 INFO L175 Difference]: Start difference. First operand has 272 places, 266 transitions, 910 flow. Second operand 8 states and 1867 transitions. [2022-11-16 12:24:48,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 405 transitions, 2312 flow [2022-11-16 12:24:48,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 405 transitions, 2284 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-11-16 12:24:48,613 INFO L231 Difference]: Finished difference. Result has 282 places, 308 transitions, 1469 flow [2022-11-16 12:24:48,614 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1469, PETRI_PLACES=282, PETRI_TRANSITIONS=308} [2022-11-16 12:24:48,615 INFO L288 CegarLoopForPetriNet]: 239 programPoint places, 43 predicate places. [2022-11-16 12:24:48,616 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 308 transitions, 1469 flow [2022-11-16 12:24:48,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.16666666666666) internal successors, (1351), 6 states have internal predecessors, (1351), 0 states have call successors, (0), 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-16 12:24:48,616 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:24:48,617 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:24:48,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:24:48,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 12:24:48,823 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:24:48,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:24:48,824 INFO L85 PathProgramCache]: Analyzing trace with hash -432138189, now seen corresponding path program 2 times [2022-11-16 12:24:48,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:24:48,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270955301] [2022-11-16 12:24:48,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:24:48,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:24:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:49,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:24:49,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:24:49,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270955301] [2022-11-16 12:24:49,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270955301] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:24:49,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:24:49,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:24:49,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173615755] [2022-11-16 12:24:49,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:24:49,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:24:49,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:24:49,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:24:49,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:24:49,511 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 265 [2022-11-16 12:24:49,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 308 transitions, 1469 flow. Second operand has 9 states, 9 states have (on average 190.0) internal successors, (1710), 9 states have internal predecessors, (1710), 0 states have call successors, (0), 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-16 12:24:49,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:24:49,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 265 [2022-11-16 12:24:49,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:24:55,433 INFO L130 PetriNetUnfolder]: 11816/22535 cut-off events. [2022-11-16 12:24:55,434 INFO L131 PetriNetUnfolder]: For 104739/105731 co-relation queries the response was YES. [2022-11-16 12:24:55,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89497 conditions, 22535 events. 11816/22535 cut-off events. For 104739/105731 co-relation queries the response was YES. Maximal size of possible extension queue 1227. Compared 204411 event pairs, 3327 based on Foata normal form. 610/22403 useless extension candidates. Maximal degree in co-relation 89465. Up to 12012 conditions per place. [2022-11-16 12:24:55,704 INFO L137 encePairwiseOnDemand]: 256/265 looper letters, 224 selfloop transitions, 11 changer transitions 0/405 dead transitions. [2022-11-16 12:24:55,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 405 transitions, 2951 flow [2022-11-16 12:24:55,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:24:55,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 12:24:55,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1751 transitions. [2022-11-16 12:24:55,717 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7341719077568134 [2022-11-16 12:24:55,718 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1751 transitions. [2022-11-16 12:24:55,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1751 transitions. [2022-11-16 12:24:55,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:24:55,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1751 transitions. [2022-11-16 12:24:55,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 194.55555555555554) internal successors, (1751), 9 states have internal predecessors, (1751), 0 states have call successors, (0), 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-16 12:24:55,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-16 12:24:55,730 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-16 12:24:55,730 INFO L175 Difference]: Start difference. First operand has 282 places, 308 transitions, 1469 flow. Second operand 9 states and 1751 transitions. [2022-11-16 12:24:55,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 405 transitions, 2951 flow [2022-11-16 12:24:55,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 405 transitions, 2948 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-16 12:24:55,971 INFO L231 Difference]: Finished difference. Result has 291 places, 312 transitions, 1533 flow [2022-11-16 12:24:55,972 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1533, PETRI_PLACES=291, PETRI_TRANSITIONS=312} [2022-11-16 12:24:55,972 INFO L288 CegarLoopForPetriNet]: 239 programPoint places, 52 predicate places. [2022-11-16 12:24:55,972 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 312 transitions, 1533 flow [2022-11-16 12:24:55,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 190.0) internal successors, (1710), 9 states have internal predecessors, (1710), 0 states have call successors, (0), 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-16 12:24:55,973 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:24:55,974 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:24:55,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 12:24:55,974 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:24:55,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:24:55,975 INFO L85 PathProgramCache]: Analyzing trace with hash 977373646, now seen corresponding path program 1 times [2022-11-16 12:24:55,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:24:55,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568570034] [2022-11-16 12:24:55,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:24:55,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:24:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:08,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:25:08,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:25:08,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568570034] [2022-11-16 12:25:08,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568570034] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:25:08,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520420166] [2022-11-16 12:25:08,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:08,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:25:08,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:25:08,490 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:25:08,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:25:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:08,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 141 conjunts are in the unsatisfiable core [2022-11-16 12:25:08,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:25:08,856 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 6 treesize of output 5 [2022-11-16 12:25:08,985 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:25:08,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-16 12:25:09,164 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:25:09,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-16 12:25:11,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:25:11,879 INFO L321 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2022-11-16 12:25:11,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 33 [2022-11-16 12:25:12,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 12:25:16,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:25:16,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:25:16,404 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-16 12:25:16,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 45 [2022-11-16 12:25:17,955 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 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 12:25:22,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:25:22,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:25:22,877 INFO L321 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2022-11-16 12:25:22,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 48 [2022-11-16 12:25:24,512 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 6 treesize of output 5 [2022-11-16 12:25:27,312 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 6 treesize of output 5 [2022-11-16 12:25:27,961 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:25:28,583 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 6 treesize of output 5 [2022-11-16 12:25:29,126 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 6 treesize of output 5 [2022-11-16 12:25:31,983 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:25:32,002 INFO L321 Elim1Store]: treesize reduction 41, result has 22.6 percent of original size [2022-11-16 12:25:32,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 25 [2022-11-16 12:25:32,140 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:25:32,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:25:35,513 WARN L833 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (let ((.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse3 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse5 (+ c_~f~0.offset (* c_~j~0 4))) (.cse6 (+ (* c_~q2_back~0 4) c_~q2~0.offset)) (.cse7 (+ c_~f~0.offset (* c_~i~0 4))) (.cse8 (+ (* c_~q1_back~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (~f~0.base Int)) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_494))) (let ((.cse0 (select .cse9 c_~q2~0.base)) (.cse4 (select .cse9 ~f~0.base)) (.cse2 (select .cse9 c_~q1~0.base))) (or (<= (+ (select .cse0 .cse1) (select .cse2 .cse3) c_~total~0) 0) (not (= (+ (select .cse4 .cse5) (select .cse0 .cse6)) 0)) (not (= (select .cse4 .cse7) (select .cse2 .cse8))))))) (forall ((v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (~f~0.base Int)) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_494))) (let ((.cse10 (select .cse13 c_~q2~0.base)) (.cse12 (select .cse13 ~f~0.base)) (.cse11 (select .cse13 c_~q1~0.base))) (or (< 0 (+ (select .cse10 .cse1) (select .cse11 .cse3) c_~total~0 1)) (not (= (+ (select .cse12 .cse5) (select .cse10 .cse6)) 0)) (not (= (select .cse12 .cse7) (select .cse11 .cse8))))))))) (not (< c_~q2_front~0 c_~n2~0)) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (not (<= 0 c_~q2_front~0)) (not (<= 0 c_~q1_front~0)) (not (< c_~q1_front~0 c_~n1~0)) (not (<= 0 c_~q2_back~0))) is different from false [2022-11-16 12:25:35,981 WARN L833 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (not (< c_~q2_front~0 c_~n2~0)) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (not (<= 0 c_~q2_front~0)) (not (<= 0 c_~q1_front~0)) (not (< c_~q1_front~0 c_~n1~0)) (not (<= 0 c_~q2_back~0)) (let ((.cse1 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse3 (+ c_~f~0.offset (* c_~i~0 4))) (.cse7 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse8 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse4 (+ c_~f~0.offset (* c_~j~0 4))) (.cse6 (+ (* c_~q2_back~0 4) c_~q2~0.offset))) (and (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (~f~0.base Int)) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_494))) (let ((.cse2 (select .cse9 ~f~0.base)) (.cse0 (select .cse9 c_~q1~0.base)) (.cse5 (select .cse9 c_~q2~0.base))) (or (not (= (select .cse0 .cse1) (select .cse2 .cse3))) (not (= (+ (select .cse2 .cse4) (select .cse5 .cse6)) 0)) (<= (+ (select .cse0 .cse7) (select .cse5 .cse8) c_~total~0) 0))))) (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (~f~0.base Int)) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_494))) (let ((.cse10 (select .cse13 c_~q1~0.base)) (.cse11 (select .cse13 ~f~0.base)) (.cse12 (select .cse13 c_~q2~0.base))) (or (not (= (select .cse10 .cse1) (select .cse11 .cse3))) (< 0 (+ (select .cse10 .cse7) (select .cse12 .cse8) c_~total~0 1)) (not (= (+ (select .cse11 .cse4) (select .cse12 .cse6)) 0))))))))) is different from false [2022-11-16 12:25:42,044 WARN L833 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (not (< c_~q2_front~0 c_~n2~0)) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (not (<= 0 c_~q2_front~0)) (not (<= 0 c_~q1_front~0)) (not (< c_~q1_front~0 c_~n1~0)) (let ((.cse1 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset| (* c_~j~0 4))) (.cse3 (+ (* c_~q2_back~0 4) c_~q2~0.offset)) (.cse4 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset| (* c_~i~0 4))) (.cse6 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse7 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse8 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (~f~0.base Int)) (let ((.cse9 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_494))) (let ((.cse0 (select .cse9 ~f~0.base)) (.cse2 (select .cse9 c_~q2~0.base)) (.cse5 (select .cse9 c_~q1~0.base))) (or (not (= (+ (select .cse0 .cse1) (select .cse2 .cse3)) 0)) (not (= (select .cse0 .cse4) (select .cse5 .cse6))) (< 0 (+ (select .cse2 .cse7) (select .cse5 .cse8) c_~total~0 1)))))) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (~f~0.base Int)) (let ((.cse13 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_494))) (let ((.cse10 (select .cse13 ~f~0.base)) (.cse11 (select .cse13 c_~q2~0.base)) (.cse12 (select .cse13 c_~q1~0.base))) (or (not (= (+ (select .cse10 .cse1) (select .cse11 .cse3)) 0)) (not (= (select .cse10 .cse4) (select .cse12 .cse6))) (<= (+ (select .cse11 .cse7) (select .cse12 .cse8) c_~total~0) 0))))))) (not (<= 0 c_~q2_back~0))) is different from false [2022-11-16 12:27:32,758 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 139 [2022-11-16 12:27:32,759 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-16 12:27:32,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:27:32,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:27:32,962 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:67) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:625) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 55 more [2022-11-16 12:27:32,966 INFO L158 Benchmark]: Toolchain (without parser) took 195917.41ms. Allocated memory was 104.9MB in the beginning and 4.9GB in the end (delta: 4.8GB). Free memory was 61.8MB in the beginning and 3.4GB in the end (delta: -3.4GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-11-16 12:27:32,966 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 104.9MB. Free memory is still 78.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:27:32,967 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.76ms. Allocated memory is still 104.9MB. Free memory was 61.6MB in the beginning and 76.7MB in the end (delta: -15.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 12:27:32,967 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.80ms. Allocated memory is still 104.9MB. Free memory was 76.7MB in the beginning and 73.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:27:32,967 INFO L158 Benchmark]: Boogie Preprocessor took 38.85ms. Allocated memory is still 104.9MB. Free memory was 73.8MB in the beginning and 71.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:27:32,967 INFO L158 Benchmark]: RCFGBuilder took 1259.04ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 71.4MB in the beginning and 78.8MB in the end (delta: -7.4MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2022-11-16 12:27:32,967 INFO L158 Benchmark]: TraceAbstraction took 194120.58ms. Allocated memory was 125.8MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 78.1MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-11-16 12:27:32,968 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 104.9MB. Free memory is still 78.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.76ms. Allocated memory is still 104.9MB. Free memory was 61.6MB in the beginning and 76.7MB in the end (delta: -15.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.80ms. Allocated memory is still 104.9MB. Free memory was 76.7MB in the beginning and 73.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.85ms. Allocated memory is still 104.9MB. Free memory was 73.8MB in the beginning and 71.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1259.04ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 71.4MB in the beginning and 78.8MB in the end (delta: -7.4MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. * TraceAbstraction took 194120.58ms. Allocated memory was 125.8MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 78.1MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f83ae5bec1717d6f197d4259600c0d1f406909832409df09253b7bf70d3f66fc --- 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-e04fb08 [2022-11-16 12:27:35,286 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:27:35,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:27:35,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:27:35,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:27:35,332 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:27:35,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:27:35,341 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:27:35,343 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:27:35,348 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:27:35,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:27:35,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:27:35,352 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:27:35,354 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:27:35,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:27:35,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:27:35,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:27:35,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:27:35,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:27:35,370 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:27:35,373 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:27:35,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:27:35,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:27:35,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:27:35,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:27:35,389 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:27:35,389 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:27:35,390 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:27:35,391 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:27:35,392 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:27:35,392 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:27:35,393 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:27:35,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:27:35,394 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:27:35,395 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:27:35,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:27:35,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:27:35,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:27:35,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:27:35,400 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:27:35,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:27:35,406 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-16 12:27:35,438 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:27:35,439 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:27:35,440 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:27:35,440 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:27:35,441 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:27:35,441 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:27:35,443 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:27:35,443 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:27:35,443 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:27:35,444 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:27:35,445 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:27:35,445 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:27:35,445 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:27:35,446 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:27:35,446 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:27:35,447 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:27:35,447 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:27:35,447 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 12:27:35,448 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 12:27:35,448 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:27:35,448 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:27:35,449 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:27:35,449 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:27:35,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:27:35,449 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:27:35,450 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:27:35,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:27:35,451 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:27:35,451 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:27:35,451 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:27:35,451 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 12:27:35,452 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 12:27:35,452 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:27:35,452 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:27:35,453 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:27:35,453 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 12:27:35,453 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/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_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f83ae5bec1717d6f197d4259600c0d1f406909832409df09253b7bf70d3f66fc [2022-11-16 12:27:35,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:27:35,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:27:35,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:27:35,912 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:27:35,914 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:27:35,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2022-11-16 12:27:35,987 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/data/51bed96fb/0eb95912644144efb7bf23627ed23585/FLAGe4953d454 [2022-11-16 12:27:36,459 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:27:36,460 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2022-11-16 12:27:36,470 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/data/51bed96fb/0eb95912644144efb7bf23627ed23585/FLAGe4953d454 [2022-11-16 12:27:36,818 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/data/51bed96fb/0eb95912644144efb7bf23627ed23585 [2022-11-16 12:27:36,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:27:36,825 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:27:36,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:27:36,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:27:36,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:27:36,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:27:36" (1/1) ... [2022-11-16 12:27:36,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33eca840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:36, skipping insertion in model container [2022-11-16 12:27:36,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:27:36" (1/1) ... [2022-11-16 12:27:36,845 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:27:36,881 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:27:37,181 WARN L229 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_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c[4232,4245] [2022-11-16 12:27:37,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:27:37,223 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-16 12:27:37,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:27:37,245 WARN L229 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_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c[4232,4245] [2022-11-16 12:27:37,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:27:37,254 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:27:37,278 WARN L229 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_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c[4232,4245] [2022-11-16 12:27:37,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:27:37,297 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:27:37,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:37 WrapperNode [2022-11-16 12:27:37,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:27:37,299 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:27:37,299 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:27:37,300 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:27:37,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:37" (1/1) ... [2022-11-16 12:27:37,318 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:37" (1/1) ... [2022-11-16 12:27:37,350 INFO L138 Inliner]: procedures = 29, calls = 83, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 336 [2022-11-16 12:27:37,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:27:37,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:27:37,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:27:37,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:27:37,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:37" (1/1) ... [2022-11-16 12:27:37,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:37" (1/1) ... [2022-11-16 12:27:37,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:37" (1/1) ... [2022-11-16 12:27:37,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:37" (1/1) ... [2022-11-16 12:27:37,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:37" (1/1) ... [2022-11-16 12:27:37,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:37" (1/1) ... [2022-11-16 12:27:37,387 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:37" (1/1) ... [2022-11-16 12:27:37,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:37" (1/1) ... [2022-11-16 12:27:37,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:27:37,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:27:37,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:27:37,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:27:37,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:37" (1/1) ... [2022-11-16 12:27:37,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:27:37,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:27:37,426 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:27:37,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:27:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:27:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 12:27:37,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:27:37,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-16 12:27:37,462 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 12:27:37,462 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 12:27:37,462 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 12:27:37,462 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 12:27:37,463 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-16 12:27:37,463 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-16 12:27:37,463 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-16 12:27:37,463 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-16 12:27:37,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 12:27:37,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 12:27:37,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:27:37,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:27:37,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:27:37,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:27:37,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 12:27:37,466 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 12:27:37,596 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:27:37,598 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:27:38,399 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:27:38,677 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:27:38,677 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2022-11-16 12:27:38,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:27:38 BoogieIcfgContainer [2022-11-16 12:27:38,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:27:38,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:27:38,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:27:38,685 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:27:38,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:27:36" (1/3) ... [2022-11-16 12:27:38,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4957a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:27:38, skipping insertion in model container [2022-11-16 12:27:38,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:37" (2/3) ... [2022-11-16 12:27:38,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4957a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:27:38, skipping insertion in model container [2022-11-16 12:27:38,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:27:38" (3/3) ... [2022-11-16 12:27:38,689 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2022-11-16 12:27:38,697 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 12:27:38,707 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:27:38,708 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:27:38,708 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:27:38,798 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-16 12:27:38,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 257 transitions, 546 flow [2022-11-16 12:27:39,017 INFO L130 PetriNetUnfolder]: 22/253 cut-off events. [2022-11-16 12:27:39,017 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-16 12:27:39,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 253 events. 22/253 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 121 event pairs, 0 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 214. Up to 2 conditions per place. [2022-11-16 12:27:39,024 INFO L82 GeneralOperation]: Start removeDead. Operand has 248 places, 257 transitions, 546 flow [2022-11-16 12:27:39,034 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 240 transitions, 504 flow [2022-11-16 12:27:39,051 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:27:39,059 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@a63cd7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:27:39,060 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-16 12:27:39,146 INFO L130 PetriNetUnfolder]: 22/239 cut-off events. [2022-11-16 12:27:39,146 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-16 12:27:39,147 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:27:39,148 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:39,149 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:27:39,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:39,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1233377353, now seen corresponding path program 1 times [2022-11-16 12:27:39,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:27:39,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321037397] [2022-11-16 12:27:39,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:39,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:27:39,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:27:39,173 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:27:39,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-16 12:27:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:39,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 12:27:39,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:27:39,538 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-16 12:27:39,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:27:39,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:27:39,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321037397] [2022-11-16 12:27:39,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321037397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:39,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:27:39,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:27:39,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774902893] [2022-11-16 12:27:39,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:39,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:27:39,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:27:39,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:27:39,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:27:39,586 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 257 [2022-11-16 12:27:39,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 240 transitions, 504 flow. Second operand has 2 states, 2 states have (on average 236.5) internal successors, (473), 2 states have internal predecessors, (473), 0 states have call successors, (0), 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-16 12:27:39,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:27:39,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 257 [2022-11-16 12:27:39,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:27:39,873 INFO L130 PetriNetUnfolder]: 124/540 cut-off events. [2022-11-16 12:27:39,874 INFO L131 PetriNetUnfolder]: For 105/106 co-relation queries the response was YES. [2022-11-16 12:27:39,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 540 events. 124/540 cut-off events. For 105/106 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1718 event pairs, 51 based on Foata normal form. 128/605 useless extension candidates. Maximal degree in co-relation 504. Up to 163 conditions per place. [2022-11-16 12:27:39,885 INFO L137 encePairwiseOnDemand]: 242/257 looper letters, 12 selfloop transitions, 0 changer transitions 8/225 dead transitions. [2022-11-16 12:27:39,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 225 transitions, 498 flow [2022-11-16 12:27:39,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:27:39,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 12:27:39,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 485 transitions. [2022-11-16 12:27:39,909 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.943579766536965 [2022-11-16 12:27:39,910 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 485 transitions. [2022-11-16 12:27:39,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 485 transitions. [2022-11-16 12:27:39,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:27:39,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 485 transitions. [2022-11-16 12:27:39,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 242.5) internal successors, (485), 2 states have internal predecessors, (485), 0 states have call successors, (0), 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-16 12:27:39,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 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-16 12:27:39,932 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 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-16 12:27:39,934 INFO L175 Difference]: Start difference. First operand has 231 places, 240 transitions, 504 flow. Second operand 2 states and 485 transitions. [2022-11-16 12:27:39,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 225 transitions, 498 flow [2022-11-16 12:27:39,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 225 transitions, 482 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-11-16 12:27:39,947 INFO L231 Difference]: Finished difference. Result has 224 places, 217 transitions, 442 flow [2022-11-16 12:27:39,949 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=442, PETRI_PLACES=224, PETRI_TRANSITIONS=217} [2022-11-16 12:27:39,955 INFO L288 CegarLoopForPetriNet]: 231 programPoint places, -7 predicate places. [2022-11-16 12:27:39,956 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 217 transitions, 442 flow [2022-11-16 12:27:39,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 236.5) internal successors, (473), 2 states have internal predecessors, (473), 0 states have call successors, (0), 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-16 12:27:39,959 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:27:39,960 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:39,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:27:40,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:27:40,179 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:27:40,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:40,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1592326614, now seen corresponding path program 1 times [2022-11-16 12:27:40,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:27:40,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096078089] [2022-11-16 12:27:40,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:40,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:27:40,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:27:40,184 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:27:40,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-16 12:27:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:40,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:27:40,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:27:40,861 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-16 12:27:40,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:27:40,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:27:40,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096078089] [2022-11-16 12:27:40,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1096078089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:40,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:27:40,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:27:40,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24143629] [2022-11-16 12:27:40,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:40,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:27:40,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:27:40,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:27:40,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:27:40,872 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 257 [2022-11-16 12:27:40,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 217 transitions, 442 flow. Second operand has 5 states, 5 states have (on average 196.2) internal successors, (981), 5 states have internal predecessors, (981), 0 states have call successors, (0), 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-16 12:27:40,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:27:40,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 257 [2022-11-16 12:27:40,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:27:41,247 INFO L130 PetriNetUnfolder]: 134/544 cut-off events. [2022-11-16 12:27:41,248 INFO L131 PetriNetUnfolder]: For 31/32 co-relation queries the response was YES. [2022-11-16 12:27:41,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 544 events. 134/544 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1657 event pairs, 14 based on Foata normal form. 1/503 useless extension candidates. Maximal degree in co-relation 767. Up to 133 conditions per place. [2022-11-16 12:27:41,252 INFO L137 encePairwiseOnDemand]: 251/257 looper letters, 50 selfloop transitions, 3 changer transitions 4/229 dead transitions. [2022-11-16 12:27:41,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 229 transitions, 585 flow [2022-11-16 12:27:41,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:27:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 12:27:41,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 998 transitions. [2022-11-16 12:27:41,257 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7766536964980545 [2022-11-16 12:27:41,258 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 998 transitions. [2022-11-16 12:27:41,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 998 transitions. [2022-11-16 12:27:41,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:27:41,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 998 transitions. [2022-11-16 12:27:41,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 199.6) internal successors, (998), 5 states have internal predecessors, (998), 0 states have call successors, (0), 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-16 12:27:41,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 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-16 12:27:41,268 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 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-16 12:27:41,269 INFO L175 Difference]: Start difference. First operand has 224 places, 217 transitions, 442 flow. Second operand 5 states and 998 transitions. [2022-11-16 12:27:41,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 229 transitions, 585 flow [2022-11-16 12:27:41,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 229 transitions, 585 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:27:41,281 INFO L231 Difference]: Finished difference. Result has 223 places, 219 transitions, 465 flow [2022-11-16 12:27:41,281 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=465, PETRI_PLACES=223, PETRI_TRANSITIONS=219} [2022-11-16 12:27:41,282 INFO L288 CegarLoopForPetriNet]: 231 programPoint places, -8 predicate places. [2022-11-16 12:27:41,283 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 219 transitions, 465 flow [2022-11-16 12:27:41,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 196.2) internal successors, (981), 5 states have internal predecessors, (981), 0 states have call successors, (0), 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-16 12:27:41,284 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:27:41,284 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:41,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:27:41,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:27:41,497 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:27:41,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:41,498 INFO L85 PathProgramCache]: Analyzing trace with hash -368080173, now seen corresponding path program 1 times [2022-11-16 12:27:41,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:27:41,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398229227] [2022-11-16 12:27:41,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:41,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:27:41,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:27:41,502 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:27:41,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-16 12:27:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:41,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:27:41,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:27:42,189 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-16 12:27:42,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:27:42,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:27:42,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398229227] [2022-11-16 12:27:42,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398229227] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:42,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:27:42,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:27:42,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315332293] [2022-11-16 12:27:42,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:42,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:27:42,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:27:42,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:27:42,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:27:42,195 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 257 [2022-11-16 12:27:42,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 219 transitions, 465 flow. Second operand has 6 states, 6 states have (on average 212.33333333333334) internal successors, (1274), 6 states have internal predecessors, (1274), 0 states have call successors, (0), 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-16 12:27:42,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:27:42,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 257 [2022-11-16 12:27:42,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:27:43,933 INFO L130 PetriNetUnfolder]: 2285/4804 cut-off events. [2022-11-16 12:27:43,933 INFO L131 PetriNetUnfolder]: For 553/584 co-relation queries the response was YES. [2022-11-16 12:27:43,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8692 conditions, 4804 events. 2285/4804 cut-off events. For 553/584 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 35222 event pairs, 695 based on Foata normal form. 78/4151 useless extension candidates. Maximal degree in co-relation 8685. Up to 1459 conditions per place. [2022-11-16 12:27:43,972 INFO L137 encePairwiseOnDemand]: 249/257 looper letters, 113 selfloop transitions, 12 changer transitions 1/310 dead transitions. [2022-11-16 12:27:43,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 310 transitions, 955 flow [2022-11-16 12:27:43,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:27:43,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 12:27:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1993 transitions. [2022-11-16 12:27:43,997 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8616515348032858 [2022-11-16 12:27:43,997 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1993 transitions. [2022-11-16 12:27:43,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1993 transitions. [2022-11-16 12:27:43,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:27:43,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1993 transitions. [2022-11-16 12:27:44,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 221.44444444444446) internal successors, (1993), 9 states have internal predecessors, (1993), 0 states have call successors, (0), 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-16 12:27:44,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 0 states have call successors, (0), 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-16 12:27:44,011 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 0 states have call successors, (0), 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-16 12:27:44,011 INFO L175 Difference]: Start difference. First operand has 223 places, 219 transitions, 465 flow. Second operand 9 states and 1993 transitions. [2022-11-16 12:27:44,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 310 transitions, 955 flow [2022-11-16 12:27:44,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 310 transitions, 941 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-11-16 12:27:44,018 INFO L231 Difference]: Finished difference. Result has 231 places, 229 transitions, 545 flow [2022-11-16 12:27:44,019 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=545, PETRI_PLACES=231, PETRI_TRANSITIONS=229} [2022-11-16 12:27:44,020 INFO L288 CegarLoopForPetriNet]: 231 programPoint places, 0 predicate places. [2022-11-16 12:27:44,020 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 229 transitions, 545 flow [2022-11-16 12:27:44,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 212.33333333333334) internal successors, (1274), 6 states have internal predecessors, (1274), 0 states have call successors, (0), 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-16 12:27:44,021 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:27:44,021 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:44,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:27:44,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:27:44,236 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:27:44,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:44,237 INFO L85 PathProgramCache]: Analyzing trace with hash -428452407, now seen corresponding path program 1 times [2022-11-16 12:27:44,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:27:44,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880260805] [2022-11-16 12:27:44,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:44,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:27:44,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:27:44,240 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:27:44,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-16 12:27:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:44,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:27:44,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:27:45,135 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-16 12:27:45,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:27:45,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:27:45,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880260805] [2022-11-16 12:27:45,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880260805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:45,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:27:45,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:27:45,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125006067] [2022-11-16 12:27:45,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:45,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:27:45,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:27:45,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:27:45,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:27:45,141 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 257 [2022-11-16 12:27:45,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 229 transitions, 545 flow. Second operand has 6 states, 6 states have (on average 212.33333333333334) internal successors, (1274), 6 states have internal predecessors, (1274), 0 states have call successors, (0), 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-16 12:27:45,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:27:45,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 257 [2022-11-16 12:27:45,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:27:47,392 INFO L130 PetriNetUnfolder]: 3693/7029 cut-off events. [2022-11-16 12:27:47,392 INFO L131 PetriNetUnfolder]: For 8215/9361 co-relation queries the response was YES. [2022-11-16 12:27:47,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16133 conditions, 7029 events. 3693/7029 cut-off events. For 8215/9361 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 52941 event pairs, 580 based on Foata normal form. 435/6549 useless extension candidates. Maximal degree in co-relation 16123. Up to 2607 conditions per place. [2022-11-16 12:27:47,476 INFO L137 encePairwiseOnDemand]: 249/257 looper letters, 137 selfloop transitions, 12 changer transitions 8/347 dead transitions. [2022-11-16 12:27:47,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 347 transitions, 1388 flow [2022-11-16 12:27:47,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:27:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 12:27:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1992 transitions. [2022-11-16 12:27:47,483 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8612191958495461 [2022-11-16 12:27:47,483 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1992 transitions. [2022-11-16 12:27:47,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1992 transitions. [2022-11-16 12:27:47,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:27:47,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1992 transitions. [2022-11-16 12:27:47,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 221.33333333333334) internal successors, (1992), 9 states have internal predecessors, (1992), 0 states have call successors, (0), 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-16 12:27:47,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 0 states have call successors, (0), 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-16 12:27:47,500 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 0 states have call successors, (0), 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-16 12:27:47,500 INFO L175 Difference]: Start difference. First operand has 231 places, 229 transitions, 545 flow. Second operand 9 states and 1992 transitions. [2022-11-16 12:27:47,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 347 transitions, 1388 flow [2022-11-16 12:27:47,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 347 transitions, 1388 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:27:47,521 INFO L231 Difference]: Finished difference. Result has 244 places, 239 transitions, 632 flow [2022-11-16 12:27:47,522 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=632, PETRI_PLACES=244, PETRI_TRANSITIONS=239} [2022-11-16 12:27:47,523 INFO L288 CegarLoopForPetriNet]: 231 programPoint places, 13 predicate places. [2022-11-16 12:27:47,523 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 239 transitions, 632 flow [2022-11-16 12:27:47,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 212.33333333333334) internal successors, (1274), 6 states have internal predecessors, (1274), 0 states have call successors, (0), 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-16 12:27:47,524 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:27:47,524 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:47,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:27:47,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:27:47,738 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:27:47,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:47,739 INFO L85 PathProgramCache]: Analyzing trace with hash 407943098, now seen corresponding path program 1 times [2022-11-16 12:27:47,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:27:47,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936285072] [2022-11-16 12:27:47,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:47,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:27:47,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:27:47,742 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:27:47,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-16 12:27:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:47,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 12:27:47,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:27:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:27:48,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:27:48,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:27:48,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936285072] [2022-11-16 12:27:48,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936285072] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:48,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:27:48,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-16 12:27:48,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497404695] [2022-11-16 12:27:48,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:48,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:27:48,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:27:48,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:27:48,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:27:48,830 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 257 [2022-11-16 12:27:48,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 239 transitions, 632 flow. Second operand has 14 states, 14 states have (on average 151.07142857142858) internal successors, (2115), 14 states have internal predecessors, (2115), 0 states have call successors, (0), 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-16 12:27:48,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:27:48,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 257 [2022-11-16 12:27:48,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:27:51,765 INFO L130 PetriNetUnfolder]: 2327/6328 cut-off events. [2022-11-16 12:27:51,765 INFO L131 PetriNetUnfolder]: For 9480/10321 co-relation queries the response was YES. [2022-11-16 12:27:51,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15984 conditions, 6328 events. 2327/6328 cut-off events. For 9480/10321 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 56689 event pairs, 1305 based on Foata normal form. 334/6384 useless extension candidates. Maximal degree in co-relation 15968. Up to 1560 conditions per place. [2022-11-16 12:27:51,827 INFO L137 encePairwiseOnDemand]: 235/257 looper letters, 149 selfloop transitions, 27 changer transitions 0/316 dead transitions. [2022-11-16 12:27:51,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 316 transitions, 1302 flow [2022-11-16 12:27:51,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 12:27:51,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-11-16 12:27:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3361 transitions. [2022-11-16 12:27:51,837 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5944464096215069 [2022-11-16 12:27:51,838 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3361 transitions. [2022-11-16 12:27:51,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3361 transitions. [2022-11-16 12:27:51,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:27:51,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3361 transitions. [2022-11-16 12:27:51,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 152.77272727272728) internal successors, (3361), 22 states have internal predecessors, (3361), 0 states have call successors, (0), 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-16 12:27:51,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 257.0) internal successors, (5911), 23 states have internal predecessors, (5911), 0 states have call successors, (0), 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-16 12:27:51,866 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 257.0) internal successors, (5911), 23 states have internal predecessors, (5911), 0 states have call successors, (0), 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-16 12:27:51,866 INFO L175 Difference]: Start difference. First operand has 244 places, 239 transitions, 632 flow. Second operand 22 states and 3361 transitions. [2022-11-16 12:27:51,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 316 transitions, 1302 flow [2022-11-16 12:27:51,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 316 transitions, 1302 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:27:51,899 INFO L231 Difference]: Finished difference. Result has 268 places, 249 transitions, 742 flow [2022-11-16 12:27:51,900 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=742, PETRI_PLACES=268, PETRI_TRANSITIONS=249} [2022-11-16 12:27:51,901 INFO L288 CegarLoopForPetriNet]: 231 programPoint places, 37 predicate places. [2022-11-16 12:27:51,901 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 249 transitions, 742 flow [2022-11-16 12:27:51,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 151.07142857142858) internal successors, (2115), 14 states have internal predecessors, (2115), 0 states have call successors, (0), 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-16 12:27:51,902 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:27:51,903 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:51,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:27:52,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:27:52,122 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:27:52,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:52,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1653180936, now seen corresponding path program 1 times [2022-11-16 12:27:52,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:27:52,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393981602] [2022-11-16 12:27:52,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:52,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:27:52,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:27:52,126 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:27:52,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-16 12:27:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 12:27:52,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:27:53,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:27:53,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:27:53,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:27:53,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393981602] [2022-11-16 12:27:53,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393981602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:53,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:27:53,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-16 12:27:53,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54623664] [2022-11-16 12:27:53,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:53,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 12:27:53,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:27:53,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 12:27:53,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:27:53,973 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 257 [2022-11-16 12:27:53,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 249 transitions, 742 flow. Second operand has 15 states, 15 states have (on average 159.66666666666666) internal successors, (2395), 15 states have internal predecessors, (2395), 0 states have call successors, (0), 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-16 12:27:53,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:27:53,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 257 [2022-11-16 12:27:53,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:27:58,610 INFO L130 PetriNetUnfolder]: 6530/14557 cut-off events. [2022-11-16 12:27:58,610 INFO L131 PetriNetUnfolder]: For 24396/25699 co-relation queries the response was YES. [2022-11-16 12:27:58,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39348 conditions, 14557 events. 6530/14557 cut-off events. For 24396/25699 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 140210 event pairs, 1406 based on Foata normal form. 1268/15420 useless extension candidates. Maximal degree in co-relation 39328. Up to 3542 conditions per place. [2022-11-16 12:27:58,768 INFO L137 encePairwiseOnDemand]: 232/257 looper letters, 232 selfloop transitions, 58 changer transitions 5/443 dead transitions. [2022-11-16 12:27:58,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 443 transitions, 2241 flow [2022-11-16 12:27:58,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 12:27:58,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-11-16 12:27:58,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4109 transitions. [2022-11-16 12:27:58,782 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6395330739299611 [2022-11-16 12:27:58,782 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 4109 transitions. [2022-11-16 12:27:58,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 4109 transitions. [2022-11-16 12:27:58,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:27:58,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 4109 transitions. [2022-11-16 12:27:58,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 164.36) internal successors, (4109), 25 states have internal predecessors, (4109), 0 states have call successors, (0), 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-16 12:27:58,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 257.0) internal successors, (6682), 26 states have internal predecessors, (6682), 0 states have call successors, (0), 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-16 12:27:58,815 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 257.0) internal successors, (6682), 26 states have internal predecessors, (6682), 0 states have call successors, (0), 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-16 12:27:58,815 INFO L175 Difference]: Start difference. First operand has 268 places, 249 transitions, 742 flow. Second operand 25 states and 4109 transitions. [2022-11-16 12:27:58,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 443 transitions, 2241 flow [2022-11-16 12:27:58,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 443 transitions, 2215 flow, removed 0 selfloop flow, removed 11 redundant places. [2022-11-16 12:27:58,903 INFO L231 Difference]: Finished difference. Result has 289 places, 290 transitions, 1155 flow [2022-11-16 12:27:58,903 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1155, PETRI_PLACES=289, PETRI_TRANSITIONS=290} [2022-11-16 12:27:58,906 INFO L288 CegarLoopForPetriNet]: 231 programPoint places, 58 predicate places. [2022-11-16 12:27:58,907 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 290 transitions, 1155 flow [2022-11-16 12:27:58,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 159.66666666666666) internal successors, (2395), 15 states have internal predecessors, (2395), 0 states have call successors, (0), 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-16 12:27:58,908 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:27:58,909 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:58,927 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-11-16 12:27:59,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:27:59,124 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:27:59,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:59,125 INFO L85 PathProgramCache]: Analyzing trace with hash 2111592158, now seen corresponding path program 2 times [2022-11-16 12:27:59,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:27:59,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57876016] [2022-11-16 12:27:59,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:27:59,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:27:59,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:27:59,128 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:27:59,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-16 12:27:59,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:27:59,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:27:59,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 12:27:59,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:28:01,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:28:01,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:28:01,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:28:01,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57876016] [2022-11-16 12:28:01,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57876016] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:28:01,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:28:01,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-16 12:28:01,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801266058] [2022-11-16 12:28:01,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:28:01,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 12:28:01,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:28:01,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 12:28:01,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:28:01,147 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 257 [2022-11-16 12:28:01,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 290 transitions, 1155 flow. Second operand has 15 states, 15 states have (on average 159.66666666666666) internal successors, (2395), 15 states have internal predecessors, (2395), 0 states have call successors, (0), 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-16 12:28:01,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:28:01,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 257 [2022-11-16 12:28:01,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:28:05,695 INFO L130 PetriNetUnfolder]: 6360/13157 cut-off events. [2022-11-16 12:28:05,695 INFO L131 PetriNetUnfolder]: For 34426/35763 co-relation queries the response was YES. [2022-11-16 12:28:05,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42429 conditions, 13157 events. 6360/13157 cut-off events. For 34426/35763 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 118643 event pairs, 698 based on Foata normal form. 1046/13932 useless extension candidates. Maximal degree in co-relation 42400. Up to 2854 conditions per place. [2022-11-16 12:28:05,940 INFO L137 encePairwiseOnDemand]: 234/257 looper letters, 198 selfloop transitions, 80 changer transitions 4/430 dead transitions. [2022-11-16 12:28:05,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 430 transitions, 2591 flow [2022-11-16 12:28:05,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 12:28:05,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-16 12:28:05,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3916 transitions. [2022-11-16 12:28:05,953 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6348897535667963 [2022-11-16 12:28:05,953 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3916 transitions. [2022-11-16 12:28:05,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3916 transitions. [2022-11-16 12:28:05,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:28:05,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3916 transitions. [2022-11-16 12:28:05,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 163.16666666666666) internal successors, (3916), 24 states have internal predecessors, (3916), 0 states have call successors, (0), 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-16 12:28:05,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 257.0) internal successors, (6425), 25 states have internal predecessors, (6425), 0 states have call successors, (0), 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-16 12:28:05,991 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 257.0) internal successors, (6425), 25 states have internal predecessors, (6425), 0 states have call successors, (0), 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-16 12:28:05,991 INFO L175 Difference]: Start difference. First operand has 289 places, 290 transitions, 1155 flow. Second operand 24 states and 3916 transitions. [2022-11-16 12:28:05,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 430 transitions, 2591 flow [2022-11-16 12:28:06,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 430 transitions, 2565 flow, removed 0 selfloop flow, removed 11 redundant places. [2022-11-16 12:28:06,109 INFO L231 Difference]: Finished difference. Result has 305 places, 323 transitions, 1671 flow [2022-11-16 12:28:06,109 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1671, PETRI_PLACES=305, PETRI_TRANSITIONS=323} [2022-11-16 12:28:06,110 INFO L288 CegarLoopForPetriNet]: 231 programPoint places, 74 predicate places. [2022-11-16 12:28:06,110 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 323 transitions, 1671 flow [2022-11-16 12:28:06,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 159.66666666666666) internal successors, (2395), 15 states have internal predecessors, (2395), 0 states have call successors, (0), 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-16 12:28:06,111 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:28:06,112 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:28:06,130 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-16 12:28:06,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:28:06,326 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:28:06,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:28:06,326 INFO L85 PathProgramCache]: Analyzing trace with hash 136621564, now seen corresponding path program 3 times [2022-11-16 12:28:06,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:28:06,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964908450] [2022-11-16 12:28:06,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:28:06,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:28:06,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:28:06,329 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:28:06,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-16 12:28:06,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 12:28:06,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:28:06,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 12:28:06,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:28:07,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:28:07,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:28:07,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:28:07,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1964908450] [2022-11-16 12:28:07,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1964908450] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:28:07,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:28:07,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-16 12:28:07,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342561689] [2022-11-16 12:28:07,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:28:07,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:28:07,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:28:07,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:28:07,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:28:07,700 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 257 [2022-11-16 12:28:07,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 323 transitions, 1671 flow. Second operand has 14 states, 14 states have (on average 151.07142857142858) internal successors, (2115), 14 states have internal predecessors, (2115), 0 states have call successors, (0), 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-16 12:28:07,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:28:07,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 257 [2022-11-16 12:28:07,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:28:10,598 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([973] L52-->L58: Formula: (and (not (= (ite (= (let ((.cse0 (select |v_#memory_int_76| v_~q1~0.base_23)) (.cse1 (bvmul (_ bv4 32) v_~q1_back~0_64))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) .cse1 v_~q1~0.offset_23)) (select .cse0 (bvadd (_ bv2 32) .cse1 v_~q1~0.offset_23))) (select .cse0 (bvadd .cse1 v_~q1~0.offset_23 (_ bv1 32)))) (select .cse0 (bvadd .cse1 v_~q1~0.offset_23)))) (let ((.cse2 (select |v_#memory_int_76| v_~f~0.base_36)) (.cse3 (bvmul (_ bv4 32) v_~i~0_34))) (concat (concat (concat (select .cse2 (bvadd (_ bv3 32) .cse3 v_~f~0.offset_36)) (select .cse2 (bvadd (_ bv2 32) .cse3 v_~f~0.offset_36))) (select .cse2 (bvadd .cse3 v_~f~0.offset_36 (_ bv1 32)))) (select .cse2 (bvadd .cse3 v_~f~0.offset_36))))) (_ bv1 32) (_ bv0 32)) (_ bv0 32))) (= v_~q1_back~0_63 (bvadd v_~q1_back~0_64 (_ bv1 32))) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| (_ bv0 32))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (bvslt v_~q1_back~0_64 (_ bv2147483647 32)) (_ bv1 32) (_ bv0 32))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (bvadd v_~i~0_34 (_ bv1 32)) v_~i~0_33) (not (= (ite (and (bvslt v_~q1_back~0_64 v_~n1~0_22) (bvsge v_~q1_back~0_64 (_ bv0 32))) (_ bv1 32) (_ bv0 32)) (_ bv0 32)))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_1|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_1|, ~q1_back~0=v_~q1_back~0_63, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_#t~post3#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][308], [113#L92-1true, 3821#true, 30#L144-4true, 1835#(= (_ bv0 8) |thread3Thread1of1ForFork0_~cond~2#1|), 33#L58true, 44#L72true, 251#true, 1970#true, 211#L118true, 3185#true, Black: 4439#(and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvsge ~N~0 (_ bv0 32)) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (not (bvslt (_ bv0 32) ~N~0))), Black: 4435#(and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvsge ~N~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (not (bvslt (_ bv0 32) ~N~0))), 2557#true, Black: 4441#(and (or (and (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (bvslt (_ bv0 32) ~N~0)) (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (not (bvslt (_ bv0 32) ~N~0)))) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))), Black: 4433#(and (or (and (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (bvslt (_ bv0 32) ~N~0)) (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (not (bvslt (_ bv0 32) ~N~0)))) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))), 4451#true, Black: 3811#(and (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|) (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|)), Black: 874#(= (_ bv0 32) ~total~0), Black: 3807#(and (= ~i~0 (_ bv0 32)) (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|)), Black: 3795#(and (or (and (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (bvslt (_ bv0 32) ~N~0)) (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (not (bvslt (_ bv0 32) ~N~0)))) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))), Black: 3805#(and (= ~i~0 (_ bv0 32)) (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|) (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|)), Black: 3791#(and (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))), Black: 3809#(and (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|) (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (= ~j~0 (_ bv0 32)) (bvslt (_ bv0 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 3801#(and (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvslt (_ bv0 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))), Black: 3797#(and (or (and (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (bvslt (_ bv0 32) ~N~0)) (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (not (bvslt (_ bv0 32) ~N~0)))) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8))) (and (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|) (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|))) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))), Black: 1961#(and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (= (_ bv0 8) |thread3Thread1of1ForFork0_~cond~2#1|) (= ~q1_front~0 ~q1_back~0) (not (bvslt ~i~0 ~N~0))), Black: 3164#(and (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| (_ bv0 32))), Black: 1785#(and (= ~q1_front~0 ~q1_back~0) (or (and (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (bvslt ~i~0 ~N~0)) (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (not (bvslt ~i~0 ~N~0))))), Black: 1963#(and (= (_ bv0 8) |thread3Thread1of1ForFork0_~cond~2#1|) (= ~q1_front~0 ~q1_back~0) (or (and (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (bvslt ~i~0 ~N~0)) (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (not (bvslt ~i~0 ~N~0))))), Black: 3172#(and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| (_ bv0 32)) (not (bvslt (_ bv0 32) ~N~0))), Black: 1499#(= ~q1_front~0 ~q1_back~0), Black: 3166#(and (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| (_ bv0 32)) (not (bvslt (_ bv0 32) ~N~0))), Black: 1957#(and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (= ~q1_front~0 ~q1_back~0) (not (bvslt ~i~0 ~N~0))), Black: 2548#(and (not (bvslt ~j~0 ~N~0)) (= |thread4Thread1of1ForFork2_~cond~3#1| (_ bv0 8)) (= ~q2_front~0 ~q2_back~0) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8))), Black: 2550#(and (= |thread4Thread1of1ForFork2_~cond~3#1| (_ bv0 8)) (or (and (bvslt ~j~0 ~N~0) (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|)) (and (not (bvslt ~j~0 ~N~0)) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8)))) (= ~q2_front~0 ~q2_back~0)), Black: 2426#(and (or (and (bvslt ~j~0 ~N~0) (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|)) (and (not (bvslt ~j~0 ~N~0)) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8)))) (= ~q2_front~0 ~q2_back~0)), Black: 2544#(and (not (bvslt ~j~0 ~N~0)) (= ~q2_front~0 ~q2_back~0) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8))), Black: 2095#(= ~q2_front~0 ~q2_back~0)]) [2022-11-16 12:28:10,599 INFO L383 tUnfolder$Statistics]: this new event has 170 ancestors and is cut-off event [2022-11-16 12:28:10,599 INFO L386 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-11-16 12:28:10,599 INFO L386 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-11-16 12:28:10,599 INFO L386 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-11-16 12:28:10,679 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([973] L52-->L58: Formula: (and (not (= (ite (= (let ((.cse0 (select |v_#memory_int_76| v_~q1~0.base_23)) (.cse1 (bvmul (_ bv4 32) v_~q1_back~0_64))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) .cse1 v_~q1~0.offset_23)) (select .cse0 (bvadd (_ bv2 32) .cse1 v_~q1~0.offset_23))) (select .cse0 (bvadd .cse1 v_~q1~0.offset_23 (_ bv1 32)))) (select .cse0 (bvadd .cse1 v_~q1~0.offset_23)))) (let ((.cse2 (select |v_#memory_int_76| v_~f~0.base_36)) (.cse3 (bvmul (_ bv4 32) v_~i~0_34))) (concat (concat (concat (select .cse2 (bvadd (_ bv3 32) .cse3 v_~f~0.offset_36)) (select .cse2 (bvadd (_ bv2 32) .cse3 v_~f~0.offset_36))) (select .cse2 (bvadd .cse3 v_~f~0.offset_36 (_ bv1 32)))) (select .cse2 (bvadd .cse3 v_~f~0.offset_36))))) (_ bv1 32) (_ bv0 32)) (_ bv0 32))) (= v_~q1_back~0_63 (bvadd v_~q1_back~0_64 (_ bv1 32))) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| (_ bv0 32))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (bvslt v_~q1_back~0_64 (_ bv2147483647 32)) (_ bv1 32) (_ bv0 32))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (bvadd v_~i~0_34 (_ bv1 32)) v_~i~0_33) (not (= (ite (and (bvslt v_~q1_back~0_64 v_~n1~0_22) (bvsge v_~q1_back~0_64 (_ bv0 32))) (_ bv1 32) (_ bv0 32)) (_ bv0 32)))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_1|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_1|, ~q1_back~0=v_~q1_back~0_63, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_#t~post3#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][308], [3821#true, 113#L92-1true, 30#L144-4true, 1835#(= (_ bv0 8) |thread3Thread1of1ForFork0_~cond~2#1|), 33#L58true, 251#true, 1970#true, 209#L79true, 211#L118true, 3185#true, Black: 4439#(and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvsge ~N~0 (_ bv0 32)) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (not (bvslt (_ bv0 32) ~N~0))), 2557#true, Black: 4435#(and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvsge ~N~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (not (bvslt (_ bv0 32) ~N~0))), Black: 4441#(and (or (and (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (bvslt (_ bv0 32) ~N~0)) (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (not (bvslt (_ bv0 32) ~N~0)))) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))), Black: 4433#(and (or (and (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (bvslt (_ bv0 32) ~N~0)) (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (not (bvslt (_ bv0 32) ~N~0)))) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))), 4451#true, Black: 3811#(and (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|) (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|)), Black: 874#(= (_ bv0 32) ~total~0), Black: 3807#(and (= ~i~0 (_ bv0 32)) (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|)), Black: 3795#(and (or (and (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (bvslt (_ bv0 32) ~N~0)) (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (not (bvslt (_ bv0 32) ~N~0)))) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))), Black: 3805#(and (= ~i~0 (_ bv0 32)) (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|) (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|)), Black: 3791#(and (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))), Black: 3809#(and (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|) (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (= ~j~0 (_ bv0 32)) (bvslt (_ bv0 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 3801#(and (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvslt (_ bv0 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))), Black: 3797#(and (or (and (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (bvslt (_ bv0 32) ~N~0)) (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (not (bvslt (_ bv0 32) ~N~0)))) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8))) (and (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|) (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|))) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))), Black: 1961#(and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (= (_ bv0 8) |thread3Thread1of1ForFork0_~cond~2#1|) (= ~q1_front~0 ~q1_back~0) (not (bvslt ~i~0 ~N~0))), Black: 3164#(and (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| (_ bv0 32))), Black: 1785#(and (= ~q1_front~0 ~q1_back~0) (or (and (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (bvslt ~i~0 ~N~0)) (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (not (bvslt ~i~0 ~N~0))))), Black: 1963#(and (= (_ bv0 8) |thread3Thread1of1ForFork0_~cond~2#1|) (= ~q1_front~0 ~q1_back~0) (or (and (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (bvslt ~i~0 ~N~0)) (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (not (bvslt ~i~0 ~N~0))))), Black: 3172#(and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| (_ bv0 32)) (not (bvslt (_ bv0 32) ~N~0))), Black: 1499#(= ~q1_front~0 ~q1_back~0), Black: 3166#(and (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| (_ bv0 32)) (not (bvslt (_ bv0 32) ~N~0))), Black: 1957#(and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (= ~q1_front~0 ~q1_back~0) (not (bvslt ~i~0 ~N~0))), Black: 2548#(and (not (bvslt ~j~0 ~N~0)) (= |thread4Thread1of1ForFork2_~cond~3#1| (_ bv0 8)) (= ~q2_front~0 ~q2_back~0) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8))), Black: 2550#(and (= |thread4Thread1of1ForFork2_~cond~3#1| (_ bv0 8)) (or (and (bvslt ~j~0 ~N~0) (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|)) (and (not (bvslt ~j~0 ~N~0)) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8)))) (= ~q2_front~0 ~q2_back~0)), Black: 2426#(and (or (and (bvslt ~j~0 ~N~0) (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|)) (and (not (bvslt ~j~0 ~N~0)) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8)))) (= ~q2_front~0 ~q2_back~0)), Black: 2544#(and (not (bvslt ~j~0 ~N~0)) (= ~q2_front~0 ~q2_back~0) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8))), Black: 2095#(= ~q2_front~0 ~q2_back~0)]) [2022-11-16 12:28:10,679 INFO L383 tUnfolder$Statistics]: this new event has 171 ancestors and is cut-off event [2022-11-16 12:28:10,679 INFO L386 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-11-16 12:28:10,680 INFO L386 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-11-16 12:28:10,680 INFO L386 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-11-16 12:28:10,768 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([973] L52-->L58: Formula: (and (not (= (ite (= (let ((.cse0 (select |v_#memory_int_76| v_~q1~0.base_23)) (.cse1 (bvmul (_ bv4 32) v_~q1_back~0_64))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) .cse1 v_~q1~0.offset_23)) (select .cse0 (bvadd (_ bv2 32) .cse1 v_~q1~0.offset_23))) (select .cse0 (bvadd .cse1 v_~q1~0.offset_23 (_ bv1 32)))) (select .cse0 (bvadd .cse1 v_~q1~0.offset_23)))) (let ((.cse2 (select |v_#memory_int_76| v_~f~0.base_36)) (.cse3 (bvmul (_ bv4 32) v_~i~0_34))) (concat (concat (concat (select .cse2 (bvadd (_ bv3 32) .cse3 v_~f~0.offset_36)) (select .cse2 (bvadd (_ bv2 32) .cse3 v_~f~0.offset_36))) (select .cse2 (bvadd .cse3 v_~f~0.offset_36 (_ bv1 32)))) (select .cse2 (bvadd .cse3 v_~f~0.offset_36))))) (_ bv1 32) (_ bv0 32)) (_ bv0 32))) (= v_~q1_back~0_63 (bvadd v_~q1_back~0_64 (_ bv1 32))) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| (_ bv0 32))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (bvslt v_~q1_back~0_64 (_ bv2147483647 32)) (_ bv1 32) (_ bv0 32))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (bvadd v_~i~0_34 (_ bv1 32)) v_~i~0_33) (not (= (ite (and (bvslt v_~q1_back~0_64 v_~n1~0_22) (bvsge v_~q1_back~0_64 (_ bv0 32))) (_ bv1 32) (_ bv0 32)) (_ bv0 32)))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_1|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_1|, ~q1_back~0=v_~q1_back~0_63, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_#t~post3#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][308], [3821#true, 113#L92-1true, 30#L144-4true, 1835#(= (_ bv0 8) |thread3Thread1of1ForFork0_~cond~2#1|), 33#L58true, 251#true, 1970#true, 211#L118true, 3185#true, 226#L82true, Black: 4439#(and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvsge ~N~0 (_ bv0 32)) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (not (bvslt (_ bv0 32) ~N~0))), Black: 4435#(and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvsge ~N~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (not (bvslt (_ bv0 32) ~N~0))), 2557#true, Black: 4441#(and (or (and (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (bvslt (_ bv0 32) ~N~0)) (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (not (bvslt (_ bv0 32) ~N~0)))) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))), Black: 4433#(and (or (and (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (bvslt (_ bv0 32) ~N~0)) (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (not (bvslt (_ bv0 32) ~N~0)))) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))), 4451#true, Black: 3811#(and (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|) (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|)), Black: 874#(= (_ bv0 32) ~total~0), Black: 3807#(and (= ~i~0 (_ bv0 32)) (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|)), Black: 3795#(and (or (and (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (bvslt (_ bv0 32) ~N~0)) (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (not (bvslt (_ bv0 32) ~N~0)))) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))), Black: 3805#(and (= ~i~0 (_ bv0 32)) (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|) (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|)), Black: 3791#(and (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))), Black: 3809#(and (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|) (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (= ~j~0 (_ bv0 32)) (bvslt (_ bv0 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 3801#(and (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvslt (_ bv0 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))), Black: 3797#(and (or (and (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (bvslt (_ bv0 32) ~N~0)) (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (not (bvslt (_ bv0 32) ~N~0)))) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8))) (and (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|) (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|))) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))), Black: 1961#(and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (= (_ bv0 8) |thread3Thread1of1ForFork0_~cond~2#1|) (= ~q1_front~0 ~q1_back~0) (not (bvslt ~i~0 ~N~0))), Black: 3164#(and (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| (_ bv0 32))), Black: 1785#(and (= ~q1_front~0 ~q1_back~0) (or (and (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (bvslt ~i~0 ~N~0)) (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (not (bvslt ~i~0 ~N~0))))), Black: 1963#(and (= (_ bv0 8) |thread3Thread1of1ForFork0_~cond~2#1|) (= ~q1_front~0 ~q1_back~0) (or (and (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (bvslt ~i~0 ~N~0)) (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (not (bvslt ~i~0 ~N~0))))), Black: 3172#(and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| (_ bv0 32)) (not (bvslt (_ bv0 32) ~N~0))), Black: 1499#(= ~q1_front~0 ~q1_back~0), Black: 3166#(and (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| (_ bv0 32)) (not (bvslt (_ bv0 32) ~N~0))), Black: 1957#(and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (= ~q1_front~0 ~q1_back~0) (not (bvslt ~i~0 ~N~0))), Black: 2548#(and (not (bvslt ~j~0 ~N~0)) (= |thread4Thread1of1ForFork2_~cond~3#1| (_ bv0 8)) (= ~q2_front~0 ~q2_back~0) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8))), Black: 2550#(and (= |thread4Thread1of1ForFork2_~cond~3#1| (_ bv0 8)) (or (and (bvslt ~j~0 ~N~0) (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|)) (and (not (bvslt ~j~0 ~N~0)) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8)))) (= ~q2_front~0 ~q2_back~0)), Black: 2426#(and (or (and (bvslt ~j~0 ~N~0) (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|)) (and (not (bvslt ~j~0 ~N~0)) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8)))) (= ~q2_front~0 ~q2_back~0)), Black: 2544#(and (not (bvslt ~j~0 ~N~0)) (= ~q2_front~0 ~q2_back~0) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8))), Black: 2095#(= ~q2_front~0 ~q2_back~0)]) [2022-11-16 12:28:10,769 INFO L383 tUnfolder$Statistics]: this new event has 172 ancestors and is cut-off event [2022-11-16 12:28:10,769 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-16 12:28:10,769 INFO L386 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-11-16 12:28:10,770 INFO L386 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-11-16 12:28:10,840 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([973] L52-->L58: Formula: (and (not (= (ite (= (let ((.cse0 (select |v_#memory_int_76| v_~q1~0.base_23)) (.cse1 (bvmul (_ bv4 32) v_~q1_back~0_64))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) .cse1 v_~q1~0.offset_23)) (select .cse0 (bvadd (_ bv2 32) .cse1 v_~q1~0.offset_23))) (select .cse0 (bvadd .cse1 v_~q1~0.offset_23 (_ bv1 32)))) (select .cse0 (bvadd .cse1 v_~q1~0.offset_23)))) (let ((.cse2 (select |v_#memory_int_76| v_~f~0.base_36)) (.cse3 (bvmul (_ bv4 32) v_~i~0_34))) (concat (concat (concat (select .cse2 (bvadd (_ bv3 32) .cse3 v_~f~0.offset_36)) (select .cse2 (bvadd (_ bv2 32) .cse3 v_~f~0.offset_36))) (select .cse2 (bvadd .cse3 v_~f~0.offset_36 (_ bv1 32)))) (select .cse2 (bvadd .cse3 v_~f~0.offset_36))))) (_ bv1 32) (_ bv0 32)) (_ bv0 32))) (= v_~q1_back~0_63 (bvadd v_~q1_back~0_64 (_ bv1 32))) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| (_ bv0 32))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (bvslt v_~q1_back~0_64 (_ bv2147483647 32)) (_ bv1 32) (_ bv0 32))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (bvadd v_~i~0_34 (_ bv1 32)) v_~i~0_33) (not (= (ite (and (bvslt v_~q1_back~0_64 v_~n1~0_22) (bvsge v_~q1_back~0_64 (_ bv0 32))) (_ bv1 32) (_ bv0 32)) (_ bv0 32)))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_1|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_1|, ~q1_back~0=v_~q1_back~0_63, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_#t~post3#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][316], [113#L92-1true, 30#L144-4true, 1835#(= (_ bv0 8) |thread3Thread1of1ForFork0_~cond~2#1|), 33#L58true, 251#true, 1970#true, 211#L118true, 3185#true, Black: 4439#(and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvsge ~N~0 (_ bv0 32)) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (not (bvslt (_ bv0 32) ~N~0))), 4279#(= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8)), Black: 4435#(and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvsge ~N~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (not (bvslt (_ bv0 32) ~N~0))), 2557#true, Black: 4441#(and (or (and (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (bvslt (_ bv0 32) ~N~0)) (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (not (bvslt (_ bv0 32) ~N~0)))) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))), Black: 4433#(and (or (and (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (bvslt (_ bv0 32) ~N~0)) (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (not (bvslt (_ bv0 32) ~N~0)))) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))), 4451#true, Black: 3811#(and (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|) (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|)), Black: 874#(= (_ bv0 32) ~total~0), Black: 3807#(and (= ~i~0 (_ bv0 32)) (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|)), Black: 3795#(and (or (and (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (bvslt (_ bv0 32) ~N~0)) (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (not (bvslt (_ bv0 32) ~N~0)))) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))), Black: 3805#(and (= ~i~0 (_ bv0 32)) (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|) (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|)), Black: 3791#(and (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))), Black: 3809#(and (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|) (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (= ~j~0 (_ bv0 32)) (bvslt (_ bv0 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 3801#(and (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvslt (_ bv0 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))), Black: 3797#(and (or (and (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (bvslt (_ bv0 32) ~N~0)) (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (not (bvslt (_ bv0 32) ~N~0)))) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~j~0 (_ bv0 32)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8))) (and (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|) (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|))) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))), Black: 1961#(and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (= (_ bv0 8) |thread3Thread1of1ForFork0_~cond~2#1|) (= ~q1_front~0 ~q1_back~0) (not (bvslt ~i~0 ~N~0))), Black: 3164#(and (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| (_ bv0 32))), Black: 1785#(and (= ~q1_front~0 ~q1_back~0) (or (and (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (bvslt ~i~0 ~N~0)) (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (not (bvslt ~i~0 ~N~0))))), Black: 3172#(and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| (_ bv0 32)) (not (bvslt (_ bv0 32) ~N~0))), Black: 1963#(and (= (_ bv0 8) |thread3Thread1of1ForFork0_~cond~2#1|) (= ~q1_front~0 ~q1_back~0) (or (and (= (_ bv1 8) |thread1Thread1of1ForFork1_~cond~0#1|) (bvslt ~i~0 ~N~0)) (and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (not (bvslt ~i~0 ~N~0))))), Black: 1499#(= ~q1_front~0 ~q1_back~0), Black: 3166#(and (= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| (_ bv0 32)) (not (bvslt (_ bv0 32) ~N~0))), Black: 1957#(and (= |thread1Thread1of1ForFork1_~cond~0#1| (_ bv0 8)) (= ~q1_front~0 ~q1_back~0) (not (bvslt ~i~0 ~N~0))), 112#L71-1true, Black: 2548#(and (not (bvslt ~j~0 ~N~0)) (= |thread4Thread1of1ForFork2_~cond~3#1| (_ bv0 8)) (= ~q2_front~0 ~q2_back~0) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8))), Black: 2550#(and (= |thread4Thread1of1ForFork2_~cond~3#1| (_ bv0 8)) (or (and (bvslt ~j~0 ~N~0) (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|)) (and (not (bvslt ~j~0 ~N~0)) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8)))) (= ~q2_front~0 ~q2_back~0)), Black: 2426#(and (or (and (bvslt ~j~0 ~N~0) (= (_ bv1 8) |thread2Thread1of1ForFork3_~cond~1#1|)) (and (not (bvslt ~j~0 ~N~0)) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8)))) (= ~q2_front~0 ~q2_back~0)), Black: 2544#(and (not (bvslt ~j~0 ~N~0)) (= ~q2_front~0 ~q2_back~0) (= |thread2Thread1of1ForFork3_~cond~1#1| (_ bv0 8))), Black: 2095#(= ~q2_front~0 ~q2_back~0)]) [2022-11-16 12:28:10,841 INFO L383 tUnfolder$Statistics]: this new event has 173 ancestors and is cut-off event [2022-11-16 12:28:10,841 INFO L386 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-11-16 12:28:10,841 INFO L386 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-11-16 12:28:10,841 INFO L386 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-11-16 12:28:11,367 INFO L130 PetriNetUnfolder]: 4216/10748 cut-off events. [2022-11-16 12:28:11,367 INFO L131 PetriNetUnfolder]: For 31384/32153 co-relation queries the response was YES. [2022-11-16 12:28:11,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33496 conditions, 10748 events. 4216/10748 cut-off events. For 31384/32153 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 107451 event pairs, 1935 based on Foata normal form. 521/10798 useless extension candidates. Maximal degree in co-relation 33462. Up to 3804 conditions per place. [2022-11-16 12:28:11,502 INFO L137 encePairwiseOnDemand]: 235/257 looper letters, 153 selfloop transitions, 36 changer transitions 41/376 dead transitions. [2022-11-16 12:28:11,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 376 transitions, 2446 flow [2022-11-16 12:28:11,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 12:28:11,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-16 12:28:11,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3056 transitions. [2022-11-16 12:28:11,512 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5945525291828794 [2022-11-16 12:28:11,513 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3056 transitions. [2022-11-16 12:28:11,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3056 transitions. [2022-11-16 12:28:11,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:28:11,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3056 transitions. [2022-11-16 12:28:11,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 152.8) internal successors, (3056), 20 states have internal predecessors, (3056), 0 states have call successors, (0), 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-16 12:28:11,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 257.0) internal successors, (5397), 21 states have internal predecessors, (5397), 0 states have call successors, (0), 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-16 12:28:11,534 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 257.0) internal successors, (5397), 21 states have internal predecessors, (5397), 0 states have call successors, (0), 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-16 12:28:11,534 INFO L175 Difference]: Start difference. First operand has 305 places, 323 transitions, 1671 flow. Second operand 20 states and 3056 transitions. [2022-11-16 12:28:11,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 376 transitions, 2446 flow [2022-11-16 12:28:11,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 376 transitions, 2348 flow, removed 36 selfloop flow, removed 11 redundant places. [2022-11-16 12:28:11,690 INFO L231 Difference]: Finished difference. Result has 315 places, 315 transitions, 1617 flow [2022-11-16 12:28:11,691 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=1559, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1617, PETRI_PLACES=315, PETRI_TRANSITIONS=315} [2022-11-16 12:28:11,695 INFO L288 CegarLoopForPetriNet]: 231 programPoint places, 84 predicate places. [2022-11-16 12:28:11,695 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 315 transitions, 1617 flow [2022-11-16 12:28:11,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 151.07142857142858) internal successors, (2115), 14 states have internal predecessors, (2115), 0 states have call successors, (0), 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-16 12:28:11,696 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:28:11,697 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:28:11,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:28:11,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:28:11,918 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:28:11,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:28:11,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1479578394, now seen corresponding path program 1 times [2022-11-16 12:28:11,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:28:11,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079458103] [2022-11-16 12:28:11,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:28:11,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:28:11,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:28:11,927 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:28:11,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-16 12:28:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:12,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 12:28:12,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:28:13,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:28:13,561 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:28:13,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:28:13,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079458103] [2022-11-16 12:28:13,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079458103] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:28:13,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:28:13,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-16 12:28:13,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309084668] [2022-11-16 12:28:13,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:28:13,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 12:28:13,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:28:13,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 12:28:13,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:28:13,567 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 257 [2022-11-16 12:28:13,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 315 transitions, 1617 flow. Second operand has 15 states, 15 states have (on average 159.73333333333332) internal successors, (2396), 15 states have internal predecessors, (2396), 0 states have call successors, (0), 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-16 12:28:13,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:28:13,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 257 [2022-11-16 12:28:13,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:28:18,248 INFO L130 PetriNetUnfolder]: 6024/12806 cut-off events. [2022-11-16 12:28:18,248 INFO L131 PetriNetUnfolder]: For 38995/39997 co-relation queries the response was YES. [2022-11-16 12:28:18,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43296 conditions, 12806 events. 6024/12806 cut-off events. For 38995/39997 co-relation queries the response was YES. Maximal size of possible extension queue 806. Compared 119676 event pairs, 1751 based on Foata normal form. 873/13270 useless extension candidates. Maximal degree in co-relation 43257. Up to 3695 conditions per place. [2022-11-16 12:28:18,432 INFO L137 encePairwiseOnDemand]: 232/257 looper letters, 242 selfloop transitions, 89 changer transitions 11/490 dead transitions. [2022-11-16 12:28:18,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 490 transitions, 3405 flow [2022-11-16 12:28:18,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 12:28:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-16 12:28:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3948 transitions. [2022-11-16 12:28:18,441 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6400778210116731 [2022-11-16 12:28:18,441 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3948 transitions. [2022-11-16 12:28:18,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3948 transitions. [2022-11-16 12:28:18,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:28:18,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3948 transitions. [2022-11-16 12:28:18,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 164.5) internal successors, (3948), 24 states have internal predecessors, (3948), 0 states have call successors, (0), 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-16 12:28:18,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 257.0) internal successors, (6425), 25 states have internal predecessors, (6425), 0 states have call successors, (0), 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-16 12:28:18,459 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 257.0) internal successors, (6425), 25 states have internal predecessors, (6425), 0 states have call successors, (0), 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-16 12:28:18,459 INFO L175 Difference]: Start difference. First operand has 315 places, 315 transitions, 1617 flow. Second operand 24 states and 3948 transitions. [2022-11-16 12:28:18,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 490 transitions, 3405 flow [2022-11-16 12:28:18,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 490 transitions, 3280 flow, removed 33 selfloop flow, removed 18 redundant places. [2022-11-16 12:28:18,605 INFO L231 Difference]: Finished difference. Result has 322 places, 344 transitions, 2108 flow [2022-11-16 12:28:18,606 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=1510, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2108, PETRI_PLACES=322, PETRI_TRANSITIONS=344} [2022-11-16 12:28:18,606 INFO L288 CegarLoopForPetriNet]: 231 programPoint places, 91 predicate places. [2022-11-16 12:28:18,607 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 344 transitions, 2108 flow [2022-11-16 12:28:18,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 159.73333333333332) internal successors, (2396), 15 states have internal predecessors, (2396), 0 states have call successors, (0), 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-16 12:28:18,608 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:28:18,608 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:28:18,623 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-11-16 12:28:18,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:28:18,823 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:28:18,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:28:18,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1847294606, now seen corresponding path program 1 times [2022-11-16 12:28:18,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:28:18,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77912792] [2022-11-16 12:28:18,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:28:18,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:28:18,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:28:18,826 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:28:18,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-16 12:28:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:19,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 12:28:19,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:28:20,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:28:20,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:28:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:28:24,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:28:24,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [77912792] [2022-11-16 12:28:24,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [77912792] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:28:24,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:28:24,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2022-11-16 12:28:24,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348433680] [2022-11-16 12:28:24,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:28:24,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-16 12:28:24,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:28:24,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-16 12:28:24,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2022-11-16 12:28:24,934 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 257 [2022-11-16 12:28:24,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 344 transitions, 2108 flow. Second operand has 33 states, 33 states have (on average 159.0909090909091) internal successors, (5250), 33 states have internal predecessors, (5250), 0 states have call successors, (0), 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-16 12:28:24,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:28:24,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 257 [2022-11-16 12:28:24,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:28:37,570 INFO L130 PetriNetUnfolder]: 14640/26441 cut-off events. [2022-11-16 12:28:37,570 INFO L131 PetriNetUnfolder]: For 105061/106728 co-relation queries the response was YES. [2022-11-16 12:28:37,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102159 conditions, 26441 events. 14640/26441 cut-off events. For 105061/106728 co-relation queries the response was YES. Maximal size of possible extension queue 1501. Compared 242174 event pairs, 443 based on Foata normal form. 1575/27741 useless extension candidates. Maximal degree in co-relation 102117. Up to 3862 conditions per place. [2022-11-16 12:28:37,926 INFO L137 encePairwiseOnDemand]: 229/257 looper letters, 654 selfloop transitions, 312 changer transitions 1/1115 dead transitions. [2022-11-16 12:28:37,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 1115 transitions, 9137 flow [2022-11-16 12:28:37,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-11-16 12:28:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2022-11-16 12:28:37,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 11088 transitions. [2022-11-16 12:28:37,949 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6439398339044079 [2022-11-16 12:28:37,949 INFO L72 ComplementDD]: Start complementDD. Operand 67 states and 11088 transitions. [2022-11-16 12:28:37,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 11088 transitions. [2022-11-16 12:28:37,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:28:37,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 67 states and 11088 transitions. [2022-11-16 12:28:37,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 68 states, 67 states have (on average 165.49253731343285) internal successors, (11088), 67 states have internal predecessors, (11088), 0 states have call successors, (0), 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-16 12:28:38,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 68 states, 68 states have (on average 257.0) internal successors, (17476), 68 states have internal predecessors, (17476), 0 states have call successors, (0), 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-16 12:28:38,005 INFO L81 ComplementDD]: Finished complementDD. Result has 68 states, 68 states have (on average 257.0) internal successors, (17476), 68 states have internal predecessors, (17476), 0 states have call successors, (0), 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-16 12:28:38,006 INFO L175 Difference]: Start difference. First operand has 322 places, 344 transitions, 2108 flow. Second operand 67 states and 11088 transitions. [2022-11-16 12:28:38,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 1115 transitions, 9137 flow [2022-11-16 12:28:38,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 1115 transitions, 9067 flow, removed 21 selfloop flow, removed 12 redundant places. [2022-11-16 12:28:38,831 INFO L231 Difference]: Finished difference. Result has 395 places, 586 transitions, 5412 flow [2022-11-16 12:28:38,832 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=2056, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=5412, PETRI_PLACES=395, PETRI_TRANSITIONS=586} [2022-11-16 12:28:38,832 INFO L288 CegarLoopForPetriNet]: 231 programPoint places, 164 predicate places. [2022-11-16 12:28:38,833 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 586 transitions, 5412 flow [2022-11-16 12:28:38,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 159.0909090909091) internal successors, (5250), 33 states have internal predecessors, (5250), 0 states have call successors, (0), 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-16 12:28:38,834 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:28:38,835 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:28:38,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-16 12:28:39,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:28:39,048 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:28:39,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:28:39,049 INFO L85 PathProgramCache]: Analyzing trace with hash -761741208, now seen corresponding path program 2 times [2022-11-16 12:28:39,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:28:39,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693162575] [2022-11-16 12:28:39,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:28:39,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:28:39,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:28:39,052 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:28:39,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-16 12:28:39,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:28:39,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:28:39,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 12:28:39,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:28:40,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:28:40,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:28:40,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:28:40,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693162575] [2022-11-16 12:28:40,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693162575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:28:40,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:28:40,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-16 12:28:40,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532916452] [2022-11-16 12:28:40,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:28:40,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 12:28:40,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:28:40,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 12:28:40,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:28:40,665 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 257 [2022-11-16 12:28:40,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 586 transitions, 5412 flow. Second operand has 15 states, 15 states have (on average 159.73333333333332) internal successors, (2396), 15 states have internal predecessors, (2396), 0 states have call successors, (0), 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-16 12:28:40,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:28:40,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 257 [2022-11-16 12:28:40,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:28:51,875 INFO L130 PetriNetUnfolder]: 13928/31659 cut-off events. [2022-11-16 12:28:51,876 INFO L131 PetriNetUnfolder]: For 236718/239141 co-relation queries the response was YES. [2022-11-16 12:28:52,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132221 conditions, 31659 events. 13928/31659 cut-off events. For 236718/239141 co-relation queries the response was YES. Maximal size of possible extension queue 1977. Compared 356864 event pairs, 4135 based on Foata normal form. 862/31827 useless extension candidates. Maximal degree in co-relation 132161. Up to 11191 conditions per place. [2022-11-16 12:28:52,579 INFO L137 encePairwiseOnDemand]: 232/257 looper letters, 445 selfloop transitions, 168 changer transitions 17/778 dead transitions. [2022-11-16 12:28:52,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 778 transitions, 8016 flow [2022-11-16 12:28:52,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 12:28:52,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-11-16 12:28:52,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 4755 transitions. [2022-11-16 12:28:52,586 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6379981215617871 [2022-11-16 12:28:52,586 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 4755 transitions. [2022-11-16 12:28:52,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 4755 transitions. [2022-11-16 12:28:52,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:28:52,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 4755 transitions. [2022-11-16 12:28:52,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 163.9655172413793) internal successors, (4755), 29 states have internal predecessors, (4755), 0 states have call successors, (0), 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-16 12:28:52,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 257.0) internal successors, (7710), 30 states have internal predecessors, (7710), 0 states have call successors, (0), 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-16 12:28:52,603 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 257.0) internal successors, (7710), 30 states have internal predecessors, (7710), 0 states have call successors, (0), 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-16 12:28:52,603 INFO L175 Difference]: Start difference. First operand has 395 places, 586 transitions, 5412 flow. Second operand 29 states and 4755 transitions. [2022-11-16 12:28:52,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 778 transitions, 8016 flow [2022-11-16 12:28:54,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 778 transitions, 7100 flow, removed 394 selfloop flow, removed 14 redundant places. [2022-11-16 12:28:54,464 INFO L231 Difference]: Finished difference. Result has 413 places, 587 transitions, 5003 flow [2022-11-16 12:28:54,464 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=4532, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=5003, PETRI_PLACES=413, PETRI_TRANSITIONS=587} [2022-11-16 12:28:54,465 INFO L288 CegarLoopForPetriNet]: 231 programPoint places, 182 predicate places. [2022-11-16 12:28:54,465 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 587 transitions, 5003 flow [2022-11-16 12:28:54,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 159.73333333333332) internal successors, (2396), 15 states have internal predecessors, (2396), 0 states have call successors, (0), 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-16 12:28:54,465 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:28:54,466 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:28:54,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-16 12:28:54,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:28:54,666 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:28:54,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:28:54,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1348430914, now seen corresponding path program 2 times [2022-11-16 12:28:54,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:28:54,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041538686] [2022-11-16 12:28:54,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:28:54,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:28:54,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:28:54,668 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:28:54,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-16 12:28:54,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:28:54,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:28:54,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 12:28:54,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:28:56,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:28:56,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:28:57,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:28:57,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:28:57,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041538686] [2022-11-16 12:28:57,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041538686] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 12:28:57,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:28:57,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 27 [2022-11-16 12:28:57,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332918710] [2022-11-16 12:28:57,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:28:57,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:28:57,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:28:57,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:28:57,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2022-11-16 12:28:57,819 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 257 [2022-11-16 12:28:57,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 587 transitions, 5003 flow. Second operand has 14 states, 14 states have (on average 160.07142857142858) internal successors, (2241), 14 states have internal predecessors, (2241), 0 states have call successors, (0), 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-16 12:28:57,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:28:57,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 257 [2022-11-16 12:28:57,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:29:07,361 INFO L130 PetriNetUnfolder]: 15353/28859 cut-off events. [2022-11-16 12:29:07,361 INFO L131 PetriNetUnfolder]: For 198239/199688 co-relation queries the response was YES. [2022-11-16 12:29:07,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121907 conditions, 28859 events. 15353/28859 cut-off events. For 198239/199688 co-relation queries the response was YES. Maximal size of possible extension queue 1617. Compared 277534 event pairs, 1029 based on Foata normal form. 1180/29742 useless extension candidates. Maximal degree in co-relation 121845. Up to 8492 conditions per place. [2022-11-16 12:29:07,878 INFO L137 encePairwiseOnDemand]: 239/257 looper letters, 394 selfloop transitions, 204 changer transitions 4/750 dead transitions. [2022-11-16 12:29:07,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 750 transitions, 7345 flow [2022-11-16 12:29:07,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:29:07,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-16 12:29:07,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2825 transitions. [2022-11-16 12:29:07,884 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6466010528725109 [2022-11-16 12:29:07,884 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2825 transitions. [2022-11-16 12:29:07,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2825 transitions. [2022-11-16 12:29:07,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:29:07,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2825 transitions. [2022-11-16 12:29:07,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 166.1764705882353) internal successors, (2825), 17 states have internal predecessors, (2825), 0 states have call successors, (0), 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-16 12:29:07,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 257.0) internal successors, (4626), 18 states have internal predecessors, (4626), 0 states have call successors, (0), 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-16 12:29:07,894 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 257.0) internal successors, (4626), 18 states have internal predecessors, (4626), 0 states have call successors, (0), 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-16 12:29:07,894 INFO L175 Difference]: Start difference. First operand has 413 places, 587 transitions, 5003 flow. Second operand 17 states and 2825 transitions. [2022-11-16 12:29:07,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 750 transitions, 7345 flow [2022-11-16 12:29:09,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 750 transitions, 7014 flow, removed 4 selfloop flow, removed 25 redundant places. [2022-11-16 12:29:09,097 INFO L231 Difference]: Finished difference. Result has 411 places, 626 transitions, 5807 flow [2022-11-16 12:29:09,098 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=4688, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=5807, PETRI_PLACES=411, PETRI_TRANSITIONS=626} [2022-11-16 12:29:09,099 INFO L288 CegarLoopForPetriNet]: 231 programPoint places, 180 predicate places. [2022-11-16 12:29:09,099 INFO L495 AbstractCegarLoop]: Abstraction has has 411 places, 626 transitions, 5807 flow [2022-11-16 12:29:09,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 160.07142857142858) internal successors, (2241), 14 states have internal predecessors, (2241), 0 states have call successors, (0), 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-16 12:29:09,099 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:29:09,100 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:09,109 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-11-16 12:29:09,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:09,301 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:29:09,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:09,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1086376300, now seen corresponding path program 3 times [2022-11-16 12:29:09,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:29:09,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841270517] [2022-11-16 12:29:09,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:29:09,303 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:09,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:29:09,305 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:29:09,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63b8e1c2-c5be-4ba3-92bb-cd65a6fa97fd/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-16 12:29:09,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 12:29:09,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:29:09,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-16 12:29:09,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:29:11,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:29:11,213 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:29:11,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:29:11,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841270517] [2022-11-16 12:29:11,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841270517] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:29:11,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:29:11,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-16 12:29:11,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524357911] [2022-11-16 12:29:11,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:29:11,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 12:29:11,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:29:11,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 12:29:11,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:29:11,218 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 257 [2022-11-16 12:29:11,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 626 transitions, 5807 flow. Second operand has 16 states, 16 states have (on average 155.6875) internal successors, (2491), 16 states have internal predecessors, (2491), 0 states have call successors, (0), 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-16 12:29:11,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:29:11,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 257 [2022-11-16 12:29:11,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand