./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b 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_979d3821-b594-4337-a368-58a1a20a1290/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_979d3821-b594-4337-a368-58a1a20a1290/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_979d3821-b594-4337-a368-58a1a20a1290/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_979d3821-b594-4337-a368-58a1a20a1290/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_979d3821-b594-4337-a368-58a1a20a1290/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_979d3821-b594-4337-a368-58a1a20a1290/bin/uautomizer-TMbwUNV5ro --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 3a8f8518887bc2e5e0d6d71e32a92b54f9a899d1e11c58bdb579bc81d5f31bb3 --- 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-8393723 [2022-11-18 18:33:07,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 18:33:07,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 18:33:07,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 18:33:07,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 18:33:07,464 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 18:33:07,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 18:33:07,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 18:33:07,471 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 18:33:07,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 18:33:07,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 18:33:07,479 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 18:33:07,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 18:33:07,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 18:33:07,486 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 18:33:07,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 18:33:07,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 18:33:07,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 18:33:07,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 18:33:07,500 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 18:33:07,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 18:33:07,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 18:33:07,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 18:33:07,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 18:33:07,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 18:33:07,510 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 18:33:07,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 18:33:07,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 18:33:07,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 18:33:07,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 18:33:07,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 18:33:07,514 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 18:33:07,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 18:33:07,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 18:33:07,516 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 18:33:07,517 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 18:33:07,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 18:33:07,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 18:33:07,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 18:33:07,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 18:33:07,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 18:33:07,528 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_979d3821-b594-4337-a368-58a1a20a1290/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 18:33:07,564 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 18:33:07,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 18:33:07,570 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 18:33:07,570 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 18:33:07,572 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 18:33:07,572 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 18:33:07,573 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 18:33:07,573 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 18:33:07,573 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 18:33:07,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 18:33:07,575 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 18:33:07,575 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 18:33:07,576 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 18:33:07,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 18:33:07,576 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 18:33:07,576 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 18:33:07,576 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 18:33:07,577 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 18:33:07,577 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 18:33:07,577 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 18:33:07,577 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 18:33:07,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 18:33:07,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 18:33:07,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 18:33:07,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:33:07,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 18:33:07,581 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 18:33:07,581 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 18:33:07,581 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 18:33:07,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 18:33:07,581 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 18:33:07,582 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 18:33:07,582 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 18:33:07,583 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_979d3821-b594-4337-a368-58a1a20a1290/bin/uautomizer-TMbwUNV5ro/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_979d3821-b594-4337-a368-58a1a20a1290/bin/uautomizer-TMbwUNV5ro 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 -> 3a8f8518887bc2e5e0d6d71e32a92b54f9a899d1e11c58bdb579bc81d5f31bb3 [2022-11-18 18:33:07,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 18:33:07,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 18:33:07,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 18:33:07,906 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 18:33:07,907 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 18:33:07,908 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_979d3821-b594-4337-a368-58a1a20a1290/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-11-18 18:33:08,001 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_979d3821-b594-4337-a368-58a1a20a1290/bin/uautomizer-TMbwUNV5ro/data/c5ab33cb2/721fb16268204cf69cbe79fa9cf2b43b/FLAGab5831061 [2022-11-18 18:33:08,568 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 18:33:08,575 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_979d3821-b594-4337-a368-58a1a20a1290/sv-benchmarks/c/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-11-18 18:33:08,595 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_979d3821-b594-4337-a368-58a1a20a1290/bin/uautomizer-TMbwUNV5ro/data/c5ab33cb2/721fb16268204cf69cbe79fa9cf2b43b/FLAGab5831061 [2022-11-18 18:33:08,831 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_979d3821-b594-4337-a368-58a1a20a1290/bin/uautomizer-TMbwUNV5ro/data/c5ab33cb2/721fb16268204cf69cbe79fa9cf2b43b [2022-11-18 18:33:08,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 18:33:08,835 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 18:33:08,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 18:33:08,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 18:33:08,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 18:33:08,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:33:08" (1/1) ... [2022-11-18 18:33:08,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@727d8339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:08, skipping insertion in model container [2022-11-18 18:33:08,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:33:08" (1/1) ... [2022-11-18 18:33:08,850 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 18:33:08,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 18:33:09,197 WARN L234 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_979d3821-b594-4337-a368-58a1a20a1290/sv-benchmarks/c/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2022-11-18 18:33:09,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:33:09,490 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 18:33:09,502 WARN L234 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_979d3821-b594-4337-a368-58a1a20a1290/sv-benchmarks/c/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2022-11-18 18:33:09,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:33:09,624 INFO L208 MainTranslator]: Completed translation [2022-11-18 18:33:09,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:09 WrapperNode [2022-11-18 18:33:09,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 18:33:09,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 18:33:09,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 18:33:09,626 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 18:33:09,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:09" (1/1) ... [2022-11-18 18:33:09,673 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:09" (1/1) ... [2022-11-18 18:33:09,707 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115 [2022-11-18 18:33:09,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 18:33:09,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 18:33:09,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 18:33:09,711 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 18:33:09,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:09" (1/1) ... [2022-11-18 18:33:09,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:09" (1/1) ... [2022-11-18 18:33:09,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:09" (1/1) ... [2022-11-18 18:33:09,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:09" (1/1) ... [2022-11-18 18:33:09,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:09" (1/1) ... [2022-11-18 18:33:09,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:09" (1/1) ... [2022-11-18 18:33:09,768 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:09" (1/1) ... [2022-11-18 18:33:09,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:09" (1/1) ... [2022-11-18 18:33:09,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 18:33:09,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 18:33:09,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 18:33:09,787 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 18:33:09,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:09" (1/1) ... [2022-11-18 18:33:09,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:33:09,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_979d3821-b594-4337-a368-58a1a20a1290/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:33:09,824 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_979d3821-b594-4337-a368-58a1a20a1290/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 18:33:09,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_979d3821-b594-4337-a368-58a1a20a1290/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 18:33:09,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 18:33:09,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 18:33:09,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 18:33:09,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 18:33:09,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 18:33:09,875 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 18:33:09,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 18:33:09,875 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 18:33:09,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 18:33:09,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 18:33:09,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 18:33:09,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 18:33:09,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 18:33:09,879 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 18:33:10,124 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 18:33:10,126 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 18:33:10,497 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 18:33:10,761 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 18:33:10,761 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 18:33:10,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:33:10 BoogieIcfgContainer [2022-11-18 18:33:10,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 18:33:10,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 18:33:10,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 18:33:10,786 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 18:33:10,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:33:08" (1/3) ... [2022-11-18 18:33:10,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24de0e1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:33:10, skipping insertion in model container [2022-11-18 18:33:10,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:09" (2/3) ... [2022-11-18 18:33:10,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24de0e1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:33:10, skipping insertion in model container [2022-11-18 18:33:10,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:33:10" (3/3) ... [2022-11-18 18:33:10,789 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-11-18 18:33:10,807 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 18:33:10,847 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 18:33:10,848 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 18:33:10,848 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 18:33:10,967 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 18:33:11,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 99 transitions, 208 flow [2022-11-18 18:33:11,061 INFO L130 PetriNetUnfolder]: 2/97 cut-off events. [2022-11-18 18:33:11,061 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 18:33:11,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2022-11-18 18:33:11,067 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 99 transitions, 208 flow [2022-11-18 18:33:11,072 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 97 transitions, 200 flow [2022-11-18 18:33:11,083 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 18:33:11,091 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;@4fa4cd30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 18:33:11,091 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-18 18:33:11,104 INFO L130 PetriNetUnfolder]: 0/44 cut-off events. [2022-11-18 18:33:11,104 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 18:33:11,105 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:33:11,105 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] [2022-11-18 18:33:11,106 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 18:33:11,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:33:11,113 INFO L85 PathProgramCache]: Analyzing trace with hash -980871808, now seen corresponding path program 1 times [2022-11-18 18:33:11,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:33:11,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499553943] [2022-11-18 18:33:11,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:33:11,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:33:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:33:11,813 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-18 18:33:11,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:33:11,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499553943] [2022-11-18 18:33:11,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499553943] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:33:11,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:33:11,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:33:11,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639387033] [2022-11-18 18:33:11,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:33:11,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:33:11,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:33:11,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:33:11,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:33:11,869 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 99 [2022-11-18 18:33:11,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 97 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:11,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:33:11,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 99 [2022-11-18 18:33:11,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:33:11,985 INFO L130 PetriNetUnfolder]: 18/180 cut-off events. [2022-11-18 18:33:11,985 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-18 18:33:11,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 180 events. 18/180 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 515 event pairs, 12 based on Foata normal form. 6/173 useless extension candidates. Maximal degree in co-relation 182. Up to 31 conditions per place. [2022-11-18 18:33:11,989 INFO L137 encePairwiseOnDemand]: 94/99 looper letters, 10 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2022-11-18 18:33:11,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 97 transitions, 227 flow [2022-11-18 18:33:11,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:33:11,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 18:33:12,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2022-11-18 18:33:12,004 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.936026936026936 [2022-11-18 18:33:12,005 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 278 transitions. [2022-11-18 18:33:12,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 278 transitions. [2022-11-18 18:33:12,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:33:12,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 278 transitions. [2022-11-18 18:33:12,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:12,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:12,020 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:12,022 INFO L175 Difference]: Start difference. First operand has 102 places, 97 transitions, 200 flow. Second operand 3 states and 278 transitions. [2022-11-18 18:33:12,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 97 transitions, 227 flow [2022-11-18 18:33:12,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 97 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 18:33:12,029 INFO L231 Difference]: Finished difference. Result has 100 places, 93 transitions, 194 flow [2022-11-18 18:33:12,032 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=100, PETRI_TRANSITIONS=93} [2022-11-18 18:33:12,036 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -2 predicate places. [2022-11-18 18:33:12,036 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 93 transitions, 194 flow [2022-11-18 18:33:12,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:12,037 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:33:12,037 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] [2022-11-18 18:33:12,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 18:33:12,038 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 18:33:12,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:33:12,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1231092544, now seen corresponding path program 1 times [2022-11-18 18:33:12,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:33:12,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156868199] [2022-11-18 18:33:12,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:33:12,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:33:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:33:12,537 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-18 18:33:12,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:33:12,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156868199] [2022-11-18 18:33:12,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156868199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:33:12,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:33:12,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 18:33:12,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901319720] [2022-11-18 18:33:12,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:33:12,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:33:12,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:33:12,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:33:12,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:33:12,549 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 99 [2022-11-18 18:33:12,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 93 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 80.66666666666667) internal successors, (484), 6 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:12,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:33:12,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 99 [2022-11-18 18:33:12,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:33:13,137 INFO L130 PetriNetUnfolder]: 173/624 cut-off events. [2022-11-18 18:33:13,137 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-11-18 18:33:13,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 999 conditions, 624 events. 173/624 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3465 event pairs, 46 based on Foata normal form. 0/602 useless extension candidates. Maximal degree in co-relation 948. Up to 166 conditions per place. [2022-11-18 18:33:13,147 INFO L137 encePairwiseOnDemand]: 93/99 looper letters, 16 selfloop transitions, 2 changer transitions 40/126 dead transitions. [2022-11-18 18:33:13,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 126 transitions, 372 flow [2022-11-18 18:33:13,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 18:33:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 18:33:13,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 762 transitions. [2022-11-18 18:33:13,157 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8552188552188552 [2022-11-18 18:33:13,157 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 762 transitions. [2022-11-18 18:33:13,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 762 transitions. [2022-11-18 18:33:13,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:33:13,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 762 transitions. [2022-11-18 18:33:13,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 84.66666666666667) internal successors, (762), 9 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:13,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 99.0) internal successors, (990), 10 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:13,170 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 99.0) internal successors, (990), 10 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:13,171 INFO L175 Difference]: Start difference. First operand has 100 places, 93 transitions, 194 flow. Second operand 9 states and 762 transitions. [2022-11-18 18:33:13,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 126 transitions, 372 flow [2022-11-18 18:33:13,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 126 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 18:33:13,177 INFO L231 Difference]: Finished difference. Result has 113 places, 83 transitions, 190 flow [2022-11-18 18:33:13,177 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=190, PETRI_PLACES=113, PETRI_TRANSITIONS=83} [2022-11-18 18:33:13,178 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, 11 predicate places. [2022-11-18 18:33:13,178 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 83 transitions, 190 flow [2022-11-18 18:33:13,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.66666666666667) internal successors, (484), 6 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:13,179 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:33:13,180 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] [2022-11-18 18:33:13,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 18:33:13,180 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 18:33:13,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:33:13,182 INFO L85 PathProgramCache]: Analyzing trace with hash 316905730, now seen corresponding path program 1 times [2022-11-18 18:33:13,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:33:13,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919843377] [2022-11-18 18:33:13,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:33:13,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:33:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:33:13,536 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-18 18:33:13,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:33:13,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919843377] [2022-11-18 18:33:13,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919843377] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:33:13,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:33:13,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 18:33:13,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970330338] [2022-11-18 18:33:13,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:33:13,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:33:13,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:33:13,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:33:13,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:33:13,547 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 99 [2022-11-18 18:33:13,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 83 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 79.66666666666667) internal successors, (478), 6 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:13,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:33:13,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 99 [2022-11-18 18:33:13,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:33:13,936 INFO L130 PetriNetUnfolder]: 167/495 cut-off events. [2022-11-18 18:33:13,936 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-11-18 18:33:13,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 495 events. 167/495 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2478 event pairs, 18 based on Foata normal form. 0/482 useless extension candidates. Maximal degree in co-relation 849. Up to 79 conditions per place. [2022-11-18 18:33:13,940 INFO L137 encePairwiseOnDemand]: 90/99 looper letters, 24 selfloop transitions, 5 changer transitions 40/135 dead transitions. [2022-11-18 18:33:13,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 135 transitions, 434 flow [2022-11-18 18:33:13,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 18:33:13,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 18:33:13,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 851 transitions. [2022-11-18 18:33:13,944 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8595959595959596 [2022-11-18 18:33:13,944 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 851 transitions. [2022-11-18 18:33:13,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 851 transitions. [2022-11-18 18:33:13,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:33:13,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 851 transitions. [2022-11-18 18:33:13,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 85.1) internal successors, (851), 10 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:13,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 99.0) internal successors, (1089), 11 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:13,953 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 99.0) internal successors, (1089), 11 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:13,953 INFO L175 Difference]: Start difference. First operand has 113 places, 83 transitions, 190 flow. Second operand 10 states and 851 transitions. [2022-11-18 18:33:13,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 135 transitions, 434 flow [2022-11-18 18:33:13,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 135 transitions, 418 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-11-18 18:33:13,964 INFO L231 Difference]: Finished difference. Result has 104 places, 84 transitions, 216 flow [2022-11-18 18:33:13,964 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=216, PETRI_PLACES=104, PETRI_TRANSITIONS=84} [2022-11-18 18:33:13,967 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, 2 predicate places. [2022-11-18 18:33:13,967 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 84 transitions, 216 flow [2022-11-18 18:33:13,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.66666666666667) internal successors, (478), 6 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:13,969 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:33:13,969 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] [2022-11-18 18:33:13,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 18:33:13,970 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 18:33:13,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:33:13,972 INFO L85 PathProgramCache]: Analyzing trace with hash 297401016, now seen corresponding path program 1 times [2022-11-18 18:33:13,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:33:13,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250703228] [2022-11-18 18:33:13,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:33:13,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:33:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:33:14,348 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-18 18:33:14,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:33:14,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250703228] [2022-11-18 18:33:14,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250703228] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:33:14,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:33:14,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:33:14,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478468490] [2022-11-18 18:33:14,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:33:14,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:33:14,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:33:14,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:33:14,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:33:14,357 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 99 [2022-11-18 18:33:14,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 84 transitions, 216 flow. Second operand has 7 states, 7 states have (on average 79.85714285714286) internal successors, (559), 7 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:14,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:33:14,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 99 [2022-11-18 18:33:14,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:33:14,623 INFO L130 PetriNetUnfolder]: 35/185 cut-off events. [2022-11-18 18:33:14,624 INFO L131 PetriNetUnfolder]: For 94/94 co-relation queries the response was YES. [2022-11-18 18:33:14,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 185 events. 35/185 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 520 event pairs, 6 based on Foata normal form. 7/188 useless extension candidates. Maximal degree in co-relation 367. Up to 26 conditions per place. [2022-11-18 18:33:14,625 INFO L137 encePairwiseOnDemand]: 91/99 looper letters, 16 selfloop transitions, 7 changer transitions 19/108 dead transitions. [2022-11-18 18:33:14,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 108 transitions, 393 flow [2022-11-18 18:33:14,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 18:33:14,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 18:33:14,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 824 transitions. [2022-11-18 18:33:14,628 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8323232323232324 [2022-11-18 18:33:14,628 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 824 transitions. [2022-11-18 18:33:14,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 824 transitions. [2022-11-18 18:33:14,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:33:14,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 824 transitions. [2022-11-18 18:33:14,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 82.4) internal successors, (824), 10 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:14,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 99.0) internal successors, (1089), 11 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:14,637 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 99.0) internal successors, (1089), 11 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:14,637 INFO L175 Difference]: Start difference. First operand has 104 places, 84 transitions, 216 flow. Second operand 10 states and 824 transitions. [2022-11-18 18:33:14,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 108 transitions, 393 flow [2022-11-18 18:33:14,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 108 transitions, 354 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-11-18 18:33:14,647 INFO L231 Difference]: Finished difference. Result has 107 places, 84 transitions, 228 flow [2022-11-18 18:33:14,648 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=228, PETRI_PLACES=107, PETRI_TRANSITIONS=84} [2022-11-18 18:33:14,650 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, 5 predicate places. [2022-11-18 18:33:14,650 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 84 transitions, 228 flow [2022-11-18 18:33:14,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.85714285714286) internal successors, (559), 7 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:14,655 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:33:14,655 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] [2022-11-18 18:33:14,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 18:33:14,656 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 18:33:14,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:33:14,656 INFO L85 PathProgramCache]: Analyzing trace with hash -2102019169, now seen corresponding path program 1 times [2022-11-18 18:33:14,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:33:14,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242092880] [2022-11-18 18:33:14,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:33:14,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:33:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:33:15,027 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-18 18:33:15,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:33:15,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242092880] [2022-11-18 18:33:15,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242092880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:33:15,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:33:15,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:33:15,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155977739] [2022-11-18 18:33:15,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:33:15,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:33:15,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:33:15,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:33:15,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:33:15,032 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 99 [2022-11-18 18:33:15,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 84 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 76.85714285714286) internal successors, (538), 7 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:15,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:33:15,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 99 [2022-11-18 18:33:15,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:33:15,267 INFO L130 PetriNetUnfolder]: 19/170 cut-off events. [2022-11-18 18:33:15,267 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-11-18 18:33:15,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 170 events. 19/170 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 383 event pairs, 3 based on Foata normal form. 1/168 useless extension candidates. Maximal degree in co-relation 281. Up to 34 conditions per place. [2022-11-18 18:33:15,269 INFO L137 encePairwiseOnDemand]: 89/99 looper letters, 20 selfloop transitions, 6 changer transitions 6/96 dead transitions. [2022-11-18 18:33:15,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 96 transitions, 316 flow [2022-11-18 18:33:15,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 18:33:15,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 18:33:15,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 625 transitions. [2022-11-18 18:33:15,271 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7891414141414141 [2022-11-18 18:33:15,272 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 625 transitions. [2022-11-18 18:33:15,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 625 transitions. [2022-11-18 18:33:15,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:33:15,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 625 transitions. [2022-11-18 18:33:15,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 78.125) internal successors, (625), 8 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:15,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 99.0) internal successors, (891), 9 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:15,276 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 99.0) internal successors, (891), 9 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:15,276 INFO L175 Difference]: Start difference. First operand has 107 places, 84 transitions, 228 flow. Second operand 8 states and 625 transitions. [2022-11-18 18:33:15,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 96 transitions, 316 flow [2022-11-18 18:33:15,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 96 transitions, 270 flow, removed 13 selfloop flow, removed 13 redundant places. [2022-11-18 18:33:15,280 INFO L231 Difference]: Finished difference. Result has 102 places, 87 transitions, 221 flow [2022-11-18 18:33:15,280 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=221, PETRI_PLACES=102, PETRI_TRANSITIONS=87} [2022-11-18 18:33:15,281 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, 0 predicate places. [2022-11-18 18:33:15,281 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 87 transitions, 221 flow [2022-11-18 18:33:15,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.85714285714286) internal successors, (538), 7 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:15,282 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:33:15,282 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] [2022-11-18 18:33:15,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 18:33:15,283 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 18:33:15,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:33:15,283 INFO L85 PathProgramCache]: Analyzing trace with hash 388382693, now seen corresponding path program 2 times [2022-11-18 18:33:15,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:33:15,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490345922] [2022-11-18 18:33:15,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:33:15,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:33:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:33:16,216 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-18 18:33:16,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:33:16,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490345922] [2022-11-18 18:33:16,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490345922] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:33:16,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:33:16,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 18:33:16,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630021638] [2022-11-18 18:33:16,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:33:16,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 18:33:16,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:33:16,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 18:33:16,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-18 18:33:16,221 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 99 [2022-11-18 18:33:16,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 87 transitions, 221 flow. Second operand has 9 states, 9 states have (on average 76.22222222222223) internal successors, (686), 9 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:16,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:33:16,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 99 [2022-11-18 18:33:16,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:33:16,482 INFO L130 PetriNetUnfolder]: 12/180 cut-off events. [2022-11-18 18:33:16,482 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-11-18 18:33:16,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 180 events. 12/180 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 468 event pairs, 0 based on Foata normal form. 1/180 useless extension candidates. Maximal degree in co-relation 283. Up to 16 conditions per place. [2022-11-18 18:33:16,483 INFO L137 encePairwiseOnDemand]: 90/99 looper letters, 19 selfloop transitions, 4 changer transitions 11/100 dead transitions. [2022-11-18 18:33:16,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 100 transitions, 333 flow [2022-11-18 18:33:16,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 18:33:16,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 18:33:16,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 773 transitions. [2022-11-18 18:33:16,486 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7808080808080808 [2022-11-18 18:33:16,486 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 773 transitions. [2022-11-18 18:33:16,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 773 transitions. [2022-11-18 18:33:16,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:33:16,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 773 transitions. [2022-11-18 18:33:16,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 77.3) internal successors, (773), 10 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:16,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 99.0) internal successors, (1089), 11 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:16,492 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 99.0) internal successors, (1089), 11 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:16,492 INFO L175 Difference]: Start difference. First operand has 102 places, 87 transitions, 221 flow. Second operand 10 states and 773 transitions. [2022-11-18 18:33:16,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 100 transitions, 333 flow [2022-11-18 18:33:16,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 100 transitions, 318 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-11-18 18:33:16,495 INFO L231 Difference]: Finished difference. Result has 108 places, 87 transitions, 232 flow [2022-11-18 18:33:16,495 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=232, PETRI_PLACES=108, PETRI_TRANSITIONS=87} [2022-11-18 18:33:16,496 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, 6 predicate places. [2022-11-18 18:33:16,496 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 87 transitions, 232 flow [2022-11-18 18:33:16,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 76.22222222222223) internal successors, (686), 9 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:16,497 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:33:16,497 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] [2022-11-18 18:33:16,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 18:33:16,498 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 18:33:16,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:33:16,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1892492891, now seen corresponding path program 3 times [2022-11-18 18:33:16,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:33:16,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894388586] [2022-11-18 18:33:16,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:33:16,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:33:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 18:33:16,550 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 18:33:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 18:33:16,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 18:33:16,636 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 18:33:16,637 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-18 18:33:16,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-18 18:33:16,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-18 18:33:16,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-18 18:33:16,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-18 18:33:16,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 18:33:16,645 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-11-18 18:33:16,651 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 18:33:16,653 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 18:33:16,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 06:33:16 BasicIcfg [2022-11-18 18:33:16,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 18:33:16,775 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 18:33:16,775 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 18:33:16,775 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 18:33:16,776 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:33:10" (3/4) ... [2022-11-18 18:33:16,777 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 18:33:16,909 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_979d3821-b594-4337-a368-58a1a20a1290/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 18:33:16,909 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 18:33:16,910 INFO L158 Benchmark]: Toolchain (without parser) took 8074.27ms. Allocated memory was 161.5MB in the beginning and 266.3MB in the end (delta: 104.9MB). Free memory was 125.7MB in the beginning and 98.8MB in the end (delta: 26.9MB). Peak memory consumption was 132.9MB. Max. memory is 16.1GB. [2022-11-18 18:33:16,910 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 96.5MB. Free memory was 68.4MB in the beginning and 68.4MB in the end (delta: 30.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 18:33:16,911 INFO L158 Benchmark]: CACSL2BoogieTranslator took 788.42ms. Allocated memory is still 161.5MB. Free memory was 125.4MB in the beginning and 124.9MB in the end (delta: 473.1kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 18:33:16,911 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.64ms. Allocated memory is still 161.5MB. Free memory was 124.9MB in the beginning and 122.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 18:33:16,911 INFO L158 Benchmark]: Boogie Preprocessor took 75.13ms. Allocated memory is still 161.5MB. Free memory was 122.9MB in the beginning and 120.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 18:33:16,911 INFO L158 Benchmark]: RCFGBuilder took 991.60ms. Allocated memory is still 161.5MB. Free memory was 120.8MB in the beginning and 89.8MB in the end (delta: 31.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-18 18:33:16,912 INFO L158 Benchmark]: TraceAbstraction took 5993.57ms. Allocated memory was 161.5MB in the beginning and 266.3MB in the end (delta: 104.9MB). Free memory was 89.3MB in the beginning and 115.5MB in the end (delta: -26.3MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. [2022-11-18 18:33:16,912 INFO L158 Benchmark]: Witness Printer took 133.83ms. Allocated memory is still 266.3MB. Free memory was 115.5MB in the beginning and 98.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-18 18:33:16,915 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.26ms. Allocated memory is still 96.5MB. Free memory was 68.4MB in the beginning and 68.4MB in the end (delta: 30.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 788.42ms. Allocated memory is still 161.5MB. Free memory was 125.4MB in the beginning and 124.9MB in the end (delta: 473.1kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.64ms. Allocated memory is still 161.5MB. Free memory was 124.9MB in the beginning and 122.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.13ms. Allocated memory is still 161.5MB. Free memory was 122.9MB in the beginning and 120.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 991.60ms. Allocated memory is still 161.5MB. Free memory was 120.8MB in the beginning and 89.8MB in the end (delta: 31.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5993.57ms. Allocated memory was 161.5MB in the beginning and 266.3MB in the end (delta: 104.9MB). Free memory was 89.3MB in the beginning and 115.5MB in the end (delta: -26.3MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. * Witness Printer took 133.83ms. Allocated memory is still 266.3MB. Free memory was 115.5MB in the beginning and 98.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L730] 0 _Bool z$r_buff1_thd2; VAL [z$r_buff1_thd2=0] [L728] 0 _Bool z$r_buff1_thd0; VAL [z$r_buff1_thd0=0, z$r_buff1_thd2=0] [L729] 0 _Bool z$r_buff1_thd1; VAL [z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L737] 0 _Bool weak$$choice0; VAL [weak$$choice0=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L735] 0 int z$w_buff1; VAL [weak$$choice0=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$w_buff1=0] [L738] 0 _Bool weak$$choice2; VAL [weak$$choice0=0, weak$$choice2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$w_buff1=0] [L710] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$w_buff1=0] [L723] 0 _Bool z$flush_delayed; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$w_buff1=0] [L733] 0 int z$w_buff0; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$w_buff0=0, z$w_buff1=0] [L726] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$w_buff0=0, z$w_buff1=0] [L727] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$w_buff0=0, z$w_buff1=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$w_buff0=0, z$w_buff1=0] [L725] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$w_buff0=0, z$w_buff1=0] [L724] 0 int z$mem_tmp; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$w_buff0=0, z$w_buff1=0] [L731] 0 _Bool z$read_delayed; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$w_buff0=0, z$w_buff1=0] [L732] 0 int *z$read_delayed_var; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0] [L736] 0 _Bool z$w_buff1_used; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L714] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L720] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L722] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] 0 pthread_t t897; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t897={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] FCALL, FORK 0 pthread_create(&t897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t897, ((void *)0), P0, ((void *)0))=-1, t897={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z$w_buff1 = z$w_buff0 [L743] 1 z$w_buff0 = 1 [L744] 1 z$w_buff1_used = z$w_buff0_used [L745] 1 z$w_buff0_used = (_Bool)1 [L746] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L746] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L747] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L748] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L749] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 0 pthread_t t898; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t897={5:0}, t898={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] FCALL, FORK 0 pthread_create(&t898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t898, ((void *)0), P1, ((void *)0))=0, t897={5:0}, t898={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 z$flush_delayed = weak$$choice2 [L782] 2 z$mem_tmp = z [L783] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L784] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L785] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L786] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L787] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L789] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = z [L791] 2 z = z$flush_delayed ? z$mem_tmp : z [L792] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L796] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L797] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L798] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L799] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t897={5:0}, t898={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L824] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L824] RET 0 assume_abort_if_not(main$tmp_guard0) [L826] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t897={5:0}, t898={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t897={5:0}, t898={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 119 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 198 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 198 mSDsluCounter, 212 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 166 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 507 IncrementalHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 46 mSDtfsCounter, 507 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=6, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 487 NumberOfCodeBlocks, 487 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 403 ConstructedInterpolants, 0 QuantifiedInterpolants, 1162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-18 18:33:16,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_979d3821-b594-4337-a368-58a1a20a1290/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE