./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 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_0cdfdaaf-12a2-4fa4-96d3-79a56e53a4f5/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cdfdaaf-12a2-4fa4-96d3-79a56e53a4f5/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cdfdaaf-12a2-4fa4-96d3-79a56e53a4f5/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cdfdaaf-12a2-4fa4-96d3-79a56e53a4f5/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cdfdaaf-12a2-4fa4-96d3-79a56e53a4f5/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cdfdaaf-12a2-4fa4-96d3-79a56e53a4f5/bin/uautomizer-vX5HgA9Q3a --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 cb908a7f9df60a2a419557a30ba61167baea262647e714e35178f644d31e1055 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 16:51:06,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:51:06,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:51:06,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:51:06,644 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:51:06,645 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:51:06,646 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:51:06,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:51:06,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:51:06,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:51:06,659 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:51:06,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:51:06,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:51:06,672 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:51:06,673 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:51:06,674 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:51:06,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:51:06,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:51:06,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:51:06,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:51:06,680 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:51:06,687 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:51:06,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:51:06,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:51:06,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:51:06,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:51:06,701 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:51:06,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:51:06,702 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:51:06,703 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:51:06,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:51:06,704 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:51:06,705 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:51:06,706 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:51:06,707 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:51:06,707 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:51:06,708 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:51:06,708 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:51:06,709 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:51:06,710 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:51:06,710 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:51:06,711 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cdfdaaf-12a2-4fa4-96d3-79a56e53a4f5/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 16:51:06,732 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:51:06,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:51:06,733 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:51:06,733 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:51:06,734 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:51:06,734 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:51:06,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:51:06,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:51:06,735 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:51:06,736 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:51:06,736 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:51:06,736 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:51:06,736 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:51:06,736 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:51:06,737 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:51:06,737 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:51:06,737 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:51:06,737 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:51:06,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:51:06,738 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:51:06,738 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:51:06,738 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:51:06,738 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:51:06,738 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:51:06,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:51:06,739 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:51:06,739 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:51:06,739 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:51:06,740 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:51:06,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:51:06,740 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:51:06,740 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:51:06,740 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:51:06,741 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_0cdfdaaf-12a2-4fa4-96d3-79a56e53a4f5/bin/uautomizer-vX5HgA9Q3a/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cdfdaaf-12a2-4fa4-96d3-79a56e53a4f5/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> cb908a7f9df60a2a419557a30ba61167baea262647e714e35178f644d31e1055 [2022-11-21 16:51:07,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:51:07,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:51:07,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:51:07,054 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:51:07,054 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:51:07,056 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cdfdaaf-12a2-4fa4-96d3-79a56e53a4f5/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-11-21 16:51:10,200 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:51:10,523 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:51:10,524 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cdfdaaf-12a2-4fa4-96d3-79a56e53a4f5/sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-11-21 16:51:10,539 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cdfdaaf-12a2-4fa4-96d3-79a56e53a4f5/bin/uautomizer-vX5HgA9Q3a/data/c9acb69e4/549e8493e51b47b89ab15576ff8c913c/FLAG3da126fdc [2022-11-21 16:51:10,558 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cdfdaaf-12a2-4fa4-96d3-79a56e53a4f5/bin/uautomizer-vX5HgA9Q3a/data/c9acb69e4/549e8493e51b47b89ab15576ff8c913c [2022-11-21 16:51:10,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:51:10,567 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:51:10,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:51:10,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:51:10,574 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:51:10,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:51:10" (1/1) ... [2022-11-21 16:51:10,576 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d5a6134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:10, skipping insertion in model container [2022-11-21 16:51:10,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:51:10" (1/1) ... [2022-11-21 16:51:10,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:51:10,646 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:51:10,821 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cdfdaaf-12a2-4fa4-96d3-79a56e53a4f5/sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-21 16:51:11,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:51:11,083 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:51:11,105 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cdfdaaf-12a2-4fa4-96d3-79a56e53a4f5/sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-21 16:51:11,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:51:11,246 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:51:11,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:11 WrapperNode [2022-11-21 16:51:11,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:51:11,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:51:11,248 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:51:11,249 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:51:11,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:11" (1/1) ... [2022-11-21 16:51:11,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:11" (1/1) ... [2022-11-21 16:51:11,318 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2022-11-21 16:51:11,319 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:51:11,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:51:11,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:51:11,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:51:11,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:11" (1/1) ... [2022-11-21 16:51:11,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:11" (1/1) ... [2022-11-21 16:51:11,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:11" (1/1) ... [2022-11-21 16:51:11,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:11" (1/1) ... [2022-11-21 16:51:11,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:11" (1/1) ... [2022-11-21 16:51:11,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:11" (1/1) ... [2022-11-21 16:51:11,346 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:11" (1/1) ... [2022-11-21 16:51:11,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:11" (1/1) ... [2022-11-21 16:51:11,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:51:11,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:51:11,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:51:11,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:51:11,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:11" (1/1) ... [2022-11-21 16:51:11,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:51:11,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cdfdaaf-12a2-4fa4-96d3-79a56e53a4f5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:51:11,384 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cdfdaaf-12a2-4fa4-96d3-79a56e53a4f5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:51:11,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cdfdaaf-12a2-4fa4-96d3-79a56e53a4f5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:51:11,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:51:11,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 16:51:11,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:51:11,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:51:11,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:51:11,447 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 16:51:11,447 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 16:51:11,447 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 16:51:11,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 16:51:11,448 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 16:51:11,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 16:51:11,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:51:11,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 16:51:11,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:51:11,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:51:11,451 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 16:51:11,647 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:51:11,660 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:51:11,987 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:51:12,269 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:51:12,270 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 16:51:12,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:51:12 BoogieIcfgContainer [2022-11-21 16:51:12,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:51:12,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:51:12,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:51:12,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:51:12,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:51:10" (1/3) ... [2022-11-21 16:51:12,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3bc44c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:51:12, skipping insertion in model container [2022-11-21 16:51:12,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:11" (2/3) ... [2022-11-21 16:51:12,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3bc44c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:51:12, skipping insertion in model container [2022-11-21 16:51:12,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:51:12" (3/3) ... [2022-11-21 16:51:12,281 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-11-21 16:51:12,290 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-21 16:51:12,300 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:51:12,301 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-21 16:51:12,301 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 16:51:12,367 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 16:51:12,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 253 flow [2022-11-21 16:51:12,483 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2022-11-21 16:51:12,483 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:51:12,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2022-11-21 16:51:12,489 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 119 transitions, 253 flow [2022-11-21 16:51:12,494 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 116 transitions, 241 flow [2022-11-21 16:51:12,504 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:51:12,511 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;@6bd4003b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:51:12,511 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-21 16:51:12,524 INFO L130 PetriNetUnfolder]: 0/48 cut-off events. [2022-11-21 16:51:12,524 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:51:12,524 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:51:12,525 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:12,525 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 16:51:12,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:12,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1537814399, now seen corresponding path program 1 times [2022-11-21 16:51:12,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:12,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236385665] [2022-11-21 16:51:12,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:12,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:13,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:51:13,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:51:13,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236385665] [2022-11-21 16:51:13,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236385665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:51:13,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:51:13,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:51:13,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034608779] [2022-11-21 16:51:13,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:51:13,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:51:13,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:51:13,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:51:13,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:51:13,211 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 119 [2022-11-21 16:51:13,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 116 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:13,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:51:13,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 119 [2022-11-21 16:51:13,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:51:13,418 INFO L130 PetriNetUnfolder]: 58/326 cut-off events. [2022-11-21 16:51:13,418 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-21 16:51:13,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 326 events. 58/326 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1371 event pairs, 44 based on Foata normal form. 18/319 useless extension candidates. Maximal degree in co-relation 401. Up to 79 conditions per place. [2022-11-21 16:51:13,424 INFO L137 encePairwiseOnDemand]: 114/119 looper letters, 14 selfloop transitions, 2 changer transitions 0/118 dead transitions. [2022-11-21 16:51:13,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 118 transitions, 283 flow [2022-11-21 16:51:13,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:51:13,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:51:13,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2022-11-21 16:51:13,445 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9411764705882353 [2022-11-21 16:51:13,447 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2022-11-21 16:51:13,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2022-11-21 16:51:13,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:51:13,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2022-11-21 16:51:13,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:13,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:13,472 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:13,474 INFO L175 Difference]: Start difference. First operand has 124 places, 116 transitions, 241 flow. Second operand 3 states and 336 transitions. [2022-11-21 16:51:13,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 118 transitions, 283 flow [2022-11-21 16:51:13,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 118 transitions, 278 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-21 16:51:13,484 INFO L231 Difference]: Finished difference. Result has 121 places, 112 transitions, 234 flow [2022-11-21 16:51:13,486 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=121, PETRI_TRANSITIONS=112} [2022-11-21 16:51:13,494 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, -3 predicate places. [2022-11-21 16:51:13,495 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 112 transitions, 234 flow [2022-11-21 16:51:13,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:13,496 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:51:13,497 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:13,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:51:13,498 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 16:51:13,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:13,499 INFO L85 PathProgramCache]: Analyzing trace with hash -830400499, now seen corresponding path program 1 times [2022-11-21 16:51:13,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:13,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024345345] [2022-11-21 16:51:13,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:13,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:14,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:51:14,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:51:14,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024345345] [2022-11-21 16:51:14,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024345345] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:51:14,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:51:14,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:51:14,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283233039] [2022-11-21 16:51:14,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:51:14,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:51:14,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:51:14,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:51:14,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:51:14,124 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 119 [2022-11-21 16:51:14,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 112 transitions, 234 flow. Second operand has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:14,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:51:14,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 119 [2022-11-21 16:51:14,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:51:15,789 INFO L130 PetriNetUnfolder]: 2098/5352 cut-off events. [2022-11-21 16:51:15,789 INFO L131 PetriNetUnfolder]: For 189/189 co-relation queries the response was YES. [2022-11-21 16:51:15,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8758 conditions, 5352 events. 2098/5352 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 46534 event pairs, 252 based on Foata normal form. 0/5218 useless extension candidates. Maximal degree in co-relation 8701. Up to 1266 conditions per place. [2022-11-21 16:51:15,823 INFO L137 encePairwiseOnDemand]: 109/119 looper letters, 35 selfloop transitions, 6 changer transitions 90/208 dead transitions. [2022-11-21 16:51:15,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 208 transitions, 680 flow [2022-11-21 16:51:15,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 16:51:15,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-21 16:51:15,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1306 transitions. [2022-11-21 16:51:15,829 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8442146089204913 [2022-11-21 16:51:15,829 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1306 transitions. [2022-11-21 16:51:15,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1306 transitions. [2022-11-21 16:51:15,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:51:15,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1306 transitions. [2022-11-21 16:51:15,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 100.46153846153847) internal successors, (1306), 13 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:15,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:15,840 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:15,840 INFO L175 Difference]: Start difference. First operand has 121 places, 112 transitions, 234 flow. Second operand 13 states and 1306 transitions. [2022-11-21 16:51:15,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 208 transitions, 680 flow [2022-11-21 16:51:15,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 208 transitions, 662 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:51:15,845 INFO L231 Difference]: Finished difference. Result has 143 places, 104 transitions, 292 flow [2022-11-21 16:51:15,846 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=292, PETRI_PLACES=143, PETRI_TRANSITIONS=104} [2022-11-21 16:51:15,846 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 19 predicate places. [2022-11-21 16:51:15,847 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 104 transitions, 292 flow [2022-11-21 16:51:15,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:15,847 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:51:15,848 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:15,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:51:15,848 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 16:51:15,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:15,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1410559435, now seen corresponding path program 1 times [2022-11-21 16:51:15,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:15,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960927844] [2022-11-21 16:51:15,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:15,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:16,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:51:16,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:51:16,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960927844] [2022-11-21 16:51:16,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960927844] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:51:16,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:51:16,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:51:16,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678819323] [2022-11-21 16:51:16,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:51:16,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:51:16,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:51:16,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:51:16,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:51:16,091 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 119 [2022-11-21 16:51:16,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 104 transitions, 292 flow. Second operand has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:16,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:51:16,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 119 [2022-11-21 16:51:16,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:51:17,128 INFO L130 PetriNetUnfolder]: 1252/2717 cut-off events. [2022-11-21 16:51:17,129 INFO L131 PetriNetUnfolder]: For 4886/5035 co-relation queries the response was YES. [2022-11-21 16:51:17,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7767 conditions, 2717 events. 1252/2717 cut-off events. For 4886/5035 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 18969 event pairs, 671 based on Foata normal form. 70/2674 useless extension candidates. Maximal degree in co-relation 7701. Up to 1154 conditions per place. [2022-11-21 16:51:17,155 INFO L137 encePairwiseOnDemand]: 112/119 looper letters, 26 selfloop transitions, 4 changer transitions 49/162 dead transitions. [2022-11-21 16:51:17,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 162 transitions, 770 flow [2022-11-21 16:51:17,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:51:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-21 16:51:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 935 transitions. [2022-11-21 16:51:17,159 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.873015873015873 [2022-11-21 16:51:17,159 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 935 transitions. [2022-11-21 16:51:17,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 935 transitions. [2022-11-21 16:51:17,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:51:17,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 935 transitions. [2022-11-21 16:51:17,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 103.88888888888889) internal successors, (935), 9 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:17,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:17,168 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:17,169 INFO L175 Difference]: Start difference. First operand has 143 places, 104 transitions, 292 flow. Second operand 9 states and 935 transitions. [2022-11-21 16:51:17,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 162 transitions, 770 flow [2022-11-21 16:51:17,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 162 transitions, 740 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-11-21 16:51:17,196 INFO L231 Difference]: Finished difference. Result has 133 places, 107 transitions, 348 flow [2022-11-21 16:51:17,197 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=348, PETRI_PLACES=133, PETRI_TRANSITIONS=107} [2022-11-21 16:51:17,197 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 9 predicate places. [2022-11-21 16:51:17,198 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 107 transitions, 348 flow [2022-11-21 16:51:17,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:17,198 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:51:17,198 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:17,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:51:17,199 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 16:51:17,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:17,199 INFO L85 PathProgramCache]: Analyzing trace with hash -209857108, now seen corresponding path program 1 times [2022-11-21 16:51:17,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:17,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057577928] [2022-11-21 16:51:17,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:17,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:17,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:51:17,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:51:17,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057577928] [2022-11-21 16:51:17,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057577928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:51:17,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:51:17,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:51:17,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724021778] [2022-11-21 16:51:17,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:51:17,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:51:17,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:51:17,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:51:17,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:51:17,505 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 119 [2022-11-21 16:51:17,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 107 transitions, 348 flow. Second operand has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:17,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:51:17,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 119 [2022-11-21 16:51:17,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:51:18,927 INFO L130 PetriNetUnfolder]: 2684/5204 cut-off events. [2022-11-21 16:51:18,927 INFO L131 PetriNetUnfolder]: For 6680/7494 co-relation queries the response was YES. [2022-11-21 16:51:18,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12429 conditions, 5204 events. 2684/5204 cut-off events. For 6680/7494 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 39893 event pairs, 297 based on Foata normal form. 0/4876 useless extension candidates. Maximal degree in co-relation 12358. Up to 1342 conditions per place. [2022-11-21 16:51:19,016 INFO L137 encePairwiseOnDemand]: 109/119 looper letters, 67 selfloop transitions, 15 changer transitions 13/181 dead transitions. [2022-11-21 16:51:19,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 181 transitions, 774 flow [2022-11-21 16:51:19,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:51:19,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-21 16:51:19,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1039 transitions. [2022-11-21 16:51:19,021 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.873109243697479 [2022-11-21 16:51:19,021 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1039 transitions. [2022-11-21 16:51:19,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1039 transitions. [2022-11-21 16:51:19,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:51:19,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1039 transitions. [2022-11-21 16:51:19,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 103.9) internal successors, (1039), 10 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:19,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:19,029 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:19,029 INFO L175 Difference]: Start difference. First operand has 133 places, 107 transitions, 348 flow. Second operand 10 states and 1039 transitions. [2022-11-21 16:51:19,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 181 transitions, 774 flow [2022-11-21 16:51:19,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 181 transitions, 752 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-11-21 16:51:19,044 INFO L231 Difference]: Finished difference. Result has 135 places, 120 transitions, 435 flow [2022-11-21 16:51:19,044 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=435, PETRI_PLACES=135, PETRI_TRANSITIONS=120} [2022-11-21 16:51:19,045 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 11 predicate places. [2022-11-21 16:51:19,045 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 120 transitions, 435 flow [2022-11-21 16:51:19,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:19,046 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:51:19,046 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:19,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:51:19,047 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 16:51:19,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:19,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1259399672, now seen corresponding path program 1 times [2022-11-21 16:51:19,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:19,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277412190] [2022-11-21 16:51:19,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:19,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:19,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:51:19,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:51:19,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277412190] [2022-11-21 16:51:19,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277412190] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:51:19,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:51:19,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:51:19,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085675816] [2022-11-21 16:51:19,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:51:19,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:51:19,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:51:19,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:51:19,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:51:19,355 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 119 [2022-11-21 16:51:19,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 120 transitions, 435 flow. Second operand has 6 states, 6 states have (on average 98.33333333333333) internal successors, (590), 6 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:19,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:51:19,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 119 [2022-11-21 16:51:19,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:51:20,445 INFO L130 PetriNetUnfolder]: 939/3193 cut-off events. [2022-11-21 16:51:20,446 INFO L131 PetriNetUnfolder]: For 5102/5518 co-relation queries the response was YES. [2022-11-21 16:51:20,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8622 conditions, 3193 events. 939/3193 cut-off events. For 5102/5518 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 29959 event pairs, 351 based on Foata normal form. 77/3071 useless extension candidates. Maximal degree in co-relation 8549. Up to 535 conditions per place. [2022-11-21 16:51:20,474 INFO L137 encePairwiseOnDemand]: 113/119 looper letters, 40 selfloop transitions, 13 changer transitions 16/165 dead transitions. [2022-11-21 16:51:20,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 165 transitions, 805 flow [2022-11-21 16:51:20,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:51:20,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-21 16:51:20,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 930 transitions. [2022-11-21 16:51:20,477 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8683473389355743 [2022-11-21 16:51:20,477 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 930 transitions. [2022-11-21 16:51:20,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 930 transitions. [2022-11-21 16:51:20,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:51:20,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 930 transitions. [2022-11-21 16:51:20,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 103.33333333333333) internal successors, (930), 9 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:20,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:20,483 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:20,483 INFO L175 Difference]: Start difference. First operand has 135 places, 120 transitions, 435 flow. Second operand 9 states and 930 transitions. [2022-11-21 16:51:20,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 165 transitions, 805 flow [2022-11-21 16:51:20,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 165 transitions, 795 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-11-21 16:51:20,497 INFO L231 Difference]: Finished difference. Result has 149 places, 127 transitions, 566 flow [2022-11-21 16:51:20,498 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=566, PETRI_PLACES=149, PETRI_TRANSITIONS=127} [2022-11-21 16:51:20,498 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 25 predicate places. [2022-11-21 16:51:20,499 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 127 transitions, 566 flow [2022-11-21 16:51:20,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.33333333333333) internal successors, (590), 6 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:20,499 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:51:20,499 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:20,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:51:20,500 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 16:51:20,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:20,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1823849100, now seen corresponding path program 1 times [2022-11-21 16:51:20,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:20,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541297000] [2022-11-21 16:51:20,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:20,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:20,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:51:20,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:51:20,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541297000] [2022-11-21 16:51:20,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541297000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:51:20,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:51:20,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:51:20,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241360643] [2022-11-21 16:51:20,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:51:20,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:51:20,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:51:20,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:51:20,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:51:20,852 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 119 [2022-11-21 16:51:20,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 127 transitions, 566 flow. Second operand has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:20,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:51:20,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 119 [2022-11-21 16:51:20,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:51:22,313 INFO L130 PetriNetUnfolder]: 1623/5247 cut-off events. [2022-11-21 16:51:22,313 INFO L131 PetriNetUnfolder]: For 12469/12862 co-relation queries the response was YES. [2022-11-21 16:51:22,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15308 conditions, 5247 events. 1623/5247 cut-off events. For 12469/12862 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 53815 event pairs, 315 based on Foata normal form. 108/5097 useless extension candidates. Maximal degree in co-relation 15224. Up to 964 conditions per place. [2022-11-21 16:51:22,371 INFO L137 encePairwiseOnDemand]: 106/119 looper letters, 69 selfloop transitions, 24 changer transitions 25/206 dead transitions. [2022-11-21 16:51:22,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 206 transitions, 1321 flow [2022-11-21 16:51:22,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 16:51:22,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-21 16:51:22,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1072 transitions. [2022-11-21 16:51:22,375 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8189457601222307 [2022-11-21 16:51:22,375 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1072 transitions. [2022-11-21 16:51:22,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1072 transitions. [2022-11-21 16:51:22,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:51:22,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1072 transitions. [2022-11-21 16:51:22,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 97.45454545454545) internal successors, (1072), 11 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:22,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 119.0) internal successors, (1428), 12 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:22,382 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 119.0) internal successors, (1428), 12 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:22,382 INFO L175 Difference]: Start difference. First operand has 149 places, 127 transitions, 566 flow. Second operand 11 states and 1072 transitions. [2022-11-21 16:51:22,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 206 transitions, 1321 flow [2022-11-21 16:51:22,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 206 transitions, 1254 flow, removed 26 selfloop flow, removed 1 redundant places. [2022-11-21 16:51:22,441 INFO L231 Difference]: Finished difference. Result has 166 places, 144 transitions, 836 flow [2022-11-21 16:51:22,441 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=836, PETRI_PLACES=166, PETRI_TRANSITIONS=144} [2022-11-21 16:51:22,442 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 42 predicate places. [2022-11-21 16:51:22,442 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 144 transitions, 836 flow [2022-11-21 16:51:22,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:22,443 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:51:22,443 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:22,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:51:22,444 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 16:51:22,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:22,444 INFO L85 PathProgramCache]: Analyzing trace with hash 467103688, now seen corresponding path program 2 times [2022-11-21 16:51:22,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:22,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155388244] [2022-11-21 16:51:22,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:22,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:22,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:51:22,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:51:22,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155388244] [2022-11-21 16:51:22,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155388244] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:51:22,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:51:22,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:51:22,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043155872] [2022-11-21 16:51:22,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:51:22,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:51:22,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:51:22,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:51:22,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:51:22,766 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 119 [2022-11-21 16:51:22,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 144 transitions, 836 flow. Second operand has 7 states, 7 states have (on average 96.85714285714286) internal successors, (678), 7 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:22,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:51:22,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 119 [2022-11-21 16:51:22,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:51:25,260 INFO L130 PetriNetUnfolder]: 4004/8527 cut-off events. [2022-11-21 16:51:25,260 INFO L131 PetriNetUnfolder]: For 19310/20410 co-relation queries the response was YES. [2022-11-21 16:51:25,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26292 conditions, 8527 events. 4004/8527 cut-off events. For 19310/20410 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 77545 event pairs, 256 based on Foata normal form. 201/8514 useless extension candidates. Maximal degree in co-relation 26201. Up to 1499 conditions per place. [2022-11-21 16:51:25,353 INFO L137 encePairwiseOnDemand]: 109/119 looper letters, 75 selfloop transitions, 30 changer transitions 54/252 dead transitions. [2022-11-21 16:51:25,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 252 transitions, 1804 flow [2022-11-21 16:51:25,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 16:51:25,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-21 16:51:25,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1352 transitions. [2022-11-21 16:51:25,357 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8739495798319328 [2022-11-21 16:51:25,357 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1352 transitions. [2022-11-21 16:51:25,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1352 transitions. [2022-11-21 16:51:25,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:51:25,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1352 transitions. [2022-11-21 16:51:25,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 104.0) internal successors, (1352), 13 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:25,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:25,364 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:25,364 INFO L175 Difference]: Start difference. First operand has 166 places, 144 transitions, 836 flow. Second operand 13 states and 1352 transitions. [2022-11-21 16:51:25,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 252 transitions, 1804 flow [2022-11-21 16:51:25,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 252 transitions, 1722 flow, removed 41 selfloop flow, removed 0 redundant places. [2022-11-21 16:51:25,462 INFO L231 Difference]: Finished difference. Result has 182 places, 148 transitions, 840 flow [2022-11-21 16:51:25,462 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=840, PETRI_PLACES=182, PETRI_TRANSITIONS=148} [2022-11-21 16:51:25,463 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 58 predicate places. [2022-11-21 16:51:25,463 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 148 transitions, 840 flow [2022-11-21 16:51:25,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.85714285714286) internal successors, (678), 7 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:25,464 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:51:25,464 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:25,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:51:25,464 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 16:51:25,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:25,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1709928287, now seen corresponding path program 1 times [2022-11-21 16:51:25,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:25,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139670407] [2022-11-21 16:51:25,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:25,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:25,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:51:25,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:51:25,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139670407] [2022-11-21 16:51:25,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139670407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:51:25,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:51:25,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:51:25,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862814862] [2022-11-21 16:51:25,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:51:25,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:51:25,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:51:25,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:51:25,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:51:25,826 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 119 [2022-11-21 16:51:25,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 148 transitions, 840 flow. Second operand has 8 states, 8 states have (on average 97.0) internal successors, (776), 8 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:25,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:51:25,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 119 [2022-11-21 16:51:25,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:51:27,765 INFO L130 PetriNetUnfolder]: 3770/7979 cut-off events. [2022-11-21 16:51:27,765 INFO L131 PetriNetUnfolder]: For 23769/24653 co-relation queries the response was YES. [2022-11-21 16:51:27,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27210 conditions, 7979 events. 3770/7979 cut-off events. For 23769/24653 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 73429 event pairs, 244 based on Foata normal form. 115/7888 useless extension candidates. Maximal degree in co-relation 27164. Up to 1318 conditions per place. [2022-11-21 16:51:27,820 INFO L137 encePairwiseOnDemand]: 109/119 looper letters, 39 selfloop transitions, 22 changer transitions 84/233 dead transitions. [2022-11-21 16:51:27,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 233 transitions, 1658 flow [2022-11-21 16:51:27,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 16:51:27,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-21 16:51:27,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1626 transitions. [2022-11-21 16:51:27,824 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8539915966386554 [2022-11-21 16:51:27,825 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1626 transitions. [2022-11-21 16:51:27,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1626 transitions. [2022-11-21 16:51:27,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:51:27,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1626 transitions. [2022-11-21 16:51:27,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 101.625) internal successors, (1626), 16 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:27,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 119.0) internal successors, (2023), 17 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:27,834 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 119.0) internal successors, (2023), 17 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:27,835 INFO L175 Difference]: Start difference. First operand has 182 places, 148 transitions, 840 flow. Second operand 16 states and 1626 transitions. [2022-11-21 16:51:27,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 233 transitions, 1658 flow [2022-11-21 16:51:28,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 233 transitions, 1382 flow, removed 125 selfloop flow, removed 22 redundant places. [2022-11-21 16:51:28,272 INFO L231 Difference]: Finished difference. Result has 170 places, 129 transitions, 582 flow [2022-11-21 16:51:28,272 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=582, PETRI_PLACES=170, PETRI_TRANSITIONS=129} [2022-11-21 16:51:28,273 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 46 predicate places. [2022-11-21 16:51:28,273 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 129 transitions, 582 flow [2022-11-21 16:51:28,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 97.0) internal successors, (776), 8 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:28,274 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:51:28,274 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:28,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:51:28,275 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 16:51:28,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:28,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1453124704, now seen corresponding path program 1 times [2022-11-21 16:51:28,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:28,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769322041] [2022-11-21 16:51:28,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:28,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:29,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:51:29,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:51:29,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769322041] [2022-11-21 16:51:29,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769322041] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:51:29,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:51:29,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 16:51:29,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384839643] [2022-11-21 16:51:29,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:51:29,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:51:29,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:51:29,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:51:29,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:51:29,134 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 119 [2022-11-21 16:51:29,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 129 transitions, 582 flow. Second operand has 10 states, 10 states have (on average 87.0) internal successors, (870), 10 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:29,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:51:29,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 119 [2022-11-21 16:51:29,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:51:29,797 INFO L130 PetriNetUnfolder]: 270/1683 cut-off events. [2022-11-21 16:51:29,797 INFO L131 PetriNetUnfolder]: For 3532/3637 co-relation queries the response was YES. [2022-11-21 16:51:29,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4699 conditions, 1683 events. 270/1683 cut-off events. For 3532/3637 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 17128 event pairs, 11 based on Foata normal form. 1/1589 useless extension candidates. Maximal degree in co-relation 4615. Up to 235 conditions per place. [2022-11-21 16:51:29,809 INFO L137 encePairwiseOnDemand]: 102/119 looper letters, 44 selfloop transitions, 21 changer transitions 24/180 dead transitions. [2022-11-21 16:51:29,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 180 transitions, 1074 flow [2022-11-21 16:51:29,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 16:51:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-21 16:51:29,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1249 transitions. [2022-11-21 16:51:29,813 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7496998799519808 [2022-11-21 16:51:29,814 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1249 transitions. [2022-11-21 16:51:29,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1249 transitions. [2022-11-21 16:51:29,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:51:29,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1249 transitions. [2022-11-21 16:51:29,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 89.21428571428571) internal successors, (1249), 14 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:29,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 119.0) internal successors, (1785), 15 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:29,822 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 119.0) internal successors, (1785), 15 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:29,822 INFO L175 Difference]: Start difference. First operand has 170 places, 129 transitions, 582 flow. Second operand 14 states and 1249 transitions. [2022-11-21 16:51:29,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 180 transitions, 1074 flow [2022-11-21 16:51:29,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 180 transitions, 937 flow, removed 45 selfloop flow, removed 17 redundant places. [2022-11-21 16:51:29,852 INFO L231 Difference]: Finished difference. Result has 165 places, 138 transitions, 642 flow [2022-11-21 16:51:29,853 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=642, PETRI_PLACES=165, PETRI_TRANSITIONS=138} [2022-11-21 16:51:29,854 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 41 predicate places. [2022-11-21 16:51:29,854 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 138 transitions, 642 flow [2022-11-21 16:51:29,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.0) internal successors, (870), 10 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:29,855 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:51:29,855 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:29,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:51:29,856 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 16:51:29,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:29,856 INFO L85 PathProgramCache]: Analyzing trace with hash 153301354, now seen corresponding path program 2 times [2022-11-21 16:51:29,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:29,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101529755] [2022-11-21 16:51:29,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:29,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:31,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:51:31,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:51:31,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101529755] [2022-11-21 16:51:31,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101529755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:51:31,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:51:31,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-21 16:51:31,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309719567] [2022-11-21 16:51:31,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:51:31,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-21 16:51:31,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:51:31,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-21 16:51:31,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:51:31,096 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 119 [2022-11-21 16:51:31,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 138 transitions, 642 flow. Second operand has 12 states, 12 states have (on average 85.58333333333333) internal successors, (1027), 12 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:31,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:51:31,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 119 [2022-11-21 16:51:31,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:51:31,729 INFO L130 PetriNetUnfolder]: 254/1541 cut-off events. [2022-11-21 16:51:31,729 INFO L131 PetriNetUnfolder]: For 2036/2065 co-relation queries the response was YES. [2022-11-21 16:51:31,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3994 conditions, 1541 events. 254/1541 cut-off events. For 2036/2065 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 15254 event pairs, 21 based on Foata normal form. 7/1471 useless extension candidates. Maximal degree in co-relation 3965. Up to 188 conditions per place. [2022-11-21 16:51:31,738 INFO L137 encePairwiseOnDemand]: 102/119 looper letters, 30 selfloop transitions, 17 changer transitions 36/173 dead transitions. [2022-11-21 16:51:31,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 173 transitions, 1015 flow [2022-11-21 16:51:31,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 16:51:31,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-21 16:51:31,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1232 transitions. [2022-11-21 16:51:31,742 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7394957983193278 [2022-11-21 16:51:31,742 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1232 transitions. [2022-11-21 16:51:31,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1232 transitions. [2022-11-21 16:51:31,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:51:31,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1232 transitions. [2022-11-21 16:51:31,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 88.0) internal successors, (1232), 14 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:31,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 119.0) internal successors, (1785), 15 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:31,750 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 119.0) internal successors, (1785), 15 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:31,751 INFO L175 Difference]: Start difference. First operand has 165 places, 138 transitions, 642 flow. Second operand 14 states and 1232 transitions. [2022-11-21 16:51:31,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 173 transitions, 1015 flow [2022-11-21 16:51:31,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 173 transitions, 966 flow, removed 20 selfloop flow, removed 7 redundant places. [2022-11-21 16:51:31,773 INFO L231 Difference]: Finished difference. Result has 173 places, 133 transitions, 618 flow [2022-11-21 16:51:31,774 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=618, PETRI_PLACES=173, PETRI_TRANSITIONS=133} [2022-11-21 16:51:31,775 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 49 predicate places. [2022-11-21 16:51:31,775 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 133 transitions, 618 flow [2022-11-21 16:51:31,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 85.58333333333333) internal successors, (1027), 12 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:31,776 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:51:31,776 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:31,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 16:51:31,776 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 16:51:31,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:31,777 INFO L85 PathProgramCache]: Analyzing trace with hash 140971094, now seen corresponding path program 3 times [2022-11-21 16:51:31,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:31,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447999432] [2022-11-21 16:51:31,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:31,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:51:31,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:51:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:51:31,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:51:31,924 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 16:51:31,925 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-21 16:51:31,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-21 16:51:31,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-21 16:51:31,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-21 16:51:31,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-21 16:51:31,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-21 16:51:31,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 16:51:31,929 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:31,937 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 16:51:31,937 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:51:32,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:51:32 BasicIcfg [2022-11-21 16:51:32,059 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:51:32,060 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:51:32,060 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:51:32,060 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:51:32,061 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:51:12" (3/4) ... [2022-11-21 16:51:32,063 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-21 16:51:32,225 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cdfdaaf-12a2-4fa4-96d3-79a56e53a4f5/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 16:51:32,225 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:51:32,226 INFO L158 Benchmark]: Toolchain (without parser) took 21659.19ms. Allocated memory was 155.2MB in the beginning and 983.6MB in the end (delta: 828.4MB). Free memory was 112.4MB in the beginning and 304.4MB in the end (delta: -192.0MB). Peak memory consumption was 638.5MB. Max. memory is 16.1GB. [2022-11-21 16:51:32,226 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory is still 71.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:51:32,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 679.24ms. Allocated memory is still 155.2MB. Free memory was 111.9MB in the beginning and 88.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-21 16:51:32,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.99ms. Allocated memory is still 155.2MB. Free memory was 88.4MB in the beginning and 86.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:51:32,227 INFO L158 Benchmark]: Boogie Preprocessor took 31.43ms. Allocated memory is still 155.2MB. Free memory was 86.4MB in the beginning and 84.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:51:32,228 INFO L158 Benchmark]: RCFGBuilder took 920.66ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 117.6MB in the end (delta: -33.3MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2022-11-21 16:51:32,228 INFO L158 Benchmark]: TraceAbstraction took 19785.17ms. Allocated memory was 155.2MB in the beginning and 983.6MB in the end (delta: 828.4MB). Free memory was 116.9MB in the beginning and 328.5MB in the end (delta: -211.6MB). Peak memory consumption was 616.4MB. Max. memory is 16.1GB. [2022-11-21 16:51:32,228 INFO L158 Benchmark]: Witness Printer took 165.77ms. Allocated memory is still 983.6MB. Free memory was 328.5MB in the beginning and 304.4MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-21 16:51:32,230 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.29ms. Allocated memory is still 117.4MB. Free memory is still 71.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 679.24ms. Allocated memory is still 155.2MB. Free memory was 111.9MB in the beginning and 88.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.99ms. Allocated memory is still 155.2MB. Free memory was 88.4MB in the beginning and 86.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.43ms. Allocated memory is still 155.2MB. Free memory was 86.4MB in the beginning and 84.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 920.66ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 117.6MB in the end (delta: -33.3MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19785.17ms. Allocated memory was 155.2MB in the beginning and 983.6MB in the end (delta: 828.4MB). Free memory was 116.9MB in the beginning and 328.5MB in the end (delta: -211.6MB). Peak memory consumption was 616.4MB. Max. memory is 16.1GB. * Witness Printer took 165.77ms. Allocated memory is still 983.6MB. Free memory was 328.5MB in the beginning and 304.4MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L718] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0] [L719] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L720] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L721] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L722] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L723] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L724] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0] [L725] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L726] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L727] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L728] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0] [L729] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L730] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L731] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L732] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L733] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L734] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L735] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L737] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L739] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L741] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L742] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L743] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L843] 0 pthread_t t1001; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t1001={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t1001, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1001, ((void *)0), P0, ((void *)0))=-2, t1001={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1002; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t1001={5:0}, t1002={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t1002, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1002, ((void *)0), P1, ((void *)0))=-1, t1001={5:0}, t1002={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L847] 0 pthread_t t1003; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L848] FCALL, FORK 0 pthread_create(&t1003, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1003, ((void *)0), P2, ((void *)0))=0, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] - 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: 846]: 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: 848]: 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: 844]: 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 7 procedures, 148 locations, 6 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: 19.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 805 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 805 mSDsluCounter, 682 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 547 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1473 IncrementalHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 135 mSDtfsCounter, 1473 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=840occurred in iteration=7, InterpolantAutomatonStates: 112, 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.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 907 NumberOfCodeBlocks, 907 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 804 ConstructedInterpolants, 0 QuantifiedInterpolants, 4225 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-21 16:51:32,265 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cdfdaaf-12a2-4fa4-96d3-79a56e53a4f5/bin/uautomizer-vX5HgA9Q3a/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