./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3368e319-61b6-4a06-845b-92878a01133c/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3368e319-61b6-4a06-845b-92878a01133c/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3368e319-61b6-4a06-845b-92878a01133c/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3368e319-61b6-4a06-845b-92878a01133c/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3368e319-61b6-4a06-845b-92878a01133c/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3368e319-61b6-4a06-845b-92878a01133c/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0b6ad05084ff5d70a22ef215b05587fd59d1867832386446579778aa62df8d63 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:07:18,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:07:18,475 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:07:18,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:07:18,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:07:18,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:07:18,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:07:18,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:07:18,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:07:18,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:07:18,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:07:18,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:07:18,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:07:18,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:07:18,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:07:18,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:07:18,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:07:18,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:07:18,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:07:18,554 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:07:18,556 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:07:18,557 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:07:18,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:07:18,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:07:18,569 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:07:18,570 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:07:18,570 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:07:18,572 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:07:18,572 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:07:18,573 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:07:18,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:07:18,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:07:18,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:07:18,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:07:18,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:07:18,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:07:18,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:07:18,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:07:18,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:07:18,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:07:18,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:07:18,584 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3368e319-61b6-4a06-845b-92878a01133c/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:07:18,620 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:07:18,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:07:18,621 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:07:18,621 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:07:18,622 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:07:18,623 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:07:18,623 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:07:18,623 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:07:18,624 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:07:18,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:07:18,625 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:07:18,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:07:18,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:07:18,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:07:18,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:07:18,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:07:18,626 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:07:18,627 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:07:18,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:07:18,627 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:07:18,627 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:07:18,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:07:18,628 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:07:18,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:07:18,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:07:18,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:07:18,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:07:18,630 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:07:18,631 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:07:18,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:07:18,631 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:07:18,631 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:07:18,632 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:07:18,632 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_3368e319-61b6-4a06-845b-92878a01133c/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3368e319-61b6-4a06-845b-92878a01133c/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0b6ad05084ff5d70a22ef215b05587fd59d1867832386446579778aa62df8d63 [2022-11-02 21:07:18,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:07:18,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:07:18,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:07:18,950 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:07:18,951 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:07:18,952 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3368e319-61b6-4a06-845b-92878a01133c/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-02 21:07:19,026 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3368e319-61b6-4a06-845b-92878a01133c/bin/uautomizer-Dbtcem3rbc/data/1a846861d/cd47ecaf69a4480b8e21a1908296f3ec/FLAG4ed3a68e7 [2022-11-02 21:07:19,542 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:07:19,543 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3368e319-61b6-4a06-845b-92878a01133c/sv-benchmarks/c/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-02 21:07:19,558 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3368e319-61b6-4a06-845b-92878a01133c/bin/uautomizer-Dbtcem3rbc/data/1a846861d/cd47ecaf69a4480b8e21a1908296f3ec/FLAG4ed3a68e7 [2022-11-02 21:07:19,857 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3368e319-61b6-4a06-845b-92878a01133c/bin/uautomizer-Dbtcem3rbc/data/1a846861d/cd47ecaf69a4480b8e21a1908296f3ec [2022-11-02 21:07:19,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:07:19,861 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:07:19,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:07:19,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:07:19,870 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:07:19,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:07:19" (1/1) ... [2022-11-02 21:07:19,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3818ff14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:19, skipping insertion in model container [2022-11-02 21:07:19,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:07:19" (1/1) ... [2022-11-02 21:07:19,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:07:19,933 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:07:20,168 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3368e319-61b6-4a06-845b-92878a01133c/sv-benchmarks/c/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-11-02 21:07:20,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:07:20,481 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:07:20,496 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3368e319-61b6-4a06-845b-92878a01133c/sv-benchmarks/c/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-11-02 21:07:20,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:07:20,588 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:07:20,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:20 WrapperNode [2022-11-02 21:07:20,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:07:20,591 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:07:20,591 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:07:20,591 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:07:20,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:20" (1/1) ... [2022-11-02 21:07:20,637 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:20" (1/1) ... [2022-11-02 21:07:20,683 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 259 [2022-11-02 21:07:20,690 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:07:20,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:07:20,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:07:20,691 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:07:20,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:20" (1/1) ... [2022-11-02 21:07:20,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:20" (1/1) ... [2022-11-02 21:07:20,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:20" (1/1) ... [2022-11-02 21:07:20,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:20" (1/1) ... [2022-11-02 21:07:20,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:20" (1/1) ... [2022-11-02 21:07:20,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:20" (1/1) ... [2022-11-02 21:07:20,717 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:20" (1/1) ... [2022-11-02 21:07:20,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:20" (1/1) ... [2022-11-02 21:07:20,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:07:20,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:07:20,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:07:20,724 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:07:20,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:20" (1/1) ... [2022-11-02 21:07:20,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:07:20,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3368e319-61b6-4a06-845b-92878a01133c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:20,781 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3368e319-61b6-4a06-845b-92878a01133c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:07:20,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3368e319-61b6-4a06-845b-92878a01133c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:07:20,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:07:20,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 21:07:20,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:07:20,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:07:20,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:07:20,828 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-02 21:07:20,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-02 21:07:20,828 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-02 21:07:20,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-02 21:07:20,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:07:20,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 21:07:20,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:07:20,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:07:20,831 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 21:07:21,042 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:07:21,044 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:07:21,676 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:07:22,144 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:07:22,144 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 21:07:22,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:07:22 BoogieIcfgContainer [2022-11-02 21:07:22,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:07:22,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:07:22,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:07:22,154 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:07:22,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:07:19" (1/3) ... [2022-11-02 21:07:22,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c074915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:07:22, skipping insertion in model container [2022-11-02 21:07:22,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:20" (2/3) ... [2022-11-02 21:07:22,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c074915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:07:22, skipping insertion in model container [2022-11-02 21:07:22,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:07:22" (3/3) ... [2022-11-02 21:07:22,158 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-02 21:07:22,167 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 21:07:22,178 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:07:22,178 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 21:07:22,179 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 21:07:22,243 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 21:07:22,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 94 transitions, 198 flow [2022-11-02 21:07:22,367 INFO L130 PetriNetUnfolder]: 2/92 cut-off events. [2022-11-02 21:07:22,368 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:07:22,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-11-02 21:07:22,372 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 94 transitions, 198 flow [2022-11-02 21:07:22,379 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 92 transitions, 190 flow [2022-11-02 21:07:22,402 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:07:22,410 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;@1fa340fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:07:22,411 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-02 21:07:22,434 INFO L130 PetriNetUnfolder]: 0/43 cut-off events. [2022-11-02 21:07:22,435 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:07:22,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:22,436 INFO L208 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] [2022-11-02 21:07:22,437 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-02 21:07:22,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:22,444 INFO L85 PathProgramCache]: Analyzing trace with hash 840746016, now seen corresponding path program 1 times [2022-11-02 21:07:22,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:22,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421540266] [2022-11-02 21:07:22,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:22,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:22,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:22,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:22,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421540266] [2022-11-02 21:07:22,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421540266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:22,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:22,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:22,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742219675] [2022-11-02 21:07:22,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:22,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:22,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:23,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:23,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:23,026 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 94 [2022-11-02 21:07:23,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 92 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:23,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:23,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 94 [2022-11-02 21:07:23,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:23,127 INFO L130 PetriNetUnfolder]: 18/163 cut-off events. [2022-11-02 21:07:23,128 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 21:07:23,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 163 events. 18/163 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 397 event pairs, 2 based on Foata normal form. 6/161 useless extension candidates. Maximal degree in co-relation 168. Up to 31 conditions per place. [2022-11-02 21:07:23,130 INFO L137 encePairwiseOnDemand]: 89/94 looper letters, 10 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2022-11-02 21:07:23,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 92 transitions, 217 flow [2022-11-02 21:07:23,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:23,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2022-11-02 21:07:23,154 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9326241134751773 [2022-11-02 21:07:23,155 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 263 transitions. [2022-11-02 21:07:23,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 263 transitions. [2022-11-02 21:07:23,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:23,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 263 transitions. [2022-11-02 21:07:23,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:23,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:23,186 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:23,188 INFO L175 Difference]: Start difference. First operand has 97 places, 92 transitions, 190 flow. Second operand 3 states and 263 transitions. [2022-11-02 21:07:23,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 92 transitions, 217 flow [2022-11-02 21:07:23,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 92 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:07:23,201 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 184 flow [2022-11-02 21:07:23,204 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2022-11-02 21:07:23,209 INFO L287 CegarLoopForPetriNet]: 97 programPoint places, -2 predicate places. [2022-11-02 21:07:23,210 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 184 flow [2022-11-02 21:07:23,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:23,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:23,212 INFO L208 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] [2022-11-02 21:07:23,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:07:23,213 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-02 21:07:23,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:23,214 INFO L85 PathProgramCache]: Analyzing trace with hash 88413764, now seen corresponding path program 1 times [2022-11-02 21:07:23,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:23,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952658738] [2022-11-02 21:07:23,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:23,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:23,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:23,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:23,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952658738] [2022-11-02 21:07:23,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952658738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:23,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:23,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:07:23,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943985317] [2022-11-02 21:07:23,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:23,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:07:23,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:23,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:07:23,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:07:23,796 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 94 [2022-11-02 21:07:23,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 76.66666666666667) internal successors, (460), 6 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:23,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:23,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 94 [2022-11-02 21:07:23,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:24,156 INFO L130 PetriNetUnfolder]: 114/467 cut-off events. [2022-11-02 21:07:24,156 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-11-02 21:07:24,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 467 events. 114/467 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2346 event pairs, 25 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 683. Up to 105 conditions per place. [2022-11-02 21:07:24,163 INFO L137 encePairwiseOnDemand]: 88/94 looper letters, 15 selfloop transitions, 2 changer transitions 37/118 dead transitions. [2022-11-02 21:07:24,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 118 transitions, 348 flow [2022-11-02 21:07:24,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:07:24,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 21:07:24,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 722 transitions. [2022-11-02 21:07:24,194 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8534278959810875 [2022-11-02 21:07:24,194 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 722 transitions. [2022-11-02 21:07:24,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 722 transitions. [2022-11-02 21:07:24,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:24,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 722 transitions. [2022-11-02 21:07:24,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 80.22222222222223) internal successors, (722), 9 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:24,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 94.0) internal successors, (940), 10 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:24,201 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 94.0) internal successors, (940), 10 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:24,201 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 184 flow. Second operand 9 states and 722 transitions. [2022-11-02 21:07:24,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 118 transitions, 348 flow [2022-11-02 21:07:24,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 118 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:07:24,214 INFO L231 Difference]: Finished difference. Result has 108 places, 78 transitions, 180 flow [2022-11-02 21:07:24,215 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=180, PETRI_PLACES=108, PETRI_TRANSITIONS=78} [2022-11-02 21:07:24,215 INFO L287 CegarLoopForPetriNet]: 97 programPoint places, 11 predicate places. [2022-11-02 21:07:24,215 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 78 transitions, 180 flow [2022-11-02 21:07:24,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.66666666666667) internal successors, (460), 6 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:24,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:24,216 INFO L208 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] [2022-11-02 21:07:24,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:07:24,217 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-02 21:07:24,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:24,218 INFO L85 PathProgramCache]: Analyzing trace with hash -469601021, now seen corresponding path program 1 times [2022-11-02 21:07:24,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:24,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943836378] [2022-11-02 21:07:24,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:24,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:25,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:25,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943836378] [2022-11-02 21:07:25,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943836378] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:25,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:25,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:07:25,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096159212] [2022-11-02 21:07:25,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:25,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:07:25,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:25,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:07:25,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:07:25,265 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 94 [2022-11-02 21:07:25,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 78 transitions, 180 flow. Second operand has 10 states, 10 states have (on average 73.3) internal successors, (733), 10 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:25,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:25,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 94 [2022-11-02 21:07:25,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:25,725 INFO L130 PetriNetUnfolder]: 99/315 cut-off events. [2022-11-02 21:07:25,726 INFO L131 PetriNetUnfolder]: For 86/86 co-relation queries the response was YES. [2022-11-02 21:07:25,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 315 events. 99/315 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1249 event pairs, 25 based on Foata normal form. 9/317 useless extension candidates. Maximal degree in co-relation 563. Up to 108 conditions per place. [2022-11-02 21:07:25,730 INFO L137 encePairwiseOnDemand]: 83/94 looper letters, 17 selfloop transitions, 8 changer transitions 35/121 dead transitions. [2022-11-02 21:07:25,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 121 transitions, 418 flow [2022-11-02 21:07:25,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:07:25,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-02 21:07:25,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1143 transitions. [2022-11-02 21:07:25,734 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8106382978723404 [2022-11-02 21:07:25,734 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1143 transitions. [2022-11-02 21:07:25,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1143 transitions. [2022-11-02 21:07:25,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:25,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1143 transitions. [2022-11-02 21:07:25,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 76.2) internal successors, (1143), 15 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:25,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 94.0) internal successors, (1504), 16 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:25,745 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 94.0) internal successors, (1504), 16 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:25,746 INFO L175 Difference]: Start difference. First operand has 108 places, 78 transitions, 180 flow. Second operand 15 states and 1143 transitions. [2022-11-02 21:07:25,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 121 transitions, 418 flow [2022-11-02 21:07:25,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 121 transitions, 378 flow, removed 18 selfloop flow, removed 8 redundant places. [2022-11-02 21:07:25,753 INFO L231 Difference]: Finished difference. Result has 109 places, 82 transitions, 236 flow [2022-11-02 21:07:25,754 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=236, PETRI_PLACES=109, PETRI_TRANSITIONS=82} [2022-11-02 21:07:25,756 INFO L287 CegarLoopForPetriNet]: 97 programPoint places, 12 predicate places. [2022-11-02 21:07:25,756 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 82 transitions, 236 flow [2022-11-02 21:07:25,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 73.3) internal successors, (733), 10 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:25,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:25,757 INFO L208 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-02 21:07:25,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:07:25,758 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-02 21:07:25,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:25,759 INFO L85 PathProgramCache]: Analyzing trace with hash -870504972, now seen corresponding path program 1 times [2022-11-02 21:07:25,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:25,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695936603] [2022-11-02 21:07:25,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:25,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:26,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:26,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:26,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695936603] [2022-11-02 21:07:26,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695936603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:26,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:26,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:07:26,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136116016] [2022-11-02 21:07:26,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:26,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:07:26,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:26,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:07:26,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:07:26,080 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 94 [2022-11-02 21:07:26,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 82 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 74.71428571428571) internal successors, (523), 7 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:26,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:26,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 94 [2022-11-02 21:07:26,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:26,447 INFO L130 PetriNetUnfolder]: 103/348 cut-off events. [2022-11-02 21:07:26,447 INFO L131 PetriNetUnfolder]: For 545/548 co-relation queries the response was YES. [2022-11-02 21:07:26,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 348 events. 103/348 cut-off events. For 545/548 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1467 event pairs, 26 based on Foata normal form. 10/340 useless extension candidates. Maximal degree in co-relation 853. Up to 68 conditions per place. [2022-11-02 21:07:26,450 INFO L137 encePairwiseOnDemand]: 86/94 looper letters, 17 selfloop transitions, 4 changer transitions 29/113 dead transitions. [2022-11-02 21:07:26,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 113 transitions, 494 flow [2022-11-02 21:07:26,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:07:26,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 21:07:26,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 778 transitions. [2022-11-02 21:07:26,453 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8276595744680851 [2022-11-02 21:07:26,454 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 778 transitions. [2022-11-02 21:07:26,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 778 transitions. [2022-11-02 21:07:26,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:26,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 778 transitions. [2022-11-02 21:07:26,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 77.8) internal successors, (778), 10 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:26,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 94.0) internal successors, (1034), 11 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:26,459 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 94.0) internal successors, (1034), 11 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:26,459 INFO L175 Difference]: Start difference. First operand has 109 places, 82 transitions, 236 flow. Second operand 10 states and 778 transitions. [2022-11-02 21:07:26,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 113 transitions, 494 flow [2022-11-02 21:07:26,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 113 transitions, 468 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-11-02 21:07:26,465 INFO L231 Difference]: Finished difference. Result has 112 places, 80 transitions, 241 flow [2022-11-02 21:07:26,465 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=241, PETRI_PLACES=112, PETRI_TRANSITIONS=80} [2022-11-02 21:07:26,466 INFO L287 CegarLoopForPetriNet]: 97 programPoint places, 15 predicate places. [2022-11-02 21:07:26,466 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 80 transitions, 241 flow [2022-11-02 21:07:26,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.71428571428571) internal successors, (523), 7 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:26,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:26,467 INFO L208 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] [2022-11-02 21:07:26,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:07:26,468 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-02 21:07:26,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:26,468 INFO L85 PathProgramCache]: Analyzing trace with hash 962395624, now seen corresponding path program 1 times [2022-11-02 21:07:26,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:26,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720538539] [2022-11-02 21:07:26,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:26,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:27,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:27,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720538539] [2022-11-02 21:07:27,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720538539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:27,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:27,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:07:27,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807532016] [2022-11-02 21:07:27,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:27,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:07:27,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:27,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:07:27,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:07:27,108 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 94 [2022-11-02 21:07:27,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 80 transitions, 241 flow. Second operand has 9 states, 9 states have (on average 69.88888888888889) internal successors, (629), 9 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:27,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:27,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 94 [2022-11-02 21:07:27,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:27,808 INFO L130 PetriNetUnfolder]: 237/696 cut-off events. [2022-11-02 21:07:27,808 INFO L131 PetriNetUnfolder]: For 863/866 co-relation queries the response was YES. [2022-11-02 21:07:27,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1660 conditions, 696 events. 237/696 cut-off events. For 863/866 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4022 event pairs, 27 based on Foata normal form. 3/684 useless extension candidates. Maximal degree in co-relation 1585. Up to 146 conditions per place. [2022-11-02 21:07:27,813 INFO L137 encePairwiseOnDemand]: 80/94 looper letters, 43 selfloop transitions, 9 changer transitions 65/173 dead transitions. [2022-11-02 21:07:27,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 173 transitions, 801 flow [2022-11-02 21:07:27,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 21:07:27,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-02 21:07:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1342 transitions. [2022-11-02 21:07:27,817 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.793144208037825 [2022-11-02 21:07:27,817 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1342 transitions. [2022-11-02 21:07:27,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1342 transitions. [2022-11-02 21:07:27,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:27,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1342 transitions. [2022-11-02 21:07:27,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 74.55555555555556) internal successors, (1342), 18 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:27,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 94.0) internal successors, (1786), 19 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:27,825 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 94.0) internal successors, (1786), 19 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:27,826 INFO L175 Difference]: Start difference. First operand has 112 places, 80 transitions, 241 flow. Second operand 18 states and 1342 transitions. [2022-11-02 21:07:27,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 173 transitions, 801 flow [2022-11-02 21:07:27,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 173 transitions, 755 flow, removed 15 selfloop flow, removed 15 redundant places. [2022-11-02 21:07:27,831 INFO L231 Difference]: Finished difference. Result has 122 places, 85 transitions, 316 flow [2022-11-02 21:07:27,831 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=316, PETRI_PLACES=122, PETRI_TRANSITIONS=85} [2022-11-02 21:07:27,832 INFO L287 CegarLoopForPetriNet]: 97 programPoint places, 25 predicate places. [2022-11-02 21:07:27,832 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 85 transitions, 316 flow [2022-11-02 21:07:27,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 69.88888888888889) internal successors, (629), 9 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:27,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:27,833 INFO L208 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] [2022-11-02 21:07:27,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:07:27,833 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-02 21:07:27,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:27,834 INFO L85 PathProgramCache]: Analyzing trace with hash -141410492, now seen corresponding path program 2 times [2022-11-02 21:07:27,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:27,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94458300] [2022-11-02 21:07:27,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:27,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:28,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:28,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:28,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94458300] [2022-11-02 21:07:28,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94458300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:28,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:28,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:07:28,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305884996] [2022-11-02 21:07:28,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:28,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:07:28,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:28,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:07:28,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:07:28,112 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 94 [2022-11-02 21:07:28,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 85 transitions, 316 flow. Second operand has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:28,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:28,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 94 [2022-11-02 21:07:28,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:28,376 INFO L130 PetriNetUnfolder]: 97/331 cut-off events. [2022-11-02 21:07:28,377 INFO L131 PetriNetUnfolder]: For 856/862 co-relation queries the response was YES. [2022-11-02 21:07:28,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 331 events. 97/331 cut-off events. For 856/862 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1329 event pairs, 7 based on Foata normal form. 16/343 useless extension candidates. Maximal degree in co-relation 1020. Up to 67 conditions per place. [2022-11-02 21:07:28,380 INFO L137 encePairwiseOnDemand]: 86/94 looper letters, 21 selfloop transitions, 5 changer transitions 27/115 dead transitions. [2022-11-02 21:07:28,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 115 transitions, 622 flow [2022-11-02 21:07:28,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:07:28,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 21:07:28,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 709 transitions. [2022-11-02 21:07:28,384 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8380614657210402 [2022-11-02 21:07:28,384 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 709 transitions. [2022-11-02 21:07:28,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 709 transitions. [2022-11-02 21:07:28,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:28,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 709 transitions. [2022-11-02 21:07:28,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 78.77777777777777) internal successors, (709), 9 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:28,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 94.0) internal successors, (940), 10 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:28,390 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 94.0) internal successors, (940), 10 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:28,390 INFO L175 Difference]: Start difference. First operand has 122 places, 85 transitions, 316 flow. Second operand 9 states and 709 transitions. [2022-11-02 21:07:28,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 115 transitions, 622 flow [2022-11-02 21:07:28,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 115 transitions, 550 flow, removed 23 selfloop flow, removed 12 redundant places. [2022-11-02 21:07:28,396 INFO L231 Difference]: Finished difference. Result has 111 places, 81 transitions, 270 flow [2022-11-02 21:07:28,397 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=270, PETRI_PLACES=111, PETRI_TRANSITIONS=81} [2022-11-02 21:07:28,398 INFO L287 CegarLoopForPetriNet]: 97 programPoint places, 14 predicate places. [2022-11-02 21:07:28,398 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 81 transitions, 270 flow [2022-11-02 21:07:28,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:28,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:28,399 INFO L208 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-02 21:07:28,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:07:28,399 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-02 21:07:28,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:28,400 INFO L85 PathProgramCache]: Analyzing trace with hash 89874638, now seen corresponding path program 1 times [2022-11-02 21:07:28,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:28,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137788797] [2022-11-02 21:07:28,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:28,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:28,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:28,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:28,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137788797] [2022-11-02 21:07:28,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137788797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:28,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:28,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:07:28,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299056922] [2022-11-02 21:07:28,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:28,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:07:28,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:28,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:07:28,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:07:28,717 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 94 [2022-11-02 21:07:28,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 81 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 75.0) internal successors, (525), 7 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:28,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:28,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 94 [2022-11-02 21:07:28,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:28,913 INFO L130 PetriNetUnfolder]: 23/144 cut-off events. [2022-11-02 21:07:28,913 INFO L131 PetriNetUnfolder]: For 261/261 co-relation queries the response was YES. [2022-11-02 21:07:28,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 409 conditions, 144 events. 23/144 cut-off events. For 261/261 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 290 event pairs, 3 based on Foata normal form. 5/147 useless extension candidates. Maximal degree in co-relation 388. Up to 17 conditions per place. [2022-11-02 21:07:28,915 INFO L137 encePairwiseOnDemand]: 86/94 looper letters, 15 selfloop transitions, 7 changer transitions 15/99 dead transitions. [2022-11-02 21:07:28,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 99 transitions, 467 flow [2022-11-02 21:07:28,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:07:28,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 21:07:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 768 transitions. [2022-11-02 21:07:28,918 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8170212765957446 [2022-11-02 21:07:28,918 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 768 transitions. [2022-11-02 21:07:28,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 768 transitions. [2022-11-02 21:07:28,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:28,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 768 transitions. [2022-11-02 21:07:28,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 76.8) internal successors, (768), 10 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:28,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 94.0) internal successors, (1034), 11 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:28,923 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 94.0) internal successors, (1034), 11 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:28,923 INFO L175 Difference]: Start difference. First operand has 111 places, 81 transitions, 270 flow. Second operand 10 states and 768 transitions. [2022-11-02 21:07:28,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 99 transitions, 467 flow [2022-11-02 21:07:28,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 99 transitions, 372 flow, removed 39 selfloop flow, removed 13 redundant places. [2022-11-02 21:07:28,927 INFO L231 Difference]: Finished difference. Result has 109 places, 81 transitions, 254 flow [2022-11-02 21:07:28,927 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=254, PETRI_PLACES=109, PETRI_TRANSITIONS=81} [2022-11-02 21:07:28,928 INFO L287 CegarLoopForPetriNet]: 97 programPoint places, 12 predicate places. [2022-11-02 21:07:28,928 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 81 transitions, 254 flow [2022-11-02 21:07:28,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.0) internal successors, (525), 7 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:28,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:28,929 INFO L208 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-02 21:07:28,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:07:28,930 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 21:07:28,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:28,930 INFO L85 PathProgramCache]: Analyzing trace with hash -684190178, now seen corresponding path program 1 times [2022-11-02 21:07:28,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:28,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303752191] [2022-11-02 21:07:28,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:28,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:30,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:30,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303752191] [2022-11-02 21:07:30,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303752191] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:30,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:30,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 21:07:30,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547061966] [2022-11-02 21:07:30,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:30,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 21:07:30,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:30,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 21:07:30,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:07:30,903 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 94 [2022-11-02 21:07:30,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 81 transitions, 254 flow. Second operand has 14 states, 14 states have (on average 69.5) internal successors, (973), 14 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:30,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:30,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 94 [2022-11-02 21:07:30,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:31,201 INFO L130 PetriNetUnfolder]: 5/122 cut-off events. [2022-11-02 21:07:31,201 INFO L131 PetriNetUnfolder]: For 96/100 co-relation queries the response was YES. [2022-11-02 21:07:31,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 122 events. 5/122 cut-off events. For 96/100 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 166 event pairs, 0 based on Foata normal form. 3/125 useless extension candidates. Maximal degree in co-relation 247. Up to 12 conditions per place. [2022-11-02 21:07:31,202 INFO L137 encePairwiseOnDemand]: 83/94 looper letters, 16 selfloop transitions, 7 changer transitions 9/90 dead transitions. [2022-11-02 21:07:31,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 90 transitions, 340 flow [2022-11-02 21:07:31,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 21:07:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-02 21:07:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 917 transitions. [2022-11-02 21:07:31,205 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7504091653027823 [2022-11-02 21:07:31,206 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 917 transitions. [2022-11-02 21:07:31,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 917 transitions. [2022-11-02 21:07:31,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:31,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 917 transitions. [2022-11-02 21:07:31,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 70.53846153846153) internal successors, (917), 13 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:31,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 94.0) internal successors, (1316), 14 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:31,212 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 94.0) internal successors, (1316), 14 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:31,212 INFO L175 Difference]: Start difference. First operand has 109 places, 81 transitions, 254 flow. Second operand 13 states and 917 transitions. [2022-11-02 21:07:31,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 90 transitions, 340 flow [2022-11-02 21:07:31,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 90 transitions, 287 flow, removed 15 selfloop flow, removed 14 redundant places. [2022-11-02 21:07:31,216 INFO L231 Difference]: Finished difference. Result has 107 places, 79 transitions, 213 flow [2022-11-02 21:07:31,216 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=213, PETRI_PLACES=107, PETRI_TRANSITIONS=79} [2022-11-02 21:07:31,217 INFO L287 CegarLoopForPetriNet]: 97 programPoint places, 10 predicate places. [2022-11-02 21:07:31,217 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 79 transitions, 213 flow [2022-11-02 21:07:31,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 69.5) internal successors, (973), 14 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:31,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:31,218 INFO L208 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-02 21:07:31,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:07:31,219 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 21:07:31,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:31,219 INFO L85 PathProgramCache]: Analyzing trace with hash -376990720, now seen corresponding path program 2 times [2022-11-02 21:07:31,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:31,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342901919] [2022-11-02 21:07:31,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:31,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:07:31,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:07:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:07:31,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:07:31,334 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 21:07:31,335 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-02 21:07:31,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-02 21:07:31,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-02 21:07:31,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-02 21:07:31,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-02 21:07:31,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:07:31,339 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2022-11-02 21:07:31,345 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 21:07:31,345 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 21:07:31,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 09:07:31 BasicIcfg [2022-11-02 21:07:31,454 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 21:07:31,454 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 21:07:31,454 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 21:07:31,455 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 21:07:31,455 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:07:22" (3/4) ... [2022-11-02 21:07:31,457 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 21:07:31,561 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3368e319-61b6-4a06-845b-92878a01133c/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 21:07:31,565 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 21:07:31,566 INFO L158 Benchmark]: Toolchain (without parser) took 11705.10ms. Allocated memory was 104.9MB in the beginning and 310.4MB in the end (delta: 205.5MB). Free memory was 63.1MB in the beginning and 127.3MB in the end (delta: -64.2MB). Peak memory consumption was 140.9MB. Max. memory is 16.1GB. [2022-11-02 21:07:31,566 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 104.9MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:07:31,567 INFO L158 Benchmark]: CACSL2BoogieTranslator took 723.61ms. Allocated memory is still 104.9MB. Free memory was 62.9MB in the beginning and 67.0MB in the end (delta: -4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 21:07:31,568 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.70ms. Allocated memory is still 104.9MB. Free memory was 67.0MB in the beginning and 64.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 21:07:31,568 INFO L158 Benchmark]: Boogie Preprocessor took 31.81ms. Allocated memory is still 104.9MB. Free memory was 64.0MB in the beginning and 61.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:07:31,568 INFO L158 Benchmark]: RCFGBuilder took 1424.05ms. Allocated memory was 104.9MB in the beginning and 134.2MB in the end (delta: 29.4MB). Free memory was 61.9MB in the beginning and 78.8MB in the end (delta: -16.9MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2022-11-02 21:07:31,569 INFO L158 Benchmark]: TraceAbstraction took 9303.87ms. Allocated memory was 134.2MB in the beginning and 310.4MB in the end (delta: 176.2MB). Free memory was 78.8MB in the beginning and 144.1MB in the end (delta: -65.3MB). Peak memory consumption was 109.8MB. Max. memory is 16.1GB. [2022-11-02 21:07:31,569 INFO L158 Benchmark]: Witness Printer took 111.22ms. Allocated memory is still 310.4MB. Free memory was 144.1MB in the beginning and 127.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-02 21:07:31,581 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.28ms. Allocated memory is still 104.9MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 723.61ms. Allocated memory is still 104.9MB. Free memory was 62.9MB in the beginning and 67.0MB in the end (delta: -4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.70ms. Allocated memory is still 104.9MB. Free memory was 67.0MB in the beginning and 64.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.81ms. Allocated memory is still 104.9MB. Free memory was 64.0MB in the beginning and 61.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1424.05ms. Allocated memory was 104.9MB in the beginning and 134.2MB in the end (delta: 29.4MB). Free memory was 61.9MB in the beginning and 78.8MB in the end (delta: -16.9MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9303.87ms. Allocated memory was 134.2MB in the beginning and 310.4MB in the end (delta: 176.2MB). Free memory was 78.8MB in the beginning and 144.1MB in the end (delta: -65.3MB). Peak memory consumption was 109.8MB. Max. memory is 16.1GB. * Witness Printer took 111.22ms. Allocated memory is still 310.4MB. Free memory was 144.1MB in the beginning and 127.3MB 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: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L711] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L712] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L714] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L716] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L718] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L719] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L720] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L721] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L725] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L726] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L727] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L728] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L729] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L730] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L731] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2009; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2009, ((void *)0), P0, ((void *)0))=-1, t2009={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] 0 pthread_t t2010; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009={5:0}, t2010={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L795] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2010, ((void *)0), P1, ((void *)0))=0, t2009={5:0}, t2010={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L774] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, 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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009={5:0}, t2010={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009={5:0}, t2010={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$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: 795]: 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: 793]: 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, 112 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: 9.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 341 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 341 mSDsluCounter, 320 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 479 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 760 IncrementalHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 68 mSDtfsCounter, 760 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=316occurred in iteration=5, InterpolantAutomatonStates: 87, 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.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 589 NumberOfCodeBlocks, 589 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 508 ConstructedInterpolants, 0 QuantifiedInterpolants, 2721 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-02 21:07:31,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3368e319-61b6-4a06-845b-92878a01133c/bin/uautomizer-Dbtcem3rbc/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